Efficient discovery of the top-K optimal dependency rules with Fisher's exact test of significance

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 196-205

  Hamalainen, Wilhelmiina ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Dependency rule; Fisher's exact test; Negative rule; Rule discovery; Statistical significance

Indexed keywords

DEPENDENCY RULES; FISHER'S EXACT TEST; NEGATIVE RULE; RULE DISCOVERY; STATISTICAL SIGNIFICANCE;

CLUSTERING ALGORITHMS; DATA MINING; LEARNING ALGORITHMS; OPTIMIZATION;

TESTING;

EID: 79951750140     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.143     Document Type: Conference Paper

References (17)

1. S. Morishita and J. Sese, "Transversing itemset lattices with statistical metric pruning," in Proc. 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM, 2000, pp. 226-236.
2. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proc. 20th Int. Conf. Very Large Data Bases. Morgan Kaufmann, 1994, pp. 487-499.
3. G. I. Webb, "Discovering significant patterns," Machine Learning, vol. 68, no. 1, pp. 1-33, 2007. (Pubitemid 46828725)
4. G. Webb, "Layered critical values: a powerful direct-adjustment approach to discovering significant patterns," Machine Learning, vol. 71, no. 2-3, pp. 307-323, 2008.
5. C. Aggarwal and P. Yu, "A new framework for itemset generation," in Proc. 17th ACM SIGACT-SIGMOD-SIGART Symposium Principles of Database Systems. ACM, 1998, pp. 18-24.
6. G. Webb and S. Zhang, "K-optimal rule discovery," Data Mining and Knowledge Discovery, vol. 10, no. 1, pp. 39-79, 2005. (Pubitemid 40357001)
7. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases," in Proc. 1993 ACM SIGMOD Int. Conf. Management of Data. ACM, 26-28 1993, pp. 207-216.
8. S. Nijssen and J. Kok, "Multi-class correlated pattern mining," in Proc. 4th Int. Workshop Knowledge Discovery in Inductive Databases, ser. LNCS, vol. 3933. Springer, 2006, pp. 165-187. (Pubitemid 44019669)
9. S. Nijssen, T. Guns, and L. D. Raed, "Correlated itemset mining in ROC space: a constraint programming approach," in Proc. 15th ACM SIGKDD conf. Knowledge Discovery and Data Mining (KDD'09). ACM, 2009, pp. 647-656.
10. B. Liu, W. Hsu, and Y. Ma, "Pruning and summarizing the discovered associations," in Proc. 5th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining. ACM, 1999, pp. 125-134.
11. J. Li, "On optimal rule discovery," IEEE Trans. Knowledge and Data Engineering, vol. 18, no. 4, pp. 460-471, 2006. (Pubitemid 43327096)
12. H. Xiong, S. Shekhar, P.-N. Tan, and V. Kumar, "Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs," in Proc. 10th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining. ACM, 2004, pp. 334-343. (Pubitemid 40114943)
13. W. Hämäläinen and M. Nykänen, "Efficient discovery of statistically significant association rules," in Proc. 8th IEEE Int. Conf. Data Mining. IEEE, 2008, pp. 203-212.
14. M.-L. Antonie and O. R. Zaïane, "Mining positive and negative association rules: an approach for confined rules," in Proc. 8th European Conf. Principles and Practice of Knowledge Discovery in Databases. Springer, 2004, pp. 27-38. (Pubitemid 39740389)
15. D. Thiruvady and G. Webb, "Mining negative rules using GRD," in Advances in Knowledge Discovery and Data Mining, Proc. 8th Pacific-Asia Conf., ser. LNCS, vol. 3056. Springer, 2004, pp. 161-165. (Pubitemid 38824895)
16. X. Wu, C. Zhang, and S. Zhang, "Efficient mining of both positive and negative association rules," ACM Trans. Information Systems, vol. 22, no. 3, pp. 381-405, 2004.
17. Y. Koh and R. Pears, "Efficiently finding negative association rules without support threshold," in Advances in Artificial Intelligence, Proc. 20th Australian Joint Conf. Artificial Intelligence, ser. LNCS, vol. 4830. Springer, 2007, pp. 710-714.