An information theoretic framework for data mining

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

Volumn , Issue , 2011, Pages 564-572

  De Bie, Tijl ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Data mining framework; Maxent; Subjective interestingness

Indexed keywords

DATA MINING; GAME THEORY; INFORMATION DISSEMINATION; INFORMATION THEORY; INFORMATION USE; MINERS;

DATA MINERS; DATA MINING FRAMEWORKS; DATA MINING PROCESS; INFORMATION EXCHANGES; INTERESTINGNESS; MAXENT; PROBABILITY: DISTRIBUTIONS; PROCESS PROPERTIES; SUBJECTIVE INTERESTINGNESS; UNCERTAINTY;

PROBABILITY DISTRIBUTIONS;

EID: 80052684689     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020497     Document Type: Conference Paper

References (30)

1. S.-I. Amari and H. Nagaoka. Methods of information geometry. The American Mathematical Society, Oxford University Press, 2000.
2. E. Bae and J. Bailey. Coala: A novel approach for the extraction of an alternate clustering of high quality and high dissimilarity. In Proceedings of the International Conference on Data Mining (ICDM), 2006.
3. I. Csisźar and P. C. Shields. Information theory and statistics: a tutorial. now Publishers Inc., Delft, The Netherlands, 2004.
4. T. De Bie. Explicit probabilistic models for databases and networks. Technical report, University of Bristol TR-123931, arXiv:0906.5148v1, 2009.
5. T. De Bie. Finding interesting itemsets using a probabilistic model for binary databases. Technical report, University of Bristol TR-123930, 2009.
6. T. De Bie. Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Mining and Knowledge Discovery, 2010.
7. T. De Bie. Subjectively interesting alternative clusters. Technical report, University of Bristol TR-133090, 2011.
8. T. De Bie, K.-N. Kontonasios, and E. Spyropoulou. A framework for mining interesting pattern sets. SIGKDD Explorations, 12(2), 2010.
9. S. Dzeroski. Towards a general framework for data mining. In Lecture Notes in Computer Science volume 4747, pages 259-300. springer, 2006.
10. C. Faloutsos and V. Megalooikonomou. On data mining, compression, and kolmogorov complexity. Data Mining and Knowledge Discovery, 15:3-20, 2007. (Pubitemid 47142808)
11. A. Gallo, T. De Bie, and N. Cristianini. MINI: Mining informative non-redundant itemsets. In Proceedings of Principles and Practice of Knowledge Discovery in Databases (PKDD), 2007.
12. A. Gallo, A. Mammone, T. De Bie, M. Turchi, and N. Cristianini. From frequent itemsets to informative patterns. Technical report, University of Bristol TR 123936, 2009.
13. A. Gionis, H. Mannila, T. Mielik̈ainen, and P. Tsaparas. Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data, 1(3):14, 2007.
14. S. Hanhijarvi, M. Ojala, N. Vuokko, K. Puolam̈aki, N. Tatti, and H. Mannila. Tell me something I don't know: Randomization strategies for iterative data mining. In Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD09), pages 379-388, 2009.
15. P. Harremöes and F. Topsøe. Maximum entropy fundamentals. Entropy, 2001.
16. H. Hotelling. Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24:417-441, 1933.
17. S. Jaroszewicz and D. A. Simovici. Interestingness of frequent itemsets using bayesian networks as background knowledge. In Proc. of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD04), pages 178-186, 2004. (Pubitemid 40114927)
18. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Information Processing Letters, 70, 1999.
19. J. Kleinberg, C. Papadimitriou, and P. Raghavan. A microeconomic view of data mining. Data Mining and Knowledge Discovery, 2(4), 1998.
20. K.-N. Kontonasios and T. De Bie. An information-theoretic approach to finding informative noisy tiles in binary databases. In Proceedings of the 2010 SIAM International Conference on Data Mining, 2010.
21. H. Mannila. Inductive databases and condensed representations for data mining. In Proceedings of the 1997 International Symposium on Logic Programming, pages 21-30, 1997.
22. H. Mannila. Theoretical frameworks for data mining. SIGKDD Explorations, 2000.
23. H. Mannila. Randomization techniques for data mining methods. In Proc. of the 12th East European Conference on Advances in Databases and Information Systems (ADBIS08), page 1, 2008.
24. M. Ojala, N. Vuokko, A. Kallio, N. Haiminen, and H. Mannila. Randomization of real-valued matrices for assessing the significance of data mining results. In Proc. of the 2008 SIAM International Conference on Data Mining (SDM08), pages 494-505, 2008.
25. B. Padmanabhan and A. Tuzhilin. A belief-driven method for discovering unexpected patterns. In Proc. of the 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD98), pages 94-100, 1998.
26. L. D. Raedt. A perspective on inductive databases. SIGKDD Explorations, 4(2):69-77, 2002.
27. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In SIAM Conference on Data Mining, 2006.
28. A. Silberschatz and A. Tuzhilin. On subjective measures of interestingness in knowledge discovery. In Proc. of the 1st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD95), pages 275-281, 1995.
29. N. Tatti. Maximum entropy based significance of itemsets. Knowledge and Information Systems, 17(1):57-77, 2008.
30. L. Valiant. A theory of the learnable. Communications of the ACM, 27, 1984.