Parameter-free spatial data mining using MDL

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 346-353

  Papadimitriou, Spiros ^a   Väisänen, Risto A ^b   Gionis, Aristides ^b   Mannila, Heikki ^b   Tsaparas, Panayiotis ^b   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION METHODS; DATA ACQUISITION; DATA COMPRESSION; DATA REDUCTION; DATABASE SYSTEMS; PARAMETER ESTIMATION;

DATASETS; MINIMUM DESCRIPTION LENGTH (MDL); SPATIAL CORRELATION; SYNTHETIC DATASETS;

DATA MINING;

EID: 34548569508     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.117     Document Type: Conference Paper

References (32)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, 1994.
2. P. Andritsos, P. Tsaparas, R. Miller, and K. Sevcik. LIMBO: Scalable clustering for categorical data. In EDBT, 2004.
3. S. Basu, M. Bilenko, and R. J. Mooney. A probabilistic framework for semi-supervised clustering. In KDD, 2004.
4. D. Chakrabarti, S. Papadimitriou, D. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, 2004.
5. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley-Interscience, 1991.
6. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In KDD, 2003.
7. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Mach. Learning, 42, 2001.
8. P. Grünwald. A tutorial introduction to the minimum description length principle. In Advances in Minimum Description Length: Theory and Applications. MIT Press, 2005.
9. S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for large databases. In SIGMOD, 1998.
10. G. Hamerly and C. Elkan. Learning the k in k-means. In NIPS, 2003.
11. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
12. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53-87, 2004.
13. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, 2001.
14. A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In KDD, 1998.
15. Y. Huang, H. Xiong, S. Shekhar, and J. Pei. Mining confident co-location rules without a support threshold. In SAC, 2003.
16. G. Karypis, E.-H. Han, and V. Kumar. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, 32(8), 1999.
17. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. In SC98, 1998.
18. E. Keogh, S. Lonardi, and C. A. Ratanamahatana. Towards parameter-free data mining. In KDD, 2004.
19. J. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. JACM, 49(5):616-639, 2002.
20. A. Leino, H. Mannila, and R. L. Pitkänen. Rule discovery and probabilistic modeling for onomastic data. In PKDD, 2003.
21. N. Mishra, D. Ron, and R. Swaminathan. On finding large conjunctive clusters. In COLT, 2003.
22. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, 2001.
23. D. Pelleg and A. Moore. X-means: Extending K-means with efficient estimation of the number of clusters. In ICML, pages 727-734, 2000.
24. R. B. Potts. Some generalized order-disorder transformations. Proc. Camb. Phil. Soc., 48:106, 1952.
25. P. K. Reddy and M. Kitsuregawa. An approach to relate the web communities through bipartite graphs. In WISE, 2001.
26. J. Rissanen and G. G. Langdon Jr. Arithmetic coding. IBM J. Res. Dev., 23:149-162, 1979.
27. M. Salmenkivi. Evaluating attraction in spatial point patterns with an application in the field of cultural history. In ICDM, 2004.
28. D. J. Vaisey and A. Gersho. Variable block-size image coding. In ICASSP, 1987.
29. R. Zabih and V. Kolmogorov. Spatially coherent clustering with graph cuts. In CVPR, 2004.
30. B. Zhang, M. Hsu, and U. Dayal. K-harmonic means - a spatial clustering algorithm with boosting. In TSDM, 2000.
31. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In SIGMOD, 1996.
32. X. Zhang, N. Mamoulis, D. W. Cheung, and Y. Shou. Fast mining of spatial collocations. In KDD, 2004.