Abstract
Existing mining association rules in relational tables only focus on discovering the relationship among large data items in a database. However, association rule for significant rare items that appear infrequently in a database but are highly related with other items is yet to be discovered. In this paper, we propose an algorithm called Extraction Least Pattern (ELP) algorithm that using a couple of predefined minimum support thresholds. Results from the implementation reveal that the algorithm is capable of mining rare item in multi relational tables. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Selamat, S. H., Deris, M. M., Mamat, R., & Bakar, Z. A. (2005). Mining least relational patterns from multi relational tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3584 LNAI, pp. 59–66). Springer Verlag. https://doi.org/10.1007/11527503_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
