An efficient k-means clustering filtering algorithm using density based initial cluster centers-Reference-Cited by-同舟云学术

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

Published:2017-12 Issue: Volume:418-419 Page:286-301
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Kumar K. Mahesh,Reddy A. Rama Mohan

Funder

Department of Higher Education

Ministry of Human Resource Development

MHRD

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference42 articles.

1. An efficient k-means clustering algorithm;Alsabti,1998

2. k-means++: the advantages of careful seeding.;Arthur,2007

3. Multidimensional binary search trees used for associative searching;Bentley;Comm. ACM,1975

4. Pattern Recognition with Fuzzy Objective Function Algorithms;Bezdek,1981

5. Refining initial points for K-means clustering;Bradley,1998

Cited by 69 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Appraisal of Urban Waterlogging and Extent Damage Situation after the Devastating Flood;Water Resources Management;2024-06-08

2. K-NNDP: K-means algorithm based on nearest neighbor density peak optimization and outlier removal;Knowledge-Based Systems;2024-06

3. An innovative model of personalized product service system (PPSS) for open community collaborative supply (OCCS): Selection, configuration, and optimization;Journal of Cleaner Production;2024-01

4. Unraveling Mixtures: A Novel Underdetermined Blind Source Separation Approach via Sparse Component Analysis;IEEE Access;2024

5. Distance-weighted K-means Clustering Algorithm Based on Local Density;Proceedings of the 4th International Conference on Artificial Intelligence and Computer Engineering;2023-11-17