An Initialization Method Based on Hybrid Distance for k-Means Algorithm
DOI10.1162/NECO_A_01014zbMATH Open1418.62260DBLPjournals/neco/YangMZLZ17OpenAlexW2759884981WikidataQ47623209 ScholiaQ47623209MaRDI QIDQ5380869FDOQ5380869
Authors: Jie Yang, Yan Ma, Xiangfen Zhang, Shunbao Li, Yuping Zhang 
Publication date: 6 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_01014
Recommendations
- scientific article; zbMATH DE number 7267213
- A survey on the initialization methods for the $k$-means algorithm
- An initialization method for the \(K\)-means algorithm using neighborhood model
- A new initialization and performance measure for the rough \(k\)-means clustering
- A \(K\)-means clustering algorithm based on a novel approach for improved initial seeds
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Metric spaces, metrizability (54E35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clustering to minimize the maximum intercluster distance
- Data Clustering: Theory, Algorithms, and Applications
- Data mining and knowledge discovery with evolutionary algorithms
- An initialization method for the \(K\)-means algorithm using neighborhood model
- Initialization of \(K\)-modes clustering using outlier detection techniques
Cited In (14)
- A Max-Min clustering method for \(k\)-means algorithm of data clustering
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
- An effective \(k\)-means algorithm based on local density
- On \(K\)-means algorithm with the use of Mahalanobis distances
- Clustering parameters selection algorithm based on density for divisional clustering process
- A robust algorithm for cluster initialization using uniform effect of \(k\)-means
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- A decision cluster classifier based on agglomerative \(K\)-means
- An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
- An new initialization method for fuzzy c-means algorithm based on density
- An initialization method for the \(K\)-means algorithm using neighborhood model
- CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
- A spectral method of \(K\)-means initialization
- Adaptive initialization method based on spatial local information for \(k\)-means algorithm
Uses Software
This page was built for publication: An Initialization Method Based on Hybrid Distance for k-Means Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380869)
