A framework for mining interesting pattern sets

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

Volumn , Issue , 2010, Pages 27-35

  De Bie, Tijl ^a   Kontonasios, Kleanthis Nikolaos ^a   Spyropoulou, Eirini ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Maximum entropy; Pattern set mining; Prior information; Subjective interestingness measures

Indexed keywords

CODING THEORY; DATA MINERS; EMPIRICAL EVALUATIONS; INTERESTINGNESS MEASURES; MARGINALS; MAXENT MODELS; MAXIMUM ENTROPY; PATTERN SET; PRIOR INFORMATION; RESEARCH CHALLENGES; TWO-COMPONENT;

ASSOCIATION RULES; COMPUTER PROGRAMMING; ENTROPY; INFORMATION THEORY; MINERS; TECHNICAL PRESENTATIONS;

DATA MINING;

EID: 77956250269     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1816112.1816117     Document Type: Conference Paper

References (24)

1. B. Bringmann and A. Zimmermann. The chosen few: on identifying valuable patterns. In Proc. of 7th IEEE International Conference on Data Mining (ICDM07), 2007.
2. T. De Bie. Explicit probabilistic models for databases and networks. Technical report, University of Bristol TR 123931, arXiv:0906.5148v1, 2009.
3. T. De Bie. Maximum entropy models for prior information on rectangular databases. Technical report, University of Bristol TR 125861, submitted, 2010.
4. L. De Raedt and A. Zimmermann. Constraint-based pattern set mining. In Proc. of the 2007 SIAM International Conference on Data Mining (SDM08), 2007.
5. A. Gallo, T. De Bie, and N. Cristianini. Mini: Mining informative non-redundant itemsets. In Proceedings of 2007 KDD, 2007.
6. 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.
7. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In Discovery Science, 2004.
8. L. Geng and H. J. Hamilton. Interestingness measures for data mining: A survey. ACM Computing Surveys, 38(3):9, 2006.
9. A. Gionis, H. Mannila, T. Mielikäinen, and P. Tsaparas. Assessing data mining results via swap randomization. TKDD, 1(3), 2007.
10. B. Goethals, W. Le Page, and M. Mampaey. Mining interesting sets and rules in relational databases. In Proc. of the 25th ACM Symposium on Applied Computing (ACM SAC), pages 996-1000, 2010.
11. S. Hanhijarvi, 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 Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD09), pages 379-388, 2009.
12. 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.
13. K. 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.
14. L. G. Kraft. A device for quantizing, grouping, and coding amplitude modulated pulses. Technical report, Massachusetts Institute of Technology, 1949.
15. K. Lemmens, T. Dhollander, T. De Bie, P. Monsieurs, K. Engelen, B. Smets, J. Winderickx, B. D. Moor, and K. Marchal. Inferring transcriptional modules from chip-chip, motif and microarray data. Genome Biology, 7(R37), 2006.
16. M. Ojala, G. Garriga, A. Gionis, and H. Mannila. Evaluating query result significance in databases via randomizations. In Proc. of the 2010 SIAM International Conference on Data Mining (SDM), 2010.
17. 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.
18. 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 94U-100, 1998.
19. B. Padmanabhan and A. Tuzhilin. Small is beautiful: discovering the minimal set of unexpected patterns. In Proc. of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD00), pages 54U-63, 2000.
20. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In SIAM Conference on Data Mining, 2006.
21. 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 275U-281, 1995.
22. N. Tatti. Maximum entropy based significance of itemsets. Knowledge and Information Systems, 17(1):57-77, 2008.
23. M. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1-2):1-305, 2008.
24. M. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed itemsets mining. In Proc. of the 2nd SIAM ICDM, 2002.