New probabilistic interest measures for association rules

Intelligent Data Analysis

Volumn 11, Issue 5, 2007, Pages 437-455

  Hahsler, Michael ^a   Hornik, Kurt ^a  

^a VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

Author keywords

Association rules; Data mining; Measures of interestingness; Probabilistic data modeling

Indexed keywords

EID: 41549140071     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2007-11502     Document Type: Article

References (28)

1. J.-M. Adamo, Data Mining for Association Rules and Sequential Patterns, Springer, New York, 2001.
2. C.C. Aggarwal and P.S. Yu, A New Framework for Itemset Generation, in: PODS 98, Symposium on Principles of Database Systems, Seattle, WA, USA, 1998, 18-24.
3. R. Agrawal, T. Imielinski and A. Swami, Mining Association Rules between Sets of Items in Large Databases, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington D.C., 1993, 207-216.
4. R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, in: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, J.B. Bocea, M. Jarke and C. Zaniolo, eds, Santiago, Chile, 1994, pp. 487-499.
5. R.J. Bayardo Jr. and R. Agrawal, Mining the Most Interesting Rules, in: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD-99), ACM Press, 1999, 145-154.
6. R. Betancourt and D. Gautschi, Demand complementarities, household production and retail assortments, Marketing Science 9 (1990), 146-161.
7. H.H. Bock, Probabilistic models in cluster analysis, Computational Statistics and Data Analysis 23 (1996), 5-29.
8. F. Bodon, A fast apriori implementation, in: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMF03), B. Goethals and M.J. Zaki, eds., Melbourne, Florida, USA, 2003, volume 90 of CEUR Workshop Proceedings.
9. S. Brin, R. Motwani, J.D. Ullman and S. Tsur, Dynamic Itemset Counting and Implication Rules for Market Basket Data, in: SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, USA, 1997, 255-264.
10. I.V. Cadez, P. Smyth and H. Mannila, Probabilistic modeling of transaction data with applications to profiling, visualization, and prediction, in: Proceedings of the ACM SIGKDD Intentional Conference on Knowledge Discovery in Databases and Data Mining (KDD-01), F. Provost and R. Srikant, eds, ACM Press, 2001, pp. 37-15.
11. W. DuMouchel and D. Pregibon, Empirical Bayes screening for multiitem associations, in: Proceedings of the ACM SIGKDD Intentional Conference on Knowledge Discovery in Databases and Data Mining (KDD-01), F. Provost and R. Srikant, eds, ACM Press, 2001, pp. 67-76.
12. R.A. Fisher, The Design of Experiments, Oliver and Boyd, Edinburgh, 1935.
13. J. Fürnkranz and P.A. Flach, Roc 'n' rule learning - towards a better understanding of covering algorithms, Machine Learning 58 (2005), 39-77.
14. B. Goethals and M.J. Zaki, Advances in frequent itemset mining implementations: Report on FIMI'03, SIGKDD Explorations 6 (2004), 109-117.
15. M. Hahsler, A model-based frequency constraint for mining associations from transaction data, Data Mining and Knowledge Discovery 13 (2006), 137-166.
16. M. Hahsler, B. Grün and K. Hornik, arules: Mining Association Rules and Frequent Itemsets, 2006, URL http://cran.r-project.org/, R package version 0.4-3.
17. M. Hahsler, K. Hornik and T. Reutterer, Implications of probabilistic data modeling for mining association rules, in: From Data and Information Analysis to Knowledge Engineering, Proceedings of the 29th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Magdeburg, M. Spiliopoulou, R. Kruse, C. Borgelt, A. Nürnberger and W. Gaul, eds, Springer-Verlag, 2006, Studies in Classification, Data Analysis, and Knowledge Organization, March 9-11, 2005, pp. 598-605.
18. J. Hipp, U. Güntzer and G. Nakhaeizadeh, Algorithms for association rule mining - A general survey and comparison, SIGKDD Explorations 2 (2000), 1-58.
19. J. Hollmén, J.K. Seppänen and H. Mannila, Mixture models and frequent sets: Combining global and local methods for 0-1 data., in: SIAM International Conference on Data Mining (SDMf103), San Fransisco, 2003.
20. H. Hruschka, M. Lukanowicz and C. Buchta, Cross-category sales promotion effects, Journal of Retailing and Consumer Services 6 (1999), 99-105.
21. N.L. Johnson, S. Kotz and A.W. Kemp, Univariate Discrete Distributions, (2nd edition), John Wiley & Sons, New York, 1993.
22. E.L. Lehmann, Testing Statistical Hypotheses, Wiley, New York, first edition, 1959.
23. B. Liu, W. Hsu and Y. Ma, Mining Association Rules with Multiple Minimum Supports, in: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD-99), ACM Press, 1999, 337-341.
24. D. Pavlov, H. Mannila and P. Smyth, Beyond independence: Probabilistic models for query approximation on binary transaction data, IEEE Transactions on Knowledge and Data Engineering 15 (2003), 1409-1421.
25. F. Provost and T. Fawcett, Robust classification for imprecise environments, Machine Learning 42 (2001), 203-231.
26. J.P. Shaffer, Multiple hypothesis testing, Annual Review of Psychology 46 (1995), 561-584.
27. C. Silverstein, S. Brin and R. Motwani, Beyond market baskets: Generalizing association rules to dependence rules, Data Mining and Knowledge Discovery 2 (1998), 39-68.
28. H. Xiong, P.-N. Tan and V. Kumar, Mining strong affinity association patterns in data sets with skewed support distribution, in: Proceedings of the IEEE International Conference on Data Mining, B. Goethals and M.J. Zaki, eds, November 19-22, 2003, Melbourne, Florida, pp. 387-394.