Graphs & digraphs (2nd ed.)
A dynamic approach for clustering data
Signal Processing
Bayesian classification (AutoClass): theory and results
Advances in knowledge discovery and data mining
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Data Mining and Knowledge Discovery
Incremental Clustering for Mining in a Data Warehousing Environment
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Pattern Recognition, Third Edition
Pattern Recognition, Third Edition
On fuzzy cluster validity indices
Fuzzy Sets and Systems
Expert Systems with Applications: An International Journal
A generalized automatic clustering algorithm in a multiobjective framework
Applied Soft Computing
Hi-index | 0.01 |
Applying graph theory to clustering, we propose a partitional clustering method and a clustering tendency index. No initial assumptions about the data set are requested by the method. The number of clusters and the partition that best fits the data set, are selected according to the optimal clustering tendency index value.