ML Anthology

A Robust Clustering Algorithm Based on Competitive Agglomeration and Soft Rejection of Outliers

Hichem Frigui, Raghu Krishnapuram
CVPR 1996 pp. 550-555
doi:10.1109/CVPR.1996.517126 /cvpr/1996/frigui1996cvpr-robust/

Abstract

We present a new clustering algorithm that addresses two major issues associated with conventional partitional clustering: the difficulty in determining the number of clusters, and the sensitivity to noise and outliers. The proposed algorithm determines the number of clusters by a process of competitive agglomeration. Noise immunity is achieved by integrating concepts from robust statistics into the algorithm. The proposed approach can incorporate different distance measures in the objective function to find an unknown number of clusters of various types including lines, planes and surfaces.

CVPR Semantic Scholar

Cite

Text

Frigui and Krishnapuram. "A Robust Clustering Algorithm Based on Competitive Agglomeration and Soft Rejection of Outliers." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996. doi:10.1109/CVPR.1996.517126

Markdown

[Frigui and Krishnapuram. "A Robust Clustering Algorithm Based on Competitive Agglomeration and Soft Rejection of Outliers." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996.](https://mlanthology.org/cvpr/1996/frigui1996cvpr-robust/) doi:10.1109/CVPR.1996.517126

BibTeX

@inproceedings{frigui1996cvpr-robust,
  title     = {{A Robust Clustering Algorithm Based on Competitive Agglomeration and Soft Rejection of Outliers}},
  author    = {Frigui, Hichem and Krishnapuram, Raghu},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1996},
  pages     = {550-555},
  doi       = {10.1109/CVPR.1996.517126},
  url       = {https://mlanthology.org/cvpr/1996/frigui1996cvpr-robust/}
}