Comparison of interestingness measures for Web usage mining: An empirical study

International Journal of Information Technology and Decision Making

Volumn 6, Issue 1, 2007, Pages 15-41

  Huang, Xiangji ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

Association rule mining; Interestingness measures; Sequential pattern mining; Web log mining

Indexed keywords

EID: 33947629848     PISSN: 02196220     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219622007002368     Document Type: Article

References (42)

1. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, in Proc. 20th Int. Conf. Very Large Databases, Santiago, Chile (September 1994).
2. R. Agrawal and R. Srikant, Mining sequential patterns, in Proc. Int. Conf. Data Engineering, Taipei, Taiwan (March 1995), pp. 3-14.
3. R. Agrawal and J. Shafer, Parallel mining of association rules, IEEE Transactions on Knowledge and Data Engineering 8(6) (1996) 962-969.
4. A. An and N. Cereone, Rule quality measures for rule induction systems: Description and evaluation, Computational Intelligence 17(3) (2001).
5. J. Borges and M. Levene, Generating dynamic higher-order Markov models in web usage mining, in Proc. 9th European Conf. Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal (October 2005), pp. 34-45.
6. S. Brin, R. Motwani, J. Ullman and S. Tsur, Dynamic itemset counting and implication rules for market basket data, in Proc. 1997 ACM-SIGMOD Int. Conf. on Management of Data, Montreal, Canada (1997), pp. 255-264.
7. I. Bruha, Quality of decision rules: Definitions and classification schemes for multiple rules, in Machine Learning and Statistics, The Interface, eds. G. Nakhaeizadeh and C. C. Taylor (Jone Wiley & Sons Inc. 1996).
8. J. Han, V. T. Cheung, A. W. Ng and Y. Fu, A fast distributed algorithm for mining association rules, in Proc. Int. Conf. Parallel and Distributed Information Systems (PDIS'96), Miami Beach, Florida, USA (1996).
9. L. Cristofor and D. Simovici, Generating an informative cover for association rules, Technical Report TR-02-01, Department of Computer Science, University of Massachusetts at Boston, Boston, MA (2002).
10. R. Fano, Transmission of Information: A Statistical Theory of Communications (MIT Press, Cambridge, MA, 1961).
11. J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, in Proc. 2000 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'00), Dallas, TX (2000).
12. R. J. Hilderman and H. J. Hamilton, Knowledge discovery and interestingness measures: A survey, Tech. Report 99-4, Department of Computer Science, University of Regina (1999) 27 pages.
13. X. Hu and N. Cercone, "A data warehouse/OLAP framework for web usage mining and business intelligence reporting, Int. J. Intelligence Systems 19(7) (2004) 567-584.
14. X. Hu, T. Y. Lin and J. Han, A new rough set model based on database systems, J. Fundamental Informatics 59(2-3) (2004) 135-152.
15. X. Huang, A. An, N. Cereone and G. Promhouse, Discovery of interesting association rules from livelink web log data, in Proc. 2002 IEEE Int. Conf. Data Mining (ICDM'02), Maebashi City, Japan (2002).
16. X. Huang, F. Peng, A. An and D. Schuurmans, Dynamic web log session identification with statistical language models, J. American Society for Information Science, and Technology (JASIST), Special Issue on Webometrics, 55 (14) (2004) 1290-1303.
17. X. Jin, Y. Zhou and B. Mobasher, A maximum entropy web recommendation system: Combining collaborative and content features, in Proc. 11th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Chicago, Illinois (August 2005), pp. 612-617.
18. M. Levene and G. Loizou, Computing the entropy of user navigation in the web, Int. J. Information Technology & Decision Making, 2(3) (2003) 459-476.
19. B. Liu, W. Hsu and Y. Ma, Pruning and summarizing the discovered associations, in Proc. fifth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, San Diego, CA (1999), pp. 125-134.
20. M. D. Mulvenna, S. S. Anand and A. G. Buchner, Personalization on the net using web mining, Communications of the ACM, 43(8) (August 2000) 122-125.
21. S. Oh and J. Kim, A sequence-element-based hierarchical clustering algorithm for categorical sequence data, Int. J. Information Technology & Decision Making 4(1) (2005) 81-96.
22. J. Pei, J. Han and R. Mao, CLOSET: An efficient algorithm for mining frequent closed itemsets, in Proc. ACM SIGMOD'00 Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX (2000).
23. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal and M. C. Hsu, PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth, in Proc. 2001 Int. Conf. on Data Engineering (ICDE'01), Heidelberg, Germany (2001).
24. J. Pei, J. Han and L. V. S. Lakshmanan, Mining frequent itemsets with convertible constraints, in Proc. IEEE Int. Conf. on Data Eng. (ICDE'01), Heidelberg, Germany (February 2001).
25. J. Pei, J. Han and W. Wang, Mining sequential patterns with constraints in large databases, in Proc. 11th Int. Conf. Information and Knowledge Management (CIKM'02), McLean, VA (2002).
26. G. Piatetsky-Shapiro, Discovery, analysis and presentation of strong rules, Knowledge Discovery in Databases, AAAI (1991), p. 229.
27. J. Srivastava, R. Cooley, M. Deshpande and P. Tan, Web usage mining: Discovery and applications of usage patterns from web data, SIGKDD Explorations 1(2) (2000) 12-23.
28. A. Savasere, E. Omiecinski and S. Navathe, An efficient algorithm for mining association rules in large databases, in Proc. 21st Int. Conf. Very Large Databases (VLDB'95), Zurich, Swizerland (1995), pp. 407-419.
29. D. Shah, L. V. S. Lakshmanan, K. Ramamritham and S. Sudarshan, Interestingness and pruning of mined patterns, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (May 1999).
30. A. Silberschatz and A. Tuzhilin, What makes patterns interesting in knowledge discovery systems, IEEE Transactions on Knowledge and Data Eng. 8(6) (1996) 970-974.
31. R. Srikant and R. Agrawal, Mining quantitative association rules in large relational tables, in Proc. ACM-SIGMOD Int. Conf. Management of Data, Montreal, Canada (1996) 1-12.
32. R. Srikant, Q. Vu and R. Agrawal, Mining association rules with item constraints, in Proc. Third Int. Conf. Knowledge Discovery in Databases, Newport Beach, CA (1997), pp. 67-73.
33. P. Tan and V. Kumar, Interestingness measures for association patterns: A perspective", Technical Report TR00-036, Department of Computer Science, University of Minnestota (2000).
34. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hatonen and H. Mannila, Pruning and grouping discovered association rules, in Proc. First Int. Conf. Knowledge Discovery and Data Mining (KDD'95), Montreal, Canada (AAAI Press, 1995).
35. H. Toivonen, Sampling large databases for association rules, in Proc. 22nd VLDB (1996).
36. K. Wang, S. Zhou, Q. Yang and J. Yeung, Mining customer value: From association rules to direct marketing, Data Mining and Knowledge Discovery 11(1) (2005) 57-79.
37. J. Yang, W. Wang and P. Yu, Info-miner: Mining surprising periodic patterns, in Proc. 7th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (2001), pp. 395-400.
38. M. J. Zaki, S. Parthasarathy and W. Li and M. Ogihara, Evaluation of sampling for data mining of association rules, in Proc. 7th Workshop on Research Issues in Data Mining (1997).
39. M. J. Zaki, S. Parthasarathy and W. Li, A localized algorithm for parallel association mining, in Proc. 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Newport, Rhode Island (1997), pp. 321-330.
40. M. J. Zaki, Generating Non-redundant association rules, in Proc. 6th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Boston, MA (August 2000), pp. 34-43.
41. M. J. Zaki, SPADE: An efficient algorithm for mining frequent sequences, Machine Learning Journal 42(1 /2) (January/February 2001), pp. 31-60.
42. Z. Zheng, R. Kohavi and L. Mason, Real world performance of association rule algorithms, in Proc. 7th ACM-SIGKDD Int. Conf. Knowledge Discovery and Data Mining, New York, NY (2001).