Generalizing Centroid Index to Different Clustering Models-Reference-Cited by-同舟云学术

Generalizing Centroid Index to Different Clustering Models

Published:2016 Issue: Volume: Page:285-296
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fränti Pasi,Rezaei Mohammad

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-49055-7_26

Reference27 articles.

1. Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846–850 (1971)

2. Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193–218 (1985)

3. Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837–2854 (2010)

4. Kvalseth, T.O.: Entropy and correlation: some comments. IEEE Trans. Syst. Man Cybern. 17(3), 517–519 (1987)

5. Dongen, S.V.: Performance criteria for graph clustering and Markov cluster experiments. Technical report INSR0012, Centrum voor Wiskunde en Informatica (2000)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A K-Means Variation Based on Careful Seeding and Constrained Silhouette Coefficients;Lecture Notes in Networks and Systems;2024

2. Clustering accuracy;Applied Computing and Intelligence;2024

3. An Efficient Algorithm for Clustering Sets;2023 IEEE/ACM 27th International Symposium on Distributed Simulation and Real Time Applications (DS-RT);2023-10-04

4. Two Medoid-Based Algorithms for Clustering Sets;Algorithms;2023-07-20

5. Improving K-means by an Agglomerative Method and Density Peaks;Third Congress on Intelligent Systems;2023