Hierarchical Clustering Based on K-Means as Local Sample(HCKM)

Keywords

Cluster analysis, Outlier, Complete-linkage clustering, Single-linkage clustering, CURE data clustering algorithm

References

• Efficient and Effective Clustering Methods for Spatial Data MiningRaymond T. Ng, Jiawei Han — 1994
• WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial DatabasesGholamhosein Sheikholeslami, Surojit Chatterjee, Aidong Zhang — 1998
• An Efficient Approach to Clustering in Large Multimedia Databases with NoiseAlexander Hinneburg, Daniel A. Keim — 1998
• Algorithms for Clustering DataWarren S. Sarle, Anil K. Jain, Richard C. Dubes — 1988
• Automatic subspace clustering of high dimensional data for data mining applicationsRakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos — 1998
• CURE: an efficient clustering algorithm for large databasesSudipto Guha, Rajeev Rastogi, Kyuseok Shim — 1998
• BIRCH: an efficient data clustering method for very large databasesTian Zhang, Raghu Ramakrishnan, Miron Livny — 1996
• SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster MethodRobin Sibson — 1973
• Some methods for classification and analysis of multivariate observationsJames B. MacQueen — 1967
• Chameleon: Hierarchical Clustering Using Dynamic ModelingGeorge Karypis, Eui-Hong Han, Vipin Kumar — 1999
• A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with NoiseMartin Ester, Hans‐Peter Kriegel, Jörg Sander — 1996
• A density-based algorithm for discovering clusters in large spatial Databases with NoiseMartin Ester, Hans‐Peter Kriegel, Jörg Sander — 1996
• CURE : An Efficient Clustering Algorithm for Large DatabasesSudipto, Guha, Rajeev — 1998
• Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive MetricsM. Nanni — 2005
• Collective, Hierarchical Clustering from Distributed, Heterogeneous DataErik L. Johnson, H. Kargupta — 1999
• C HAMELEON : A Hierarchical Clustering Algorithm Using Dynamic ModelingQiaoming Zhu, Junhui Li, Guodong Zhou — 1999

Cited by

• Finding the Number of Clusters in Data and Better Initial Centers for K-means AlgorithmAhmed Fahim — 2020
• K and starting means for k-means algorithmAhmed Fahim — 2021

Related papers

• A density oriented fuzzy C-means clustering algorithm for recognising original cluster shapes from noisy dataPrabhjot Kaur, Anjana Gosain — 2011
• A Decision Criterion for the Optimal Number of Clusters in Hierarchical ClusteringYunJae Jung, Haesun Park, Ding‐Zhu Du — 2003
• Analysis of Mass Based and Density Based Clustering Techniques on Numerical DatasetsRekha Awasthi, Anil Kumar Tiwari, Seema R. Pathak — 2013
• MulSim: A Novel Similar-to-Multiple-Point Clustering AlgorithmMei Chen, Xiaofang Wen, Zhichong Yang — 2018
• HSC: A SPECTRAL CLUSTERING ALGORITHM COMBINED WITH HIERARCHICAL METHODLi Liu, Xiwei Chen, Dashi Luo — 2013
• A Multi-Density Clustering Algorithm Based on Similarity for Dataset With Density VariationXingxing Zhou, Haiping Zhang, Genlin Ji — 2019
• A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of ClustersFabrice Muhlenbach, Stéphane Lallich — 2009
• K -expectiles clusteringBingling Wang, Yingxing Li, Wolfgang Karl Härdle — 2021