Skip to main navigation Skip to search Skip to main content

An expanding clustering algorithm based on density searching

  • Liguo Tan*
  • , Yang Liu
  • , Xinglin Chen
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Most clustering algorithms need to preset the initial parameters which affect the performance of clustering very much. To solve this problem, a new method is proposed, which determine the center points of clustering by density-searching according to the universality of the Gaussian distribution. After the center was obtained, the cluster expands based on the correlation coefficient between clusters and the membership of the samples until the terminating condition is met. The experimental results show that this method could classify the samples of Gaussian distribution with different degree of overlap accurately. Compared with the fuzzy c-means algorithm, the proposed method is more accurate and timesaving when applied to the Iris data and Fossil data.

Original languageEnglish
Title of host publicationInformation and Management Engineering - International Conference, ICCIC 2011, Proceedings
Pages110-116
Number of pages7
EditionPART 6
DOIs
StatePublished - 2011
Event2011 International Conference on Computing, Information and Control, ICCIC 2011 - Wuhan, China
Duration: 17 Sep 201118 Sep 2011

Publication series

NameCommunications in Computer and Information Science
NumberPART 6
Volume236 CCIS
ISSN (Print)1865-0929

Conference

Conference2011 International Conference on Computing, Information and Control, ICCIC 2011
Country/TerritoryChina
CityWuhan
Period17/09/1118/09/11

Keywords

  • Algorithm
  • clustering
  • clustering center
  • density searching

Fingerprint

Dive into the research topics of 'An expanding clustering algorithm based on density searching'. Together they form a unique fingerprint.

Cite this