EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Compact Structure Representation in Discovering Frequent Patterns for Association Rules

Norwati Mustapha, M. Nasir Sulaiman, M. Othman, M. Hassan Selamat

Journal of Information and Communication Technology · 2002

DOI: 10.32890/jict2002.1.1.2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Information and Communication Technology, 2002. Verfasst von Norwati Mustapha und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. Structure used in typical algorithms for solving this problem operate in several database scans and a large number of candidate generation. This paper presents a compact structure representation called Flex-tree in discovering frequent patterns for association rules. Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. Efficiency of mining is achieved with one scan of database instead of repeated database passes done in other methods and avoid the costly generation of large numbers of candidate sets, which dramatically reduces the search space.

Zitieren

APA

Mustapha, N., Sulaiman, M. N., Othman, M., & Selamat, M. H. (2002). Compact Structure Representation in Discovering Frequent Patterns for Association Rules. Journal of Information and Communication Technology. https://doi.org/10.32890/jict2002.1.1.2

Vancouver

Mustapha N, Sulaiman MN, Othman M, Selamat MH. Compact Structure Representation in Discovering Frequent Patterns for Association Rules. Journal of Information and Communication Technology. 2002. doi:10.32890/jict2002.1.1.2

BibTeX
@article{Mustapha2002,
  author = {Mustapha, Norwati and Sulaiman, M. Nasir and Othman, M. and Selamat, M. Hassan},
  title = {Compact Structure Representation in Discovering Frequent Patterns for Association Rules},
  journal = {Journal of Information and Communication Technology},
  year = {2002},
  doi = {10.32890/jict2002.1.1.2}
}
Kostenlos starten →