Maximum entropy models and subjective interestingness: An application to tiles in binary databases

Data Mining and Knowledge Discovery

Volumn 23, Issue 3, 2011, Pages 407-446

  De Bie, Tijl ^a  

^a NONE

Author keywords

Maximum entropy principle; Prior information; Rectangular databases; Subjective interestingness measures; Swap randomizations

Indexed keywords

INTERESTINGNESS MEASURES; MAXIMUM ENTROPY PRINCIPLE; PRIOR INFORMATION; RECTANGULAR DATABASES; SWAP RANDOMIZATIONS;

ASSOCIATION RULES; DATA MINING; ENTROPY;

DATABASE SYSTEMS;

EID: 80855141626     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-010-0209-3     Document Type: Article

References (46)

1. Agrawal R, Srikant R (1994) Fast algorithms formining association rules in large databases. In: Proceedings of the 20th international conference on Very large databases (VLDB94), pp 487-499
2. Asuncion A, Newman D (2007) UCI machine learning repository. http://www.ics.uci.edu/~mlearn/ MLRepository.html
3. Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509-512
4. Boyd S, Vandeberghe L (2004) Convex optimization. Cambridge University Press, Cambridge
5. Brijs T, Swinnen G, Vanhoof K, Wets G (1999) Using association rules for product assortment decisions: a case study. In: Proceedings of the 5th ACM SIGKDD international conference on Knowledge discovery in databases (KDD99), pp 254-260
6. Calders T (2008) Itemset frequency satisfiability: complexity and axiomatization. Theor Comput Sci 394 (1-2):84-111
7. Chung F, Lu L (2004) The average distance in a random graph with given expected degrees. Int Math 1(1):91-113
8. Cover TM, Thomas JA (1991) Elements of information theory. Wiley-Interscience, Hoboken
9. De Bie T (2009a) Explicit probabilistic models for databases and networks. Tech. Rep. 123931, arXiv:0906.5148v1, University of Bristol
10. De Bie T (2009b) Finding interesting itemsets using a probabilistic model for binary databases. Tech. Rep. 123930, University of Bristol
11. De Raedt L, Zimmermann A (2007) Constraint-based pattern set mining. In: Proceedings of the 2007 SIAM international conference on Data mining (SDM08), pp 237-248
12. Gallo A, De Bie T, Cristianini N (2007) MINI: Mining informative non-redundant itemsets. In: Proceedings of the 11th European conference on Principles and practice of knowledge discovery in databases (PKDD07), pp 438-445
13. Gallo A, Mammone A, De Bie T, Turchi M, Cristianini N (2009) From frequent itemsets to informative patterns. Tech. Rep. 123936, University of Bristal
14. Geerts F, Goethals B, Mielikäinen T (2004) Tiling databases. In: Proceedings of the 7th international conference on Discovery science (DS04), pp 278-289 (Pubitemid 39745469)
15. Geng L, HamiltonHJ (2006) Interestingness measures for data mining: a survey.ACMComput Surv 38(3):9
16. Gentle JE (2005) Elements of computational statistics. Springer, New York
17. Gionis A, Mannila H, Seppänen JK (2004) Geometric and combinatorial tiles in 0-1 data. In: Principles and practice of knowledge discovery in databases (PKDD04), pp 173-184 (Pubitemid 39740401)
18. Gionis A, Mannila H, Mielikäinen T, Tsaparas P (2007) Assessing data mining results via swap randomization. ACM Trans Knowl Discov Data 1(3):14
19. Gull S, Skilling J (1984) Maximum entropy method in image processing. Communications, radar and signal processing. IEE Proc F 131(6):646-659 (Pubitemid 14642518)
20. Hanhijarvi S, Ojala M, Vuokko N, Puolamäki K, Tatti N, Mannila H (2009) Tell me something I don't know: randomization strategies for iterative data mining. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD09), pp 379-388
21. Jaroszewicz S, Simovici DA (2004) Interestingness of frequent itemsets using bayesian networks as background knowledge. In: Proceedings of the 10thACMSIGKDDinternational conference on Knowledge discovery and data mining (KDD04), pp 178-186 (Pubitemid 40114927)
22. Jaynes E (1957) Information theory and statistical mechanics I. Phys Rev 106(4):620-630
23. Jaynes E (1982) On the rationale of maximum-entropy methods. Proc IEEE 70(9):939-952
24. Khuller S, Moss A, Naor J (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):39-45
25. Kontonasios KN, De Bie T (2010) An information-theoretic approach to finding informative noisy tiles in binary databases. In: Proceedings of the 2010 SIAM international conference on Data mining (SDM10), pp 153-164
26. Lehmann E, Romano J (1995) Testing statistical hypotheses, 3rd edn. Springer, New York
27. Mannila H (2008) Randomization techniques for data mining methods. In: Proceedings of the 12th East European conference on Advances in databases and information systems (ADBIS08), p 1
28. Miettinen P, Mielikainen T, Gionis A, Das G, Mannila H (2008) The discrete basis problem. IEEE Trans Knowl Data Eng 20(10):1348-1362
29. Milo R, Shen-Orr S, Itzkovirz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824-827 (Pubitemid 35231534)
30. Minoux M (1978) Accelerated greedy algorithms for maximizing submodular set functions. Optimization Techniques. Springer, Berlin, pp 234-243
31. Newman M (2003) The structure and function of complex networks. SIAM Rev 45(2):167-256
32. Ojala M, Vuokko N, Kallio A, Haiminen N, Mannila H (2008) Randomization of real-valued matrices for assessing the significance of data mining results. In: Proceedings of the 2008 SIAM international conference on Data mining (SDM08), pp 494-505
33. Padmanabhan B, Tuzhilin A (1998) A belief-driven method for discovering unexpected patterns. In: Proceedings of the 4th ACMSIGKDD international conference on Knowledge discovery and data mining (KDD98), pp 94-100
34. Padmanabhan B, Tuzhilin A (2000) Small is beautiful: discovering the minimal set of unexpected patterns. In: Proceedings of the 6th ACMSIGKDD international conference on Knowledge discovery and data mining (KDD00), pp 54-63
35. Pavlov D, Mannila H, Smyth P (2003) Beyond independence: probabilistic models for query approximation on binary transaction data. IEEE Trans Knowl Data Eng 15:1409-1421
36. Rasch G (1961) On general laws and the meaning of measurement in psychology. In: Proceedings of the fourth Berkeley symposium on Mathematical statistics and probability, vol IV, pp 321-333
37. Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p?)models for social networks. Soc Netw 29(2):173-191
38. Savinov A (2004) Mining dependence rules by finding largest itemset support quota. In: Proceedings of the 2004 ACM symposium on Applied computing, pp 525-529
39. Shewchuk J (1994) An introduction to the conjugate gradient method without the agonizing pain. Tech. rep, CMU
40. Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of the 2006 SIAM international conference on Data mining (SDM06), pp 393-404
41. Silberschatz A, Tuzhilin A (1995) On subjective measures of interestingness in knowledge discovery. In: Proceedings of the 1st ACM SIGKDD international conference on Knowledge discovery and data mining (KDD95), pp 275-281
42. Tatti N (2008) Maximum entropy based significance of itemsets. Knowl Inf Syst 17(1):57-77
43. Topsøe F (1979) Information-theoretical optimization techniques. Kybernetika 15(1):8-27
44. Tribus M (1961) Thermostatics and thermodynamics: an introduction to energy, information and states of matter, with engineering applications. Van Nostrand, Princeton
45. Wainwright M, Jordan MI (2008) Graphical models, exponential families, and variational inference. Found Trends Mach Learn 1(1-2):1-305
46. Zaki M, Hsiao C (2002) CHARM: an efficient algorithm for closed itemsets mining. In: Proceedings of the 2002 SIAM international conference on Data mining (SDM02), pp 457-473