K*-Means: An Efficient Clustering Algorithm with Adaptive Decision Boundaries
- 9 November 2024
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 53 (1) , 1-27
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- K-means-G*: Accelerating k-means clustering algorithm utilizing primitive geometric conceptsInformation Sciences, 2022
- Hierarchical clustering supported by reciprocal nearest neighborsInformation Sciences, 2020
- A novel graph-based clustering method using noise cuttingInformation Systems, 2020
- A novel CNN based security guaranteed image watermarking generation scenario for smart city applicationsInformation Sciences, 2019
- A machine learning based approach for phishing detection using hyperlinks informationJournal of Ambient Intelligence and Humanized Computing, 2018
- A disease diagnosis and treatment recommendation system based on big data mining and cloud computingInformation Sciences, 2018
- Efficient agglomerative hierarchical clusteringExpert Systems with Applications, 2015
- Accelerating Lloyd’s Algorithm for k-Means Clustering2014
- Top 10 algorithms in data miningKnowledge and Information Systems, 2007
- Efficient algorithms for divisive hierarchical clustering with the diameter criterionJournal of Classification, 1991