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.
Similar content being viewed by others
References
Agarwal, R., & Strikant, R. (1994, September) Fast algorithms for mining association rules. In Proceedings of 20th International Conference on Very Large Data Bases Santiago, Chile (pp. 487–499).
Agarwal, R., Imielinski, T., & Swami, A. (1993, May). Mining association rules between sets of items in large databases. In Proceedings ACM SIGMOD International Conference on Management of Data Washington, District of Columbia, USA (pp. 207–216).
Agarwal, R., Aggarwal, C., & Prasad, V. V. V. (2000). A tree projection algorithm for generation of frequent itemsets. In Journal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining).
Bayardo, R. J. (May, 1998). Efficiently mining long patterns from databases. In Proceedings of the International ACM SIGMOD Conference (pp. 85–93).
Brin, S., Motwani, R., Ullman, J., & Tsur, S. (May, 1997). Dynamic itemset counting and implication rules for market basket data. In Proceedings of the International ACM SIGMOD Conference (pp. 255–264). Tucson, Arizona, USA.
Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996). From data mining to knowledge discovery: An overview. In AAAI Press/MIT Press (Eds.), Advances in Knowledge Discovery and Data Mining (pp. 1–36).
Han, J., Pei, J., & Yin, Y. (May, 2000). Mining frequent patterns without candidate generation. In Proceedings of ACM-SIGMOD International Conference on Management of Data (pp. 1–12). Dallas, Texas.
Han, J., Pei, J., Yin, Y., & Mao, R. (2004). Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Journal of Data Mining and Knowledge Discovery, 8, 53–87.
Huang, X., An, A., & Cercone, N. (2002a). Evaluation of interestingness measures in a real world application. In submitted for Journal publication.
Huang, X., An, A., Cercone, N., & Promhouse, G. (2002b). Discovery of interesting association rules from livelink web log data. In Proceedings of IEEE International Conference on Data Mining. Maebashi City, Japan.
Liu, J., Pan, Y., Wang, K., & Han, J. (2002, July). Mining frequent itemsets by opportunistic projection. In Proceedings of ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining. Edmonton, Canada.
Mannila, H., Toivonen, H., & Verkamo, A. I. (1994, July). Efficient algorithms for discovering association rules. In AAAI Workshop on Knowledge Discovery in Databases (pp. 181–192).
Park, J. S., Chen, M. S., & Yu, P. S. (May, 1995). An effective hash-based algorithm for mining association rules. In Proceedings of ACM-SIGMOD International Conference on Management of Data. San Jose, California.
Pei, J. (2002). Pattern-growth methods for frequent pattern mining. PhD thesis, Simon Fraser University.
Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., & Yang, D. (2001, November). H-mine: Hyper-structure mining of frequent patterns in large database. In Proceedings of the IEEE International Conference on Data Mining. San Jose, California.
Savasere, A., Omiecinski, E., & Navathe, S. (1995, September). An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases. Zurich, Switzerland.
Savasere, A., Omiecinski, E., & Navathe, S. (1998, February). Mining for strong negative associations in a large database of customer transactions. In Proceedings of the 14th International Conference on Data Engineering (pp. 494–502). Orlando, Florida.
Tan, P., & Kumar, V. (2000, August). Interestingness measures for association patterns: A perspective. In KDD 2000 Workshop on Postprocessing in Machine Learning and Data Mining. Boston, Massachusetts.
Tan, P., & Kumar, V. (2001, August). Mining indirect associations in web data. In Proc of WebKDD2001: Mining Log Data Across All Customer TouchPoints.
Tan, P., Kumar, V., & Srivastava, J. (2000). Indirect association: Mining higher order dependencies in data. In Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (pp. 632–637). Lyon, France.
Tan, P., Kumar, V., & Kuno, H. (2001). Using sas for mining indirect associations in data. In Proc of the Western Users of SAS Software Conference.
Tan, P., Kumar, V., & Srivastava, J. (2002, July). Selecting the right interestingness measure for association patterns. In Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining. Edmonton, Canada.
Wan, Q., & An, A. (2003, June). Efficient mining of indirect associations using hi-mine. In Proceedings of 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003. Halifax, Canada.
Wong, & Butz, C. J. (2001). Constructing the dependency structure of a multi-agent probability network. IEEE Transactions on Knowledge and Data Engineering, 13(3), 395–415.
Wu, X., Zhang, C., & Zhang, S. (2002, July). Mining both positive and negative association rules. In Proceedings of the 19th International Conference on Machine Learning (ICML-2002) (pp. 658–665). Sydney, Australia.
Zaki, M., & Orihara, M. (1998, June). Theoretical foundations of association rules. In Proceedings of the 3rd ACM-SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. Seattle, Washington.
Zheng, Z., Kohavi, R., & Mason, L. (2001, August). Real world performance of association rule algorithms. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, California.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wan, Q., An, A. An efficient approach to mining indirect associations. J Intell Inf Syst 27, 135–158 (2006). https://doi.org/10.1007/s10844-006-2618-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10844-006-2618-8