Probably the best itemsets

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 293-302

  Tatti, Nikolaj ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Bayesian model selection; Decomposable models; Exponential models; Itemset mining; Junction trees; MCMC

Indexed keywords

BAYESIAN MODEL SELECTION; DECOMPOSABLE MODELS; EXPONENTIAL MODELS; ITEMSET MINING; JUNCTION TREES; MCMC;

PROBABILITY DENSITY FUNCTION;

BAYESIAN NETWORKS;

EID: 77956210298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835843     Document Type: Conference Paper

References (20)

1. C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (PODS 1998), pages 18-24. ACM Press, 1998.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI/MIT Press, 1996.
3. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, pages 265-276. ACM Press, May 1997.
4. C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Inf. Theory, 14(3):462-467, 1968.
5. R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter. Probabilistic Networks and Expert Systems. Statistics for Engineering and Information Science. Springer-Verlag, 1999.
6. M. Fortelius, A. Gionis, J. Jernvall, and H. Mannila. Spectral ordering and biochronology of european fossil mammals. Paleobiology, 32(2):206-214, March 2006.
7. S. Hanhijärvi, M. Ojala, N. Vuokko, K. Puolamäki, N. Tatti, and H. Mannila. Tell me something I don't know: randomization strategies for iterative data mining. In Knowledge Discovery and Data Mining (KDD 2009), pages 379-388, 2009.
8. H. Heikinheimo, J. K. Seppänen, E. Hinkkanen, H. Mannila, and T. Mielikäinen. Finding low-entropy sets and trees from binary data. In Knowledge discovery and data mining (KDD 2007), pages 350-359, 2007.
9. H. Heikinheimo, J. Vreeken, A. Siebes, and H. Mannila. Low-entropy set selection. In Proceedings of the SIAM International Conference on Data Mining (SDM 2009), pages 569-580, 2009.
10. S. Jaroszewicz and D. A. Simovici. Interestingness of frequent itemsets using bayesian networks as background knowledge. In Knowledge discovery and data mining (KDD 2004), pages 178-186, 2004.
11. R. Meo. Theory of dependence values. ACM Trans. Database Syst., 25(3):380-406, 2000.
12. S. Myllykangas, J. Himberg, T. Böhling, B. Nagy, J. Hollmén, and S. Knuutila. Dna copy number amplification profiling of human neoplasms. Oncogene, 25(55):7324-7332, Nov. 2006.
13. D. Pavlov, H. Mannila, and P. Smyth. Beyond independence: Probabilistic models for query approximation on binary transaction data. IEEE TKDE, 15(6):1409-1421, 2003.
14. G. Schwarz. Estimating the dimension of a model. Annals of Statistics, 6(2):461-464, 1978.
15. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In Proceedings of the SIAM International Conference on Data Mining (SDM 2006), 2006.
16. N. Tatti. Computational complexity of queries based on itemsets. IPL, pages 183-187, June 2006.
17. N. Tatti. Maximum entropy based significance of itemsets. KAIS, 17(1):57-77, 2008.
18. N. Tatti. Probably the best itemsets. Technical Report 2010/06, University of Antwerp, 2010. http://adrem.ua.ac.be/publications.
19. N. Tatti and H. Heikinheimo. Decomposable families of itemsets. In Knowledge Discovery in Databases: PKDD 2008, pages 472-487, 2008.
20. N. Tatti and J. Vreeken. Finding good itemsets by packing data. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), pages 588-597, 2008.