Summarising data by clustering items

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6322 LNAI, Issue PART 2, 2010, Pages 321-336

  Mampaey, Michael ^a   Vreeken, Jilles ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DATA; DISTANCE MEASURE; FREQUENT ITEMSETS; HIGH QUALITY; MINIMUM DESCRIPTION LENGTH PRINCIPLE; ORDER STATISTICS; PARAMETER-FREE METHODS;

LEARNING SYSTEMS;

DATABASE SYSTEMS;

EID: 78049363467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15883-4_21     Document Type: Conference Paper

References (20)

1. Bringmann, B., Zimmermann, A.: The chosen few: On identifying valuable patterns. In: Perner, P. (ed.) ICDM 2007. LNCS (LNAI), vol. 4597, pp. 63-72. Springer, Heidelberg (2007)
2. Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 74-85. Springer, Heidelberg (2002)
3. Chandola, V., Kumar, V.: Summarization - compressing data into an informative representation. In: Proceedings of ICDM 2005, pp. 98-105 (2005)
4. Cover, T. M., Thomas, J. A.: Elements of Information Theory, 2nd edn. John Wiley and Sons, Chichester (2006)
5. Garriga, G. C., Junttila, E., Mannila, H.: Banded structure in binary matrices. In: Proceedings of KDD 2008, pp. 292-300 (2008)
6. Gionis, A., Mannila, H., Mielikäinen, T., Tsaparas, P.: Assessing data mining results via swap randomization. TKDD, 1 (3) (2007)
7. Grünwald, P. D.: The Minimum Description Length Principle. MIT Press, Cambridge (2007)
8. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: Current status and future directions. Data Mining and Knowledge Discovery 15(1), 55-86 (2007)
9. Hanhijärvi, S., Ojala, M., Vuokko, N., Puolamäki, K., Tatti, N., Mannila, H.: Tell me something I don't know: randomization strategies for iterative data mining. In: Proceedings of KDD 2009, pp. 379-388. ACM, New York (2009)
10. Heikinheimo, H., Hinkkanen, E., Mannila, H., Mielikäinen, T., Seppänen, J. K.: Finding low-entropy sets and trees from binary data. In: Proceedings of KDD 2007, pp. 350-359 (2007)
11. Heikinheimo, H., Vreeken, J., Siebes, A., Mannila, H.: Low-entropy set selection. In: Jonker, W., Petković, M. (eds.) Secure Data Management. LNCS, vol. 5776, pp. 569-579. Springer, Heidelberg (2009)
12. Knobbe, A. J., Ho, E. K. Y.: Maximally informative k-itemsets and their efficient discovery. In: Proceedings of KDD 2006, pp. 237-244 (2006)
13. MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Symposium on Mathematical Statistics and Probability (1967)
14. Myllykangas, S., Himberg, J., Böhling, T., Nagy, B., Hollmén, J., Knuutila, S.: DNA copy number amplification profiling of human neoplasms. Oncogene 25(55), 7324-7332 (2006)
15. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398-416. Springer, Heidelberg (1998)
16. Pensa, R., Robardet, C., Boulicaut, J.-F.: A bi-clustering framework for categorical data. In: Jorge, A. M., Torgo, L., Brazdil, P. B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 643-650. Springer, Heidelberg (2005)
17. Siebes, A., Vreeken, J., van Leeuwen, M.: Item sets that compress. In: Jonker, W., Petković, M. (eds.) SDM 2006. LNCS, vol. 4165, pp. 393-404. Springer, Heidelberg (2006)
18. Vreeken, J., van Leeuwen, M., Siebes, A.: Preserving privacy through data generation. In: Perner, P. (ed.) ICDM 2007. LNCS (LNAI), vol. 4597, pp. 685-690. Springer, Heidelberg (2007)
19. Wang, J., Karypis, G.: SUMMARY: Efficiently summarizing transactions for clustering. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol. 3275, pp. 241-248. Springer, Heidelberg (2004)
20. Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: A profilebased approach. In: Proceedings of KDD 2005, pp. 314-323 (2005)