Data Driven Similarity Measures for k-Means Like Clustering Algorithms

Jacob Kogan; Marc Teboulle; Charles Nicholas

doi:10.1007/s10791-005-5666-8

ScienceGate Book Chapters

JOURNAL ARTICLE

Data Driven Similarity Measures for k-Means Like Clustering Algorithms

Jacob Kogan Marc Teboulle Charles Nicholas

Year: 2005 Journal: Information Retrieval Vol: 8 (2)Pages: 331-349 Publisher: Springer Science+Business Media

DOI: 10.1007/s10791-005-5666-8

Get Full-Text PDF Get Analytical Report

Keywords:

Cluster analysis Euclidean distance Algorithm Mathematics Similarity (geometry) Correlation clustering Entropy (arrow of time) Computer science Euclidean geometry CURE data clustering algorithm k-medians clustering Data mining Artificial intelligence

Metrics

Cited By

1.15

FWCI (Field Weighted Citation Impact)

Refs

0.82

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Clustering Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Face and Expression Recognition

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Bayesian Methods and Mixture Models

Physical Sciences → Computer Science → Artificial Intelligence

Data Driven Similarity Measures for k-Means Like Clustering Algorithms

Metrics

Citation History

Topics

Related Documents

Clustering with Entropy-Like k-Means Algorithms

Data Mining Methods: K-Means Clustering Algorithms

Enhancing K-Means Clustering with Data-Driven Initialization and Adaptive Distance Measures

Performance evaluation of similarity measures for K-means clustering algorithm

Improving Performance of Elastic K-Means Clustering using similarity Measures