Summary queries for frequent itemsets mining

Journal of Systems and Software

Volumn 83, Issue 3, 2010, Pages 405-411

  Zhang, Shichao ^a,b   Jin, Zhi ^c   Lu, Jingli ^d  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

^b NANJING UNIVERSITY   (China)

^c Peking University   (China)

^d MASSEY UNIVERSITY   (New Zealand)

Author keywords

Frequent pattern discovery; Summary query; Support distribution

Indexed keywords

APPROXIMATION SOLUTION; DATA SETS; DECISION MAKERS; FREQUENT ITEMSETS; FREQUENT PATTERN DISCOVERY; ITEM SETS; ITEMSET; RELATIVE FREQUENCIES; STATISTICAL PARAMETERS; WELL MODEL;

MINING;

EID: 75349102870     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2009.09.026     Document Type: Article

References (26)

1. Agrawal, R., Imielinski, T., Swami, A., 1993. Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 207-216.
2. Brin, S., Motwani, R., Silverstein, C., 1997. Beyond market baskets: generalizing association rules to correlations. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 265-276.
3. Cohen E., Datar M., Fujiwara S., Gionis A., Indyk P., Motwani R., Ullman J.D., and Yang C. Finding interesting associations without support pruning. IEEE Transactions on Knowledge and Data Engineering 13 1 (2001) 64-78
4. Chuang, K., Chen, M., Yang, W., 2005. Progressive sampling for association rules based on sampling error estimation. In: PAKDD-2005, pp. 505-515.
5. Good I. Probability and the Weighting of Evidence (1950), Charles Griffin, London
6. Han, J., Wang, J., Lu, Y., Tzvetkov, P., 2002a. Mining top-k frequent closed patterns without minimum support. In: Proceedings of IEEE ICDM, Maebashi, Japan.
7. Han, J., Wang, J., Lu, Y., Tzvetkov, P., 2002b. Mining top-k frequent closed patterns without minimum support. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 211-218.
8. Han J., Pei J., Yin Y., and Mao R. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery 8 1 (2004) 53-87
9. Hipp J., and Guntzer U. Is pushing constraints deeply into the mining algorithms really what we want?. SIGKDD Explorations 4 1 (2002) 50-55
10. Jia C., and Gao X. Multi-scaling sampling: an adaptive sampling method for discovering approximate association rules. Journal of Computer Science and Technology (JCST) 20 3 (2005) 309-318
11. Li, Y., Gopalan, R., 2004. Effective sampling for mining association rules. Australian AI-2004, pp. 391-401.
12. Liu H., and Motoda H. Instance Selection and Construction for Data Mining (2001), Kluwer Academic Publishers
13. Mahafzah B., Al-Badarneh A., and Zakaria M. A new sampling technique for association rule mining. Journal of Information Science (JIS) 35 3 (2009) 358-376
14. Piatetsky-Shapiro G., and Steingold S. Measuring lift quality in database marketing. SIGKDD Explorations 2 2 (2000) 76-80
15. Roddick J.F., and Rice S. What's interesting about cricket? - on thresholds and anticipation in discovered rules. SIGKDD Explorations 3 1 (2001) 1-5
16. Silberschatz A., and Tuzhilin A. What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering 8 6 (1996) 970-974
17. Wang, K., He, Y., Cheung, D., Chin, F., 2001. Mining confident rules without support requirement. In: Proceedings of the 10th ACM International Conference on Information and Knowledge Management (CIKM 2001), Atlanta, 2001.
18. Wang K., He Y., and Han J. Pushing support constraints into association rules mining. IEEE Transactions on Knowledge and Data Engineering 15 3 (2003) 642-658
19. Wu X., Zhang C., and Zhang S. Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems 22 3 (2004) 381-405
20. Xu, Y., Yu, Y., Liu, G., Lu, H., 2002. From path tree to frequent patterns: a framework for Mining Frequent Patterns. In: Proceedings of 2002 IEEE International Conference on Data Mining (ICDM'02), Maebashi City, Japan, pp. 514-521.
21. Yan X., Zhang C., and Zhang S. Armga: identifying interesting association rules with genetic algorithms. Applied Artificial Intelligence 19 7 (2005) 677-689
22. Zaki, M., Ogihara, M., 1998. Theoretical foundations of association rules. In: Proceedings of the 3rd ACM SIGMOD'98 Workshop on Research Issues in Data Mining and Knowledge Discovery, Seattle, pp. 85-93.
23. Zhang S., Wu X., Zhang C., and Lu J. Computing the minimum-support for mining frequent patterns. Knowledge and Information Systems 15 (2008) 233-257
24. Zhang, S., Yu, J., Lu, J., Zhang, C., 2006. Is frequency enough for decision makers to make decisions? PAKDD-2006, pp. 499-503.
25. Zhang C., and Zhang S. Association Rules Mining: Models and Algorithms. Lecture Notes on Computer Science vol. 2307 (2002), Springer-Verlag Publishers p. 243
26. Zhang C., Zhang S., and Webb G. Identifying approximate itemsets of interest in large databases. Applied Intelligence 18 (2003) 91-104