Top-k φ correlation computation

INFORMS Journal on Computing

Volumn 20, Issue 4, 2008, Pages 539-552

  Xiong, Hui ^a   Zhou, Wenjun ^a   Brodie, Mark ^b   Ma, Sheng ^c  

^a RUTGERS UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c DoubleClick Inc   (United States)

Author keywords

Pearson's correlation coefficient; Statistical computing; correlation Coefficient

Indexed keywords

EID: 61349150053     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0265     Document Type: Article

References (27)

1. Agrawal, R., T. Imielinski, A. N. Swami. 1993, Mining association rules between sets of items in large databases. Proc. ACM SIG-MOD Intermit. Conf. Management Data, ACM Press, New York, 207-216.
2. Agrcsti, A. 2002. Categorical Data Analysis. Wiley Series in Probability and Statistics, Wiley Interscience, Hoboken, NJ.
3. Alexander, C. 2001. Market Models: A Guide to Financial Data Analysis. John Wiley & Sons, New York.
4. Bayardo, R. J., R. Agrawal, D. Gunopulos. 2000. Constraint-based rule mining in large, dense databases. Data Mining Knowledge Discovery 4 217-240.
5. Brin, S., R. Motwani, C. Silvcrstein. 1997. Beyond market baskets: Generalizing association rules to correlations. Proc. ACM SIGMOD Internal. Conf. Management of Data, ACM Press, New York, 265-276.
6. Bucila, C, J. Gehrke, D. Kifer, W. M. White. 2003. Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Mining Knowledge Discovery 7 241-272.
7. Burdick, D., M. Calimlim, J. Gehrke. 2001. Mafia: A maximal frequent itemset algorithm for transactional databases. Proc. Internat. Conf. Data Engrg., IEEE Computer Society, Washington, D.C., 443-452.
8. Cohen, P., J. Cohen, S. G. West, L. S. Aiken. 2002. Applied Multiple Regression/Correlation Analysis for the Behavioral Science, 3rd ed. Lawrence Erlbaum, Mahwah, NJ.
9. Cohen, E., M. Datar, S, Fujiwara, A, Gionis, P. Indyk, R. Motwani, J. D, Ullman, C. Yang. 2000. Finding interesting associations without support pruning. Proc. Intermit. Conf. Data Engrg., IEEE Computer Society, Washington, D.C., 489-499.
10. DeGroot, M., M. Schervish. 2001. Probability and Statistics, 3rd ed. Addison-Wesley, Upper Saddle River, NJ.
11. DuMouchel, W, D. Pregibon. 2001. Empirical bayes screening for multi-item associations. Proc. ACM SIGKDD Internal. Conf. Knowledge Discovery Data Mining, ACM Press, New York, 67-76.
12. Grahne, G., L. V. S. Lakshmanan, X. Wang. 2000. Efficient mining of constrained correlated sets. Proc. Internal. Conf. Data Engrg., IEEE Computer Society, Washington D.C., 512-521.
13. IIyas, I. F, V. Markl, P. J. Haas, P. Brown, A. Aboulnaga. 2004. Cords: Automatic discovery of correlations and soft functional dependencies. Proc. ACM SIGMOD Internat. Conf. Management Data, ACM Press, New York, 647-658.
14. Jermaine, C. 2001. The computational complexity of high-dimensional correlation search. Proc. IEEE Internat. Conf. Data Mining, IEEE Computer Society, Washington, D.C., 249-256.
15. Jermaine, C. 2003. Playing hide-and-seek with correlations. Proc. ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining, ACM Press, New York, 559-564.
16. Kendall, M., J. D. Gibbons. 1990. Rank Correlation Methods, 5th ed. Oxford University Press, New York.
17. Kuo, W. P., T.-K. Jenssen, A. J. Butte, L. Ohno-Machado, I. S. Kohane. 2002. Analysis of matched mRNA measurements from two different microarray technologies. Bioinformatics 18 405-412.
18. Lehmann, E. L., H. J. M. D'Abrera. 1998. Nonparametrics: Statistical Methods Based on Ranks. Prentice Hall, Upper Saddle River, NJ.
19. Liu, B., W. Hsu, Y. Ma, 1999, Mining association rules with multiple minimum supports. Proc. ACM SIGKDD Internat. Conf. Knowl- edge Discovery Data Mining, ACM Press, New York, 337-341.
20. Ng, R., L. V. S. Lakshmanan, J. Han, A. Pang. 1999. Exploratory mining via constrained frequent set queries. Proc. ACM SIGMOD Internat. Conf. Management of Data, ACM Press, New York, 556-558.
21. Rastogi, R., K. Shim. 2002. Mining optimized association rules with categorical and numeric attributes. IEEE Trans. Knowledge Data Engrg. 14 29-50.
22. Reynolds, H. T. 1977. The Analysis of Cross-Classifications. The Free Press, New York.
23. Storch, H. V., F. W. Zwiers. 2002. Statistical Analysis in Climate Research, Reprint ed. Cambridge University Press, Cambridge, UK.
24. Tan, P.-N., M. Steinbach, V. Kumar. 2005. Introduction to Data Mining. Addison-Wesley, Upper Saddle River, NJ.
25. Wang, K., Y. He, D. W.-L. Cheung, F. Y. L. Chin. 2001. Mining confident rules without support requirement. Proc. Internat. Conf. Inform. Knowledge Management, ACM Press, New York, 89-96.
26. Xiong, H, S. Shekhar, P. Tan, V. Kumar. 2004. Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs. Proc. ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining, ACM Press, New York, 334-343.
27. Xiong, H., X. He, C. H. Q. Ding, Y. Zhang, V. Kumar, S. R. Holbrook. 2005. Identification of functional modules in protein complexes via hyperclique pattern discovery. R. B. Altman, A. K. Dunkcr, L. Hunter, eds. Proc. Pacific Sympos. Biocomputing 2005, World Scientific Publishing Co. Pte. Ltd., Singapore, 221-232.