Fast and Robust General Purpose Clustering Algorithms
- 1 January 2000
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 208-218
- https://doi.org/10.1007/3-540-44533-1_24
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Robust Clusterin of Large Geo-referenced Data SetsLecture Notes in Computer Science, 1999
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster AnalysisThe Computer Journal, 1998
- Finding Groups in DataWiley Series in Probability and Statistics, 1990
- Robust Regression and Outlier DetectionWiley Series in Probability and Statistics, 1987
- Proving geometric algorithm non-solvability: An application of factoring polynomialsJournal of Symbolic Computation, 1986
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local OptimalityIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Cluster AnalysisPublished by SAGE Publications ,1984
- A quadratically convergent method for minimizing a sum of euclidean normsMathematical Programming, 1983
- A note on Fermat's problemMathematical Programming, 1973