Compact Structure Representation in Discovering Frequent Patterns for Association Rules

Authors

  • Norwati Mustapha Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia
  • M. Nasir Sulaiman Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia
  • M. Othman Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia
  • M. Hassan Selamat Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia

DOI:

https://doi.org/10.32890/jict2002.1.1.2

Keywords:

Frequent patterns, candidate sets, association rules, lexicographic tree, itemsets

Abstract

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.

References

Agrawal, R. I. T., & Swami, A. (1993). Mining Association Rules between Sets of Items in very Large Databases. Proceedings of the ACM SIGMOD Conference on Management of Data, 207-216.

Agrawal, R., & Srikant, R. (1994). Fast Algorithms for Mining Association Rules. Proceedings of the 20" International Conference on Very Large Databases (VLDB’94), 487-499.

Brin, S. M. R., & Silverstein, C. (1997a). Beyond Market Baskets: Generalizing Association Rules to Correlation. Proceedings of ACM SIGMOD, 265-276.

Brin, S. M. R., Ullman, J.D., & Tsur, S. (1997b). Dynamic Itemset Counting and Implication Rules for Market Basket Data. Proceedings of ACM SIGMOD, 255-264.

Holsheimer, M., Kersten, M., Mannila, H., & Toivonen, H. (1995). A Perspective on Databases and Data Mining. 1“ KDD Conference.

Klemettinen, M., Manilla, H., Ronkainen, P., Toivonen, H., & Verkamo, A.I. (1994). Finding Interesting Rules from Large Sets of Discovered Association Rules. Proceedings of CIKM’94, 401-408. Murphy, P.M. Repository of Machine Learning and Domain Theories. http://www. ics.uci.edu/~mlearn/MLRepository.html.

Park J.S., Chen, M.S & Yu, P.S. (1995). Using a Hash-based Methods with Transaction Trimming for Mining Association Rules. JEEE Transaction of Knowledge and Data Engineering, 9(5):813-825.

Savasere, A., Omiecinski, E., & Navathe, S. (1995). An Efficient Algorithm for Mining Association Rules in Large Databases. Proceedings of the International Conference on Very Large Databases (VLDB’95), 432-443.

Downloads

Published

03-06-2002

Issue

Vol. 1 No. 1 (2002): Journal of Information and Communication Technology (JICT) Vol.1, No.1, June 2002

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

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, 1(1), 19-31. https://doi.org/10.32890/jict2002.1.1.2

Research impact

Harvested 2026-09-06
0 citations recorded so far

Counts differ between services because each indexes a different body of literature. None of them is the whole picture.

Identifiers DOI 10.32890/jict2002.1.1.2 OpenAlex W101630851

Most read articles by the same author(s)