An efficient k-means clustering filtering algorithm using density based initial cluster centers
From MaRDI portal
Publication:780930
DOI10.1016/J.INS.2017.07.036zbMATH Open1443.62183OpenAlexW2740426009MaRDI QIDQ780930FDOQ780930
K. Mahesh Kumar, A. Rama Mohan Reddy
Publication date: 16 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.07.036
Recommendations
- A \(K\)-means clustering algorithm based on a novel approach for improved initial seeds
- An Initialization Method Based on Hybrid Distance for k-Means Algorithm
- Adaptive initialization method based on spatial local information for \(k\)-means algorithm
- Improvement of the \(k\)-means clustering filtering algorithm
- A robust algorithm for cluster initialization using uniform effect of \(k\)-means
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inference from stochastic processes and prediction (62M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Least squares quantization in PCM
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Point clustering via voting maximization
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- Multidimensional binary search trees used for associative searching
- Title not available (Why is that?)
- A fast minimum spanning tree algorithm based on \(K\)-means
- The analysis of a simple k -means clustering algorithm
- Improvement of the \(k\)-means clustering filtering algorithm
Cited In (2)
Uses Software
This page was built for publication: An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780930)
