Abstract
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has been noted recently that some of the infrequent patterns, such as indirect associations, provide useful insight into the data. In this paper, we propose an efficient algorithm, called HI-mine, based on a new data structure, called HI- struct, for mining the complete set of indirect associations between items. Our experimental results show that HI-mine’s performance is significantly better than that of the previously developed algorithm for mining indirect associations on both synthetic and real world data sets over practical ranges of support specifications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In J. of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2000.
C. Aggarwal and P. Yu. A new framework for itemset generation. In Proc. of the Fourth Int’l Conference on Knowledge Discovery and Data Mining, pages 129–133, New York, NY, 1996.
R. Agrawal and R. Srikant. Fast Algorithms for mining association rules. Proceedings of the 20th Int’l Conference on Very Large Data Bases, 487–499, Santiago, Chile 1994.
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD int’l Conference on Management of Data, pp 207–216, Washington D.C., USA 1993.
S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Proc. ACM SIGMOD intl. Conf. Management of Data, pages 265–276, Tucson, AZ, 1997.
J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation, In SIGMOD’00, pages 1–12.
J. S. Park, M. S. Chen, and P. S. Yu. An efficient hash-based algorithm for mining association rules. SIGMOD Record, 25(2):175–186, 1995.
J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Database.
J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. 2000 ACM-SIGMOD Int. Workshop Data Mining and Knowledge Discovery (DMKD’00), pages 11–20.
P. Tan and V. Kumar. Interestingness measures for association patterns: A perspective. In KDD 2000 Workshop on Postprocessing in Machine Learning and Data Mining, Boston, MA, August 2000.
P. N. Tan, and V. Kumar. Mining Indirect Associations in Web Data. In Proc of WebKDD 2001: Mining Log Data Across All Customer TouchPoints, August 2001
P. N. Tan, V Kumar, H Kuno. Using SAS for Mining Indirect Associations in Data, In Proc of the Western Users of SAS Software Conference 2001.
P. N. Tan, V. Kumar, and J. Srivastava. Indirect Association: Mining Higher Order Dependences in Data. Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, 632–637, Lyon, France 2000.
Savasere, E. Omiecinski, and S. Navathe. Mining for strong negative associations in a large database of customer transactions. In Proc. of the 14th International Conference on Data Engineering, pages 494–502, Orlando, Florida, February 1998.
Savaswre, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st Int. Conf. on Very Large Databases (VLDB’95), Zurich, Switzerland, Sept., 1995.
Wong and C. J. Butz. Constructing the Dependency Structure of a Multi-Agent Probability Network. IEEE Transactions on Knowledge and Data Engineering, Vol. 13, No. 3, 395–415, May 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wan, Q., An, A. (2003). Efficient Mining of Indirect Associations Using HI-Mine. In: Xiang, Y., Chaib-draa, B. (eds) Advances in Artificial Intelligence. Canadian AI 2003. Lecture Notes in Computer Science, vol 2671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44886-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-44886-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40300-5
Online ISBN: 978-3-540-44886-0
eBook Packages: Springer Book Archive