KRIMP: Mining itemsets that compress

Data Mining and Knowledge Discovery

Volumn 23, Issue 1, 2011, Pages 169-214

  Vreeken, Jilles ^a,b   Van Leeuwen, Matthijs ^a   Siebes, Arno ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Itemsets; MDL; Pattern mining; Pattern selection

Indexed keywords

COMMON KNOWLEDGE; EXPERIMENTAL EVALUATION; FREQUENT ITEMSETS; HIGH QUALITY; ITEM SETS; LARGE GROUPS; MDL; MDL PRINCIPLE; ORDERS OF MAGNITUDE; PATTERN MINING; PATTERN SELECTION;

EID: 79960089996     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-010-0202-x     Document Type: Article

References (66)

1. Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo AI (1996) Fast discovery of association rules. In: Advances in knowledge discovery and data mining, AAAI, pp 307-328
2. Bathoorn R, Koopman A, Siebes A (2006) Reducing the frequent pattern set. In: Proceedings of the CDMworkshops' 06, pp 55-59
3. Bayardo R (1998) Efficiently mining long patterns from databases. In: Proceedings of SIGMOD'98, pp 85-93
4. Bringmann B, Zimmermann A (2007) The chosen few: on identifying valuable patterns. In: Proceedings of the ICDM'07, pp 63-72
5. Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Proceedings of the ECML PKDD'02, pp 74-85
6. Chakrabarti D, Papadimitriou S, Modha DS, Faloutsos C (2004) Fully automatic cross-associations. In: Proceedings of KDD'04, pp 79-88 (Pubitemid 40114918)
7. Chakrabarti S, Sarawagi S, Dom B (1998) Mining surprising patterns using temporal description length. In: Proceedings of VLDB'98, Morgan Kaufmann, San Francisco, pp 606-617
8. Chandola V,Kumar V (2007) Summarization-compressing data into an informative representation.Knowl Inf Syst 12(3):355-378
9. Coenen F (2003) The LUCS-KDD discretised/normalised ARM and CARM data library. http://www.csc. liv.ac.uk/~frans/KDD/Software/LUCS-KDD-DN/DataSets/ dataSets.html
10. Coenen F (2004) The LUCS-KDD software library. http://www.csc.liv.ac.uk/ ~frans/KDD/Software
11. Cover T, Thomas J (2006) Elements of information theory, 2nd edn. John Wiley and Sons, New York
12. Crémilleux B, Boulicaut JF (2002) Simplest rules characterizing classes generated by δ-free sets. In: Proceeding of KBSAAI'02, pp 33-46
13. Duda R, Hart P (1973) Pattern classification and scene analysis. John Wiley and Sons, New York
14. Faloutsos C,Megalooikonomou V (2007) On data mining, compression and Kolmogorov complexity. Data Min Knowl Discov 15(1):3-20 (Pubitemid 47142808)
15. Geerts F, Goethals B, Mielikäinen T (2004) Tiling databases. In: Proceedings of DS'04, pp 278-289 (Pubitemid 39745469)
16. 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
17. Goethals B, Zaki MJ (2003) Frequent itemset mining implementations repository (FIMI). http://fimi.cs. helsinki.fi
18. Grünwald PD (2005) Minimum description length tutorial. In: Grünwald P, Myung I (eds) Advances in minimum description length. MIT Press, Cambridge
19. Grünwald PD (2007) The minimum description length principle. MIT Press, Cambridge
20. Hand D, Adams N, Bolton R (eds) (2002) Pattern detection and discovery. Springer, New York
21. Heikinheimo H, Hinkkanen E, Mannila H, Mielikäinen T, Seppänen JK (2007) Finding low-entropy sets and trees from binary data. In: Proceedings of KDD'07, pp 350-359 (Pubitemid 350229222)
22. Heikinheimo H, Vreeken J, Siebes A, Mannila H (2009) Low-entropy set selection. In: Proceedings of SDM'09, pp 569-579
23. Karp RM (1972) Reducibility among combinatorial problems. In: Miller R, Thatcher J (eds) Proceedings of a symposium on the complexity of computer computations. Plenum Press, New York, USA, pp 85-103
24. Keogh E, Lonardi S, Ratanamahatana CA (2004) Towards parameter-free data mining. In: Proceedings of KDD'04, pp 206-215 (Pubitemid 40114930)
25. Keogh E, Lonardi S, Ratanamahatana CA, Wei L, Lee SH, Handley J (2007) Compression-based data mining of sequential data. Data Min Knowl Discov 14(1):99-129 (Pubitemid 46345357)
26. Knobbe AJ, Ho EKY (2006a) Maximally informative k-itemsets and their efficient discovery. In: Proceedings of KDD'06, pp 237-244 (Pubitemid 44535520)
27. Knobbe AJ, Ho EKY (2006b) Pattern teams. In: Proceedings of the ECML PKDD'06, pp 577-584 (Pubitemid 44617760)
28. Kohavi R, Brodley C, Frasca B, Mason L, Zheng Z (2000) KDD-Cup 2000 organizers' report: peeling the onion. SIGKDD Explor 2(2):86-98. http://www.ecn.purdue.edu/KDDCUP
29. Koopman A, Siebes A (2008) Discovering relational items sets efficiently. In: Zaki M, Wang K (eds) Proceedings of SDM'08, SIAM, pp 108-119
30. Koopman A, Siebes A (2009) Characteristic relational patterns. In: Proceedings of KDD'09, pp 437-446
31. Li M, Vitányi P (1993) An introduction to Kolmogorov complexity and its applications. Springer, New York
32. Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: Proceedings of KDD'98, pp 80-86
33. LiuG, LuH,Yu JX,WeiW,XiaoX(2004) AFOPT: an efficient implementation of pattern growth approach. In: Proceedings of the 2nd workshop on frequent itemset mining implementations
34. Mannila H,ToivonenH(1996) Multiple uses of frequent sets and condensed representations. In: Proceedings of KDD'96, pp 189-194
35. Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data mining and knowledge discovery, pp 241-258
36. Mehta M, Agrawal R, Rissanen J (1996) Sliq: a fast scalable classifier for data mining. In: Advances in database technology. Springer, NY, pp 18-32
37. Meretakis D, Lu H,Wüthrich B (2000) A study on the performance of large bayes classifier. In: Proceedings of the ECML'00, pp 271-279
38. Mielikäinen T, Mannila H (2003) The pattern ordering problem. In: Proceedings of the ECML PKDD'03, pp 327-338 (Pubitemid 37231107)
39. Mitchell-Jones AJ, Amori G, Bogdanowicz W, Krystufek B, Reijnders PJH, Spitzenberger F, Stubbe M, Thissen JBM, Vohralik V, Zima J (1999) The atlas of European mammals. Academic Press, London
40. Morik K, Boulicaut JF, Siebes A (eds) (2005) Local pattern detection. Springer, New York
41. Myllykangas S, Himberg J, Böhling T, Nagy B, Hollmén J, Knuutila S (2006) Dna copy number amplification profiling of human neoplasms. Oncogene 25(55)
42. Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the ICDT'99, pp 398-416
43. Pfahringer B (1995) Compression-based feature subset selection. In: Proceedings of the IJCAI'95workshop on data engineering for inductive learning, pp 109-119
44. Quinlan J (1993b) C4.5: programs for machine learning. Morgan-Kaufmann, Los Altos
45. Quinlan J (1993b) FOIL: a midterm report. In: Proceedings of the ECML'93
46. Rissanen J (1978) Modeling by shortest data description. Automatica 14(1):465-471
47. Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of SDM'06, pp 393-404
48. Sun J, Faloutsos C, Papadimitriou S, Yu PS (2007) Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of KDD'07, pp 687-696 (Pubitemid 350229254)
49. Tatti N, Vreeken J (2008) Finding good itemsets by packing data. In: Proceedings of the ICDM'08, pp 588-597
50. van Leeuwen M, Siebes A (2008) Streamkrimp: detecting change in data streams. In: Proceedings of ECMLPKDD'08, Springer, Heidelberg, pp 672-687
51. van Leeuwen M, Vreeken J, Siebes A (2006) Compression picks the item sets that matter. In: Proceedings of the ECML PKDD'06, pp 585-592 (Pubitemid 44617761)
52. van Leeuwen M, Vreeken J, Siebes A (2009) Identifying the components. Data Min Knowl Discov 19(2):173-292
53. Vreeken J, Siebes A (2008) Filling in the blanks-Krimp minimisation for missing data. In: Proceedings of the ICDM'08, pp 1067-1072
54. Vreeken J, van Leeuwen M, Siebes A (2007a) Characterising the difference. In: Proceedings of KDD'07, pp 765-774 (Pubitemid 350229262)
55. Vreeken J, van Leeuwen M, Siebes A (2007b) Preserving privacy through data generation. In: Proceedings of the ICDM'07, pp 685-690
56. Wallace C (2005) Statistical and inductive inference by minimum message length. Springer, New York
57. Wang J, Karypis G (2005) HARMONY: efficiently mining the best rules for classification. In: Proceedings of SDM'05, pp 205-216
58. Wang J, Karypis G (2006) On efficiently summarizing categorical databases. Knowl Inf Syst 9(1):19-37 (Pubitemid 43231145)
59. Wang C, Parthasarathy S (2006) Summarizing itemset patterns using probabilistic models. In: Proceedings of KDD'06, pp 730-735 (Pubitemid 44535582)
60. Warner H, Toronto A, Veasey L, Stephenson R (1961) A mathematical model for medical diagnosis, application to congenital heart disease. J Am Med Assoc 177:177-184
61. Witten I, Frank E (2005) Data mining: practical machine learning tools and techniques. 2nd edn. Morgan Kaufmann, San Francisco
62. Xiang Y, Jin R, Fuhry D, Dragan FF (2008) Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In: Proceedings of KDD'08, pp 758-766
63. Xin D, Han J, Yan X, Cheng H (2005) Mining compressed frequent-pattern sets. In: Proceedings of VLDB'05, pp 709-720 (Pubitemid 43991046)
64. Yan X, Cheng H, Han J, Xin D (2005) Summarizing itemset patterns: a profile-based approach. In: Proceedings of KDD'05, pp 314-323 (Pubitemid 43218293)
65. YinX,Han J (2003) CPAR:Classification based on predictive association rules. In: Proceedings of SDM'03, pp 331-335
66. Zhang X, Guozhu D, Ramamohanarao K (2000) Information-based classification by aggregating emerging patterns. In: Proceedings of IDEAL'00, pp 48-53 (Pubitemid 33211298)