Towards a simple clustering criterion based on minimum length encoding

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

Volumn 2430, Issue , 2002, Pages 258-270

  Ludl, Marcus Christopher ^a   Widmer, Gerhard ^a,b  

^a AUSTRIAN RESEARCH INSTITUTE FOR ARTIFICIAL INTELLIGENCE   (Austria)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); MACHINE LEARNING; SIGNAL ENCODING;

CLUSTER BOUNDARIES; CLUSTER MEMBERSHIPS; CLUSTERING CRITERIA; CLUSTERING EVALUATION; HYPERRECTANGLES; LENGTH ENCODING; MESSAGE LENGTH; MINIMUM DESCRIPTION LENGTH PRINCIPLE;

CLUSTERING ALGORITHMS;

EID: 84945305324     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36755-1_22     Document Type: Conference Paper

References (14)

1. R. A. Baxter and J. Oliver. MDL and MML: Similarities and differences. Technical report, Dept. of Computer Science, Monash University, Clayton, 1994. (TR 207).
2. P. S. Bradley and U. M. Fayyad. Refining initial points for k-means clustering. In Proceedings of the 15th Int. Conference on Machine Learning, 91-99, 1998.
3. P. Cheeseman, J. Kelly, M. Self, J. Stutz, W. Taylor, and D. Freeman. Autoclass: A bayesian classification system. In Proceedings of the 5th International Workshop on Machine Learning, 54-64, 1988.
4. D. Keim and A. Hinneburg. Clustering techniques for large data sets: From the past to the future. In Tutorial Notes for ACM SIGKDD 1999 International Conference on Knowledge Discovery and Data Mining, San Diego, CA, 1999.
5. R. Koschke and T. Eisenbarth. A framework for experimental evaluation of clustering techniques. In Proceedings of the International Workshop on Program Comprehension (IWPC2000), Limerick, Ireland, 2000. IEEE.
6. M.-C. Ludl and G. Widmer. Relative unsupervised discretization for association rule mining. In Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD2000), Lyon, 2000.
7. A. Y. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Proceedings of NIPS 14, 2002. (to appear).
8. J. J. Oliver, R. A. Baxter, and C. S. Wallace. Unsupervised learning using MML. In Proceedings of the 13th International Conference on Machine Learning, 364-372, San Francisco, CA, 1996. Morgan Kaufmann.
9. D. Pelleg and A. Moore.Accelerating exact k-means algorithms with geometric reasoning. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD99), 277-281, 1999.
10. B. D. Ripley. Pattern recognition and neural networks. Statistics, 33: 1065-1076, 1996.
11. S. Z. Selim and M. A. Ismail. K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(1): 81-87, 1984.
12. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In KDD Workshop on Data Mining, 2000.
13. C. S. Wallace and D. L. Dowe. Intrinsic classification by MML - the SNOB program. In Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, 37-44, Singapore, 1994. World Scientific.
14. Y. Weiss. Segmentation using eigenvectors: A unifying view. In Proceedings of the IEEE International Conference on Computer Vision (ICCV99), 975-982, 1999.