An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
type: Item
instance of: scholarly article
title: An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
zbMATH Open document ID: 1443.62183
author: K. Mahesh Kumar
author: A. Rama Mohan Reddy
published in: Information Sciences
publication date: 2020-07-16T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 62M20
zbMATH DE Number: 7221512
zbMATH Keywords: \(k\)-means clustering
zbMATH Keywords: \(kd\)-tree
zbMATH Keywords: initial cluster centers
zbMATH Keywords: knowledge discovery
describes a project that uses: k-means++
MaRDI profile type: Publication
full work available at URL: j.ins.2017.07.036
OpenAlex ID: W2740426009
cites work: Q2934696
cites work: Multidimensional binary search trees used for associative searching
cites work: Q3969900
cites work: A fast minimum spanning tree algorithm based on \(K\)-means
cites work: A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
cites work: Q4198056
cites work: Q4271995
cites work: Q4148820
cites work: Q3994557
cites work: Improvement of the \(k\)-means clustering filtering algorithm
cites work: The analysis of a simple k -means clustering algorithm
cites work: Least squares quantization in PCM
cites work: Q5617409
cites work: Point clustering via voting maximization
DOI: 10.1016/J.INS.2017.07.036
description: scientific article; zbMATH DE number 7221512