Selecting the Right Correlation Measure for Binary Data

Abstract

Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Although there are numerous measures available for evaluating correlations, different correlation measures provide drastically different results. Piatetsky-Shapiro provided three mandatory properties for any reasonable correlation measure, and Tan et al. proposed several properties to categorize correlation measures; however, it is still hard for users to choose the desirable correlation measures according to their needs. In order to solve this problem, we explore the effectiveness problem in three ways. First, we propose two desirable properties and two optional properties for correlation measure selection and study the property satisfaction for different correlation measures. Second, we study different techniques to adjust correlation measures and propose two new correlation measures: the Simplified χ² with Continuity Correction and the Simplified χ² with Support. Third, we analyze the upper and lower bounds of different measures and categorize them by the bound differences. Combining these three directions, we provide guidelines for users to choose the proper measure according to their needs.

References

1. R. Agrawal, T. Imieliński, and A. Swami. 1993. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’93). ACM, New York, NY, 207--216. DOI: http://dx.doi.org/10.1145/170035.170072
2. A. Bate, M. Lindquist, I. R. Edwards, S. Olsson, R. Orre, A. Lansner, and R. M. De Freitas. 1998. A Bayesian neural network method for adverse drug reaction signal generation. European Journal of Clinical Pharmacology 54, 4 (1998), 315--321.
3. S. Brin, R. Motwani, and C. Silverstein. 1997a. Beyond market baskets: Generalizing association rules to correlations. In Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD’97). ACM, New York, NY, 265--276. DOI: http://dx.doi.org/10.1145/253260.253327
4. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. 1997b. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’97). ACM, New York, NY, 255--264. DOI: http://dx.doi.org/10.1145/253260. 253325
5. A. Clauset, M. E. J. Newman, and C. Moore. 2004. Finding community structure in very large networks. Physical Review E 70, 6 (Dec. 2004), 066111+. DOI: http://dx.doi.org/10.1103/PhysRevE.70.066111
6. L. Duan and W. Nick Street. 2009. Finding maximal fully-correlated itemsets in large databases. In Proceedings of the International Conference on Data Mining (ICDM’09). 770--775.
7. L. Duan, W. Nick Street, and Y. Liu. 2013. Speeding up correlation search for binary data. Pattern Recognition Letters 34, 13 (2013), 1499--1507. DOI: http://dx.doi.org/10.1016/j.patrec.2013.05.027
8. L. Duan, W. Nick Street, Y. Liu, and H. Lu. 2014. Community detection in graphs through correlation. In Proceedings of the 20th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (ACM SIGKDD’14).
9. W. Dumouchel. 1999. Bayesian data mining in large frequency tables, with an application to the FDA spontaneous reporting system. American Statistician 53, 3 (1999), 177--202.
10. T. Dunning. 1993. Accurate methods for the statistics of surprise and coincidence. Computational Linguistics 19, 1 (1993), 61--74.
11. H. Everett. 1957. ‘Relative State’ formulation of quantum mechanics. Reviews of Modern Physics 29 (1957), 454--462.
12. L. Geng and H. J. Hamilton. 2006. Interestingness measures for data mining: A survey. Computing Surveys 38, 3 (2006), 9. DOI: http://dx.doi.org/10.1145/1132960.1132963
13. C. Jermaine. 2005. Finding the most interesting correlations in a database: How hard can it be? Information Systems 30, 1 (2005), 21--46. DOI: http://dx.doi.org/10.1016/j.is.2003.08.004
14. R. H. Johnson and D. W. Wichern. 2001. Applied Multivariate Statistical Analysis. Prentice Hall.
15. M. Liu, E. R. M. Hinz, M. E. Matheny, J. C. Denny, J. S. Schildcrout, R. A. Miller, and H. Xu. 2013. Comparative analysis of pharmacovigilance methods in the detection of adverse drug reactions using electronic medical records. Journal of the American Medical Informatics Association 20, 3 (2013), 420--426. DOI: http://dx.doi.org/10.1136/amiajnl-2012-001119
16. F. Mosteller. 1968. Association and estimation in contingency tables. Journal of the American Statistical Association 63, 321 (1968), 1--28.
17. P.-N. Tan and V. Kumar. 2000. Interestingness measures for association patterns: A perspective. In Proceedings of the KDD 2000 Workshop on Postprocessing in Machine Learning and Data Mining.
18. G. N. Norén, A. Bate, J. Hopstadius, K. Star, and I. R. Edwards. 2008. Temporal pattern discovery for trends and transient effects: Its application to patient records. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’08). ACM, New York, NY, 963--971. DOI: http://dx.doi.org/10.1145/1401890.1402005
19. E. R. Omiecinski. 2003. Alternative interest measures for mining associations in databases. IEEE Transactions on Knowledge and Data Engineering 15, 1 (2003), 57--69. DOI: http://dx.doi.org/10.1109/TKDE.2003.1161582
20. OMOP. 2010. Methods section for the disproportionality paper. (September 2010). http://omop.fnih.org/MethodsLibrary.
21. G. Piatetsky-Shapiro. 1991. Discovery, Analysis, and Presentation of Strong Rules. AAAI/MIT Press, 229--248.
22. H. T. Reynold. 1977. The Analysis of Cross-Classifications. Free Press.
23. C. L. Sistrom and C. W. Garvan. 2004. Proportions, odds, and risk. Radiology 230, 1 (2004), 12--19.
24. P.-N. Tan, V. Kumar, and J. Srivastava. 2004. Selecting the right objective measure for association analysis. Information Systems 29, 4 (2004), 293--313. DOI: http://dx.doi.org/10.1016/S0306-4379(03)00072-3
25. P.-N. Tan, M. Steinbach, and V. Kumar. 2005. Introduction to Data Mining. Addison Wesley.
26. C. Tew, C. Giraud-Carrier, K. Tanner, and S. Burton. 2013. Behavior-based clustering and analysis of interestingness measures for association rule mining. Data Mining and Knowledge Discovery (2013), 1--42. DOI: http://dx.doi.org/10.1007/s10618-013-0326-x
27. H. Xiong, M. Brodie, and S. Ma. 2006a. TOP-COP: Mining top-K strongly correlated pairs in large databases. In Proceedings of the International Conference on Data Mining (ICDM’06). Washington, DC, 1162--1166. DOI: http://dx.doi.org/10.1109/ICDM.2006.161
28. H. Xiong, S. Shekhar, P.-N. Tan, and V. Kumar. 2006b. TAPER: A two-step approach for all-strong-pairs correlation query in large databases. IEEE Transactions on Knowledge and Data Engineering 18, 4 (2006), 493--508. DOI: http://dx.doi.org/10.1109/TKDE.2006.68
29. J. Zhang and J. Feigenbaum. 2006. Finding highly correlated pairs efficiently with powerful pruning. In Proceedings of the ACM CIKM International Conference on Information and Knowledge Management (CIKM’06). ACM, New York, NY, 152--161. DOI: http://dx.doi.org/10.1145/1183614.1183640
30. N. Zhong, C. Liu, and S. Ohsuga. 2001. Dynamically organizing KDD processes. International Journal of Pattern Recognition and Artificial Intelligence 15, 3 (2001), 451--473.
31. N. Zhong, Y. Y. Yao, and S. Ohsuga. 1999. Peculiarity oriented multi-database mining. In Proceedings of the 3rd European Conference on Principles of Data Mining and Knowledge Discovery (PKDD’99). Springer-Verlag, London, UK, 136--146.

Index Terms

• Information systems

  • Information systems applications

    • Data mining