Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 334-343

  Xiong, Hui ^a   Shekhar, Shashi ^a   Tan, Pang Ning ^b   Kumar, Vipin ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

Pearson's Correlation Coefficient; Statistical Computing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CORRELATION THEORY; DATA MINING; DATA REDUCTION; MATHEMATICAL MODELS; STATISTICAL METHODS;

CORRELATION QUERY; PEARSON'S CORRELATION COEFFICIENT; PRUNING; STATISTICAL COMPUTING;

DATABASE SYSTEMS;

EID: 12244275963     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014090     Document Type: Conference Paper

References (18)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD, 1993.
2. R. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery Journal, pages 217-240, 2000.
3. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In ACM SIGMOD, 1997.
4. C. Bucila, J. Gehrke, D. Kifer, and W. M. White. Dualminer: a dual-pruning algorithm for itemsets with constraints. In ACM SIGKDD, 2002.
5. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE, 2001.
6. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding interesting associations without support pruning. In ICDE, 2000.
7. W. DuMouchel and D. Pregibon. Empirical bayes screening for multi-item associations. In ACM SIGKDD, 2001.
8. G. Grahne, L. V. Lakshmanan, and X. Wang. Efficient mining of constrained correlated sets. In ICDE, 2000.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In A CM SIGMOD, 2000.
10. C. Jermaine. The computational complexity of high-dimensional correlation search. In ICDM, 2001.
11. C. Jermaine. Playing hide-and-seek with correlations. In ACM SIGKDD, 2003.
12. S. K. Kachigan. Multivariate Statistical Analysis: A Conceptual Introduction. Radius Press, 1991.
13. R. Ng, L. Lakshmanan, J. Han, and A. Pang. Exploratory mining via constrained frequent set queries. In ACM SIGMOD, 1999.
14. R. Rastogi and K. Shim. Mining optimized association rules with categorical and numeric attributes. IEEE TKDE, 14(1), January 2002.
15. H. T. Reynolds. The Analysis of Cross-classifications. The Free Press, New York, 1977.
16. R. Rymon. Search through systematic set enumeration. In Int'l. Conf. on Principles of Knowledge Representation and Reasoning, 1992.
17. H. Xiong, S. Shekhar, P. Tan, and V. Kumar. Taper: An efficient two-step approach for all-pairs correlation query in transaction databases. In Technical Report 02-020, computer science and engineering, University of Minnesota - Twin Cities, May 2003.
18. G. Zipf. Human Behavior and Principle of Least Effort: An Introduction to Human Ecology. Addison Wesley, Cambridge, Massachusetts, 1949.