An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers

DOI10.1016/j.ins.2017.07.036zbMath1443.62183OpenAlexW2740426009MaRDI QIDQ780930

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

zbMATH Keywords

knowledge discovery\(k\)-means clustering\(kd\)-treeinitial cluster centers

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (2)

Qualitative properties of the minimum sum-of-squares clustering problem ⋮ \(k\)-Mnv-Rep: a \(k\)-type clustering algorithm for matrix-object data

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point clustering via voting maximization
• A fast minimum spanning tree algorithm based on \(K\)-means
• Improvement of the \(k\)-means clustering filtering algorithm
• Multidimensional binary search trees used for associative searching
• Least squares quantization in PCM
• The analysis of a simple k -means clustering algorithm
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

This page was built for publication: An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers