Browse > Article

Deriving Local Association Rules by User Segmentation  

Park, Se-Il (Dept.of Computer, Soongsil University)
Lee, Soo-Wun (Dept.of Computer, Soongsil University)
Publication Information
Journal of KIISE:Software and Applications / v.29, no.1_2, 2002 , pp. 53-64 More about this Journal
Abstract
Association rule discovery is a method that detects associative relationships between items or attributes in transactions. It is one of the most widely studied problems in data mining because it offers useful insight into the types of dependencies that exist in a data set. However, most studies on association rule discovery have the drawback that they can not discover association rules among user groups that have common characteristics. To solve this problem, we segment the set of users into user-subgroups by using feature selection and the user segmentation, thus local association rules in user-subgroup can be discovered. To evaluate that the local association rules are more appropriated than the global association rules in each user-subgroup, derived local association rules are compared with global association rules in terms of several evaluation measures.
Keywords
Local Association; User Segmentation; Association Rles Juteresting Measures;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Agrawal and R. Srikant, 'Fast algorithms for mining association rules large databases'. In VLDB-94
2 R. Srikant adn R. Agrawal, 'Mining Sequential Patterns Generalizations and Performance Improvements', Proc. of the Fifth Int'l Conf. on Extending Database Technology(EDBT), Avignon, France, March 1996
3 R. Srikant, and R. Agrawal, 'Mining quantitative association rules in large relational tables', In Proceedings of the ACM SIGMOD Conference on Management of Data, Montreal, Canada, June 1996   DOI   ScienceOn
4 A. Silberschatz and A. Tuzhilin. 'On subjective measures of interestingness in knowledge discovery'. Proceedings of the First International Conference on Knowledge Discovery and Data Mining, 1995
5 Ng. R. T. Lakshmanan, L. Han, J. 'Exploratory mining and pruning optimizations of constrained association rules.' SIGMOD-98. 1998   DOI
6 S. Brin and R. Motwani, 'Dynamic itemset counting and implication rules for market basket data,' SIGMOD Record(ACM Special Interest Group on Management of Data), 26(2):255, 1997   DOI
7 A. Sarasere, E. Omiecinsky, and S. Navathe, 'An cfficient algorithm for mining association rules in large databases'. In 21st Int'l Conf. on Very Large Databases(VLDB), ZTrich, Switzerland, Sept. 1995
8 J. S. Park, M. S. Chen, and P. S. Yu. 'Efficient parallel data mining for association rules.' In Proc. 1995 International Conference on Information and Knowledge Management, Baltimore, MD, November 1995   DOI
9 H. Toivonen, 'Sampling large databases for association rules.' Proc. 22nd VLDB, 1996
10 R. J. Hilderman and H.J. Hamilton. 'Knowledge discovery and interestingness measures: A survey.' Technical Report CS 99-04, Department of Computer Science, University of Regina, October 1999
11 D. Lewis, 'Feature selection and feature extraction for text categorization.' Proceedings of Speech and Natural Language Workshop (pp. 212-217). San Francsico: Morgan Kaufman, 1992   DOI
12 C. Silverstein, R. Motwani, and S. Brin. 'Beyond market baskets: Generalizing association rules to correlations.' In SIGMOD, 1997   DOI   ScienceOn
13 P. N. Tan and V. Kumar, 'Interestingness Measures for Association Patterns : A Perspective.' TR00-036. ftp://ftp.cs.umn.edu/dept/users/kumar/WEB/, 2000
14 Deogun,J ., Choubey, S. 'On Feature Selcction and Effective Cjassifiers.' Journal of ASIS 49, 423-434, May 1998
15 L.Talavera. 'Feature selection as a preprocessing step for hierarchical clustering.' In Proceedings of the 16th International Conference on Machine Learning, pages 389-397. Morgan Kaufmann, 1999
16 문홍기. '배경지식을 황용한 연관규칙 발견 및 확장.' 숭실대학교 석사학위 논문, 2000
17 R. Kohavi, John, G. 'Wrappers for Feature Subset Selection.' In Artificial Intelligence journal, special issue on relevance, Vol. 97, No. 1-2 (pp.273-324), 1997   DOI   ScienceOn