A multi-prototype clustering algorithm

DOI10.1016/j.patcog.2008.09.015zbMath1162.68614OpenAlexW2050151315MaRDI QIDQ1010075

Xudong Jiang, Manhua Liu, Alex Chichung Kot

Publication date: 3 April 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.09.015

zbMATH Keywords

data clusteringcluster prototypeseparation measuresquared-error clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (3)

A distance based clustering method for arbitrary shaped clusters in large datasets ⋮ SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index ⋮ A novel fast heuristic to handle large-scale shape clustering

Uses Software

• UCI-ml

Cites Work

• Cure: An efficient clustering algorithm for large databases
• A new approach to clustering data with arbitrary shapes
• The use of linked line segments for cluster representation and data reduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A multi-prototype clustering algorithm