Mining association rules in very large clustered domains

Information Systems

Volumn 32, Issue 5, 2007, Pages 649-669

  Nanopoulos, Alexandros ^a   Papadopoulos, Apostolos N ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Association rules; Clustering; Data mining; Item domain grouping

Indexed keywords

BIBLIOGRAPHIC RETRIEVAL SYSTEMS; CLUSTERING ALGORITHMS; CORRELATION METHODS; DATA MINING; PROBLEM SOLVING;

ASSOCIATION RULE MINING; BIBLIOGRAPHIC ANALYSIS; ITEM DOMAIN GROUPING; MINING ALGORITHMS;

ASSOCIATION RULES;

EID: 34147147065     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2006.04.002     Document Type: Article

References (29)

1. Aggrawal R., Imielinski T., and Swami A. Mining association rules between sets of items in very large databases. Proceedings of the ACM SIGMOD Conference (1993) 207-216
2. Hipp J., Guntzer U., and Nakhaeizadeh G. Algorithms for association rules mining-a general survey and comparison. SIGKDD Explor. 2 1 (2000) 58-64
3. Bradley P., Gehrke J., Ramakrishnan R., and Srikant R. Scaling mining algorithms to large databases. Commun. ACM 45 8 (2002) 38-43
4. Watts D., and Strogatz S. Collective dynamics of small-world networks. Nature 363 (1998) 202-204
5. Pan F., Cong G., and Tung A.K.H. Carpenter: finding closed patterns in long biological datasets. Proceedings of the SIGKDD Conference (2003)
6. Pan F., Tung A.K.H., Cong G., and Xu X. Cobbler: combining column and row enumeration for closed pattern discovery. Proceedings of the SSDBM Symposium (2004) 21-30
7. R. Agrawal, R. Srikant, Fast algorithms mining association rules in large databases, Technical Report RJ 9839, IBM Almaden Research Center, San Jose, CA, 1994.
8. Han J., Pei J., Yin Y., and Mao R. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discovery 8 (2004) 53-87
9. Zaki M.J. Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12 3 (2000) 372-390
10. Savasere A., Omiecinski E., and Navathe S. An efficient algorithm for mining association rules in large databases. Proceedings of the VLDB Conference (1995) 432-444
11. B. Goethals, M. Zaki, Advances in frequent itemset mining implementations: introduction to FIMI03, in: Proceedings of the FIMI Workshop, 2003.
12. Agrawal R., Mannila H., Srikant R., Toivonen H., and Verkamo A.I. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining (1996) 307-328
13. Park J.S., Chen M.-S., and Yu P. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowl. Data Eng. 9 5 (1997) 813-825
14. Srikant R., and Aggrawal R. Mining generalized association rules. Proceedings of the VLDB Conference (1995) 407-419
15. Agarwal R., Aggarwal C., and Prasad V.V. A tree projection algorithm for generation of frequent itemsets. J. Parallel Distrib. Comput. 61 (2001) 350-371
16. Burdick D., Calimlim M., and Gehrke J. Mafia: a maximal frequent itemset algorithm for transactional databases. Proceedings of the ICDE Conference (2001) 443-452
17. Goethals B. Memory issues in frequent itemset mining. Proceedings of the SAC Symposium (2004) 530-534
18. Nanopoulos A., and Manolopoulos Y. Memory-adaptive association rules mining. Inf. Syst. 29 5 (2004) 365-384
19. Zaki M., and Hsiao C. Charm: an efficient algorithm for closed association rule mining. Proceedings of the SDM Conference (2002)
20. Wang J., Han J., and Pei J. Closet+: searching for the best strategies for mining frequent closed itemsets. Proceedings of the KDD Conference (2003) 236-245
21. Agrawal R., Sarawagi S., and Thomas S. Integrating association rule mining with databases: alternatives and implications. Proceedings of the SIGMOD Conference (1998) 343-354
22. Cong G., Tung A.K.H., Xu X., Pan F., and Yang J. Farmer: finding interesting rule groups in microarray datasets. Proceedings of the SIGMOD Conference (2004) 143-154
23. Jiang X.-R., and Gruenwald L. Microarray gene expression data association rules mining based on BSC-tree and FIS-tree. Data Knowl. Eng. 53 1 (2005) 3-29
24. Aggarwal C., Procopiuc C., and Yu P. Finding localized associations in market basket data. IEEE Trans. Knowl. Data Eng. 14 1 (2002) 51-62
25. Tsay Y.-J., and Chang-Chien Y.-W. An efficient cluster and decomposition algorithm for mining association rules. Inf. Sci. 160 (2004) 161-171
26. Lee G., Lee K.L., and Chen A.L. Efficient graph-based algorithms for discovering and maintaining association rules in large databases. Knowl. Inf. Syst. 3 3 (2001) 338-355
27. Yen S.-J., and Chen A.L. A graph-based approach for discovering various types of association rules. IEEE Trans. Knowl. Data Eng. 13 5 (2001) 839-845
28. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), The MIT Press, Cambridge, MA
29. Salzberg B. Merging sorted runs using large main memory. Acta Inf. 27 3 (1989) 195-215