A new efficient algorithm based on DC pr
β
Le Thi Hoai An; M. Tayeb Belghiti; Pham Dinh Tao
π
Article
π
2006
π
Springer US
π
English
β 221 KB
In this paper, a version of K-median problem, one of the most popular and best studied clustering measures, is discussed. The model using squared Euclidean distances terms to which the K-means algorithm has been successfully applied is considered. A fast and robust algorithm based on DC (Difference