Summarizing data succinctly with the most informative itemsets

ACM Transactions on Knowledge Discovery from Data

Volumn 6, Issue 4, 2012, Pages

  Mampaey, Michael ^a   Vreeken, Jilles ^a   Tatti, Nikolaj ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

BIC; Frequent itemsets; Inclusion exclusion; Maximum entropy; MDL; Minimum description length principle; Pattern sets; Summarization

Indexed keywords

BIC; INCLUSION-EXCLUSION; ITEM SETS; MAXIMUM ENTROPY; MDL; MINIMUM DESCRIPTION LENGTH PRINCIPLE; PATTERN SET; SUMMARIZATION;

ALGORITHMS; INFORMATION THEORY; MAXIMUM ENTROPY METHODS; NATURAL LANGUAGE PROCESSING SYSTEMS;

ITERATIVE METHODS;

EID: 84878575950     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/2382577.2382580     Document Type: Conference Paper

References (57)

1. AGGARWAL, C. C. AND YU, P. S. 1998. A new framework for itemset generation. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 18-24.
2. BAUMGARTNER, C., BÖHM, C., AND BAUMGARTNER, D. 2005. Modelling of classification rules on metabolic patterns including machine learning and expert knowledge. Biomed. Inf. 38, 2, 89-98.
3. BOULICAUT, J., BYKOWSKI, A., AND RIGOTTI, C. 2003. Free-Sets: A condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Discov. 7, 1, 5-22.
4. BRIJS, T., SWINNEN, G., VANHOOF, K., AND WETS, G. 1999. Using association rules for product assortment decisions: A case study. In Proceedings of the 5th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 254-260.
5. BRIN, S., MOTWANI, R., AND SILVERSTEIN, C. 1997. Beyond market baskets: Generalizing association rules to correlations. In Proceedings of the ACM International Conference on Management of Data (SIGMOD). ACM, 265-276.
6. CALDERS, T. AND GOETHALS, B. 2006. Quick inclusion-exclusion. In Proceedings of the ECML PKDD Workshop on Knowledge Discovery in Inductive Databases (KDID). Springer, 86-103.
7. CALDERS, T. AND GOETHALS, B. 2007. Non-Derivable itemset mining. Data Min. Knowl. Discov. 14, 1, 171-206.
8. COVER, T. M. AND THOMAS, J. A. 2006. Elements of Information Theory. Wiley-Interscience, New York.
9. COWELL, R. G., DAWID, A. P., LAURITZEN, S. L., AND SPIEGELHALTER, D. J. 1999. Probabilistic networks and expert systems. In Statistics for Engineering and Information Science, M. Jordan, S. L. L. nad Jeral F. Lawless, and V. Nair, Eds., Springer.
10. CSISZÁR, I. 1975. I-Divergence geometry of probability distributions and minimization problems. Ann. Probab. 3, 1, 146-158.
11. DARROCH, J. AND RATCLIFF, D. 1972. Generalized iterative scaling for log-linear models. Ann. Math. Statis. 43, 5, 1470-1480.
12. DE BIE, T. 2011a. An information theoretic framework for data mining. In Proceedings of the 17th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 564-572.
13. DE BIE, T. 2011b. Maximum entropy models and subjective interestingness: An application to tiles in binary databases. Data Min. Knowl. Discov. 23, 3, 407-446.
14. FRANK, A. AND ASUNCION, A. 2010. UCI machine learning repository. http://archive.ics.uci.edu/ml.
15. GALLO, A., CRISTIANINI, N., AND DE BIE, T. 2007. MINI: Mining informative non-redundant itemsets. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD). Springer, 438-445.
16. GARRIGA, G. C.,JUNTTILA, E., ANDMANNILA,H. 2011. Banded structure in binary matrices. Knowl. Inf. Syst. 28, 1, 197-226.
17. GEERTS, F., GOETHALS, B., AND MIELIKÄINEN, T. 2004. Tiling databases. In Proceedings of Discovery Science Conference. 278-289.
18. GELMAN, A., CARLIN, J., STERN, H., AND RUBIN, D. 2004. Bayesian Data Analysis. CRC Press.
19. GENG, L. AND HAMILTON, H. J. 2006. Interestingness measures for data mining: A survey. ACM Comput. Surv. 38, 3, 9.
20. GEURTS, K., WETS, G., BRIJS, T., AND VANHOOF, K. 2003. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board. 1-18.
21. GIONIS, A., MANNILA, H., MIELIKÄINEN, T., AND TSAPARAS, P. 2007. Assessing data mining results via swap randomization. ACM Trans. Knowl. Discov. Data 1, 3, 167-176.
22. GOETHALS, B. AND ZAKI, M. 2004. Frequent itemset mining dataset repository (FIMI). http://fimi.ua.ac.be/.
23. GRÜNWALD, P. 2005. Minimum description length tutorial. In Advances in Minimum Description Length, P. Gr ünwald and I. Myung, Eds., MIT Press.
24. GRÜNWALD, P. 2007. The Minimum Description Length Principle. MIT Press.
25. HANHIJÄRVI, S.,OJALA,M.,VUOKKO, N.,PUOLAMÄKI, K., TATTI, N., ANDMANNILA, H. 2009. Tell me something I don't know: Randomization strategies for iterative data mining. In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 379-388.
26. HEIKINHEIMO, H., FORTELIUS, M.,ERRONEN, J., ANDMANNILA, H. 2007. Biogeography of European land mammals shows environmentally distinct and spatially coherent clusters. J. Biogeograph. 34, 6, 1053-1064.
27. JAROSZEWICZ, S. AND SIMOVICI, D. A. 2004. Interestingness of frequent itemsets using bayesian networks as background knowledge. In Proceedings of the 10th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 178-186.
28. JAYNES, E. 1982. On the rationale of maximum-entropy methods. Proc. IEEE 70, 9, 939-952.
29. KONTONASIOS, K.-N. AND DE BIE, T. 2010. An information-theoretic approach to finding noisy tiles in binary databases. In Proceedings of the 10th SIAM International Conference on Data Mining (SDM). SIAM, 153-164.
30. LI, M. AND VITÁNYI, P. 1993. An Introduction to Kolmogorov Complexity and its Applications. Springer.
31. MAMPAEY, M., TATTI, N., AND VREEKEN, J. 2011. Tell me what I need to know: Succinctly summarizing data with itemsets. In Proceedings of the 17th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 573-581.
32. MAMPAEY, M. AND VREEKEN, J. 2010. Summarising data by clustering items. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD). Springer, 321-336.
33. MITCHELL-JONES, A., AMORI, G., BOGDANOWICZ, W., KRYSTUFEK, B., REIJNDERS, P. H., SPITZENBERGER, F., STUBBE, M., THISSEN, J., VOHRALIK, V., AND ZIMA, J. 1999. The Atlas of European Mammals. Academic Press.
34. MYLLYKANGAS, S., HIMBERG, J., BÖHLING, T., NAGY, B., HOLLMÉN, J., AND KNUUTILA, S. 2006. DNA copy number amplification profiling of human neoplasms. Oncogene 25, 55, 7324-7332.
35. NIJSSEN, S.,GUNS, T., AND DE RAEDT, L. 2009. Correlated itemset mining in ROC space: A constraint programming approach. In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). Springer, 647-656.
36. PASQUIER, N.,BASTIDE, Y., TAOUIL, R., AND LAKHAL, L. 1999. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory (ICDT). ACM, 398-416.
37. RISSANEN, J. 1978. Modeling by shortest data description. Automatica 14, 1, 465-471.
38. SCHWARZ, G. 1978. Estimating the dimension of a model. Ann. Statist. 6, 2, 461-464.
39. SHAFFER, J. 1995. Multiple hypothesis testing. Ann. Rev. Psychol. 46, 1, 561-584.
40. SIEBES, A. AND KERSTEN, R. 2011. A structure function for transaction data. In Proceedings of the 11th SIAM International Conference on Data Mining (SDM). SIAM, 558-569.
41. SIEBES, A., VREEKEN, J., AND VAN LEEUWEN, M. 2006. Item sets that compress. In Proceedings of the 6th SIAM International Conference on Data Mining (SDM). SIAM, 393-404.
42. SMETS, K. AND VREEKEN, J. 2012. SLIM: Directly mining descriptive patterns. In Proceedings of the 12th SIAM International Conference on Data Mining (SDM). SIAM, 236-247.
43. TAN, P., KUMAR, V., AND SRIVASTAVA, J. 2002. Selecting the right interestingness measure for association patterns. In Proceedings of the 8th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 32-41.
44. TATTI, N. 2006. Computational complexity of queries based on itemsets. Inf. Process. Lett. 98, 5, 183-187.
45. TATTI, N. 2008. Maximum entropy based significance of itemsets. Knowl. Inf. Syst. 17, 1, 57-77.
46. TATTI, N. 2010. Probably the best itemsets. In Proceedings of the 16th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 293-302.
47. TATTI, N. AND HEIKINHEIMO, H. 2008. Decomposable families of itemsets. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD). Springer, 472-487.
48. TATTI, N. AND MAMPAEY, M. 2010. Using background knowledge to rank itemsets. Data Min. Knowl. Discov. 21, 2, 293-309.
49. VAN DEN BULCKE, T., VANDEN BROUCKE, P., VAN HOOF, V., WOUTERS, K., VANDEN BROUCKE, S., SMITS, G., SMITS, E., PROESMANS, S., VAN GENECHTEN, T., AND EYSKENS, F. 2011. Data mining methods for classification of Medium-Chain Acyl-CoA dehydrogenase deficiency (MCADD) using non-derivatized tandem MS neonatal screening data. J. Biomed. Inf. 44, 2, 319-325.
50. VREEKEN, J., VAN LEEUWEN,M., AND SIEBES, A. 2007. Preserving privacy through data generation. In Proceedings of the 7th IEEE International Conference on Data Mining (ICDM). IEEE, 685-690.
51. VREEKEN, J., VAN LEEUWEN, M., AND SIEBES, A. 2011. KRIMP: Mining itemsets that compress. Data Min. Knowl. Discov. 23, 1, 169-214.
52. WALLACE, C. 2005. Statistical and Inductive Inference by Minimum Message Length. Springer.
53. WALLACE, C. S. AND PATRICK, J. D. 1993. Coding decision trees. Mach. Learn. 11, 1, 7-22.
54. WANG, C. AND PARTHASARATHY, S. 2006. Summarizing itemset patterns using probabilistic models. In Proceedings of the 12th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). 730-735.
55. WEBB, G. I. 2007. Discovering significant patterns. Mach. Learn. 68, 1, 1-33.
56. WEBB, G. I. 2010. Self-Sufficient itemsets: An approach to screening potentially interesting associations between items. ACM Trans. Knowl. Discov. Data 4, 1, 1-20.
57. ZAKI, M. J. AND RAMAKRISHNAN, N. 2005. Reasoning about sets using redescription mining. In Proceedings of the 11th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 364-373.