An efficient algorithm for finding dense regions for mining quantitative association rules

Computers and Mathematics with Applications

Volumn 50, Issue 3-4, 2005, Pages 471-490

  Lian, Wang ^a   Cheung, David W ^b   Yiu, S M ^b  

^a MACAU UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Macao)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithms; Data mining; Dense regions; Density measure; Quantitative association rules

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DATABASE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

DENSE REGIONS; DENSITY MEASURES; DRMINER; QUANTITATIVE ASSOCIATION RULES;

DATA MINING;

EID: 27344442458     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2005.03.009     Document Type: Article

References (23)

1. th International Conference on Very Large Databases Santiago, Chile, September 1994 487 499
2. J.S. Park, M.-S. Chen, and P.S. Yu An effective hash-based algorithm for mining association rules Proceedings of the ACM SIGMOD International Conference on Management of Data San Jose, CA, May 1995 175 186
3. st International Conference on Very Large Databases Zurich, Switzerland, September 1995 432 444
4. th International Conference on Very Large Databases Vancouver, Canada, August 1992 560 573
5. Special Issue in Data Mining D.W. Cheung, V.T. Ng, A.W. Fu, and Y.J. Fu Efficient mining of association rules in distributed databases 022 IEEE Transactions on Knowledge and Data Engineering 8 6 1996 911
6. nd Pacific-Asia Conference on Knowledge Discovery and Data Mining Melbourne, Australia, April 1998 291 314
7. st International Conference on Very Large Databases Zurich, Switzerland, September 1995 420 431
8. nd International Conference on Very Large Databases Mumbai, India, September 1996 134 145
9. S. Sarawagi Indexing OLAP data Bulletin of the Technical Committee on Data Engineering, IEEE Computer Society 20 1 1997 432 444
10. nd International Conference on Knowledge Discovery and Data Mining Menlo Park, CA, August 1996 226 231
11. M. Ankerst, M. Breunig, H. Kriegel, and J. Sander OPTICS: Ordering points to identify the clustering structure Proceedings of the ACM SIGMOD Conference on Management of Data 1999 49 60
12. rd Pacific-Asia Conference on Knowledge Discovery and Data Mining Seoul, Korea, May 2003 563 575
13. rd International Conference on Very Large Databases Athens, Greece, August 1997 186 195
14. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan Automatic subspace clustering of high dimensional data for data mining applications Proceedings of the ACM SIGMOD Conference on Management of Data Seattle, WA 1998 94 105
15. th International Conference on Very Large Databases 1994 144 155
16. th International Conference on Computer Applications in Industry and Engineering (CAINE'02) San Diego, CA, November 2002 138 141
17. nd International Conference on Very Large Databases Bombay, India, September 1996 544 555
18. R. Srikant, and R. Agrawal Mining quantitative association rules in large relational tables Proceedings of the ACM SIGMOD Conference on Management of Data Montreal, Canada, June 1996 1 12
19. B. Lent, A. Swami, and J. Widom Clustering association rules Proceedings of International Conference on Data Engineering Birmingham, U.K., April 1997 220 231
20. Y. Aumann, and Y. Lindell A statistical theory for quantitative association rules Journal of Intelligent Information Systems 20 3 2003 255 283
21. th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2001 383 388
22. T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama Data mining with optimized two-dimensional association rules ACM Transactions on Database Systems (TODS) 26 2001 179 213 2
23. D.W. Cheung, B. Zhou, B. Kao, H. Kan, and S.D. Lee Towards the building of a dense-region based OLAP system Data and Knowledge Engineering 36 2001 1 27