Rough K-means cluster with adaptive parameters

Tao Zhou, Yan Ning Zhang, H. E.Jing Yuan, Hui Ling Lu

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

7 Scopus citations

Abstract

In this paper, we firstly analyze Lingras' algorithm with respect to its objective-function, numerical stability of the clusters. Then we point out its shortcoming in adjusting the three coefficients Wl , Wu and ∈. To tackle this problem, a rough k-means clustering method is Anally presented with adaptive parameters. This algorithm is used in a testing sample and obtains a less error clustering rate.

Original languageEnglish
Title of host publicationProceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
Pages3063-3068
Number of pages6
DOIs
StatePublished - 2007
Event6th International Conference on Machine Learning and Cybernetics, ICMLC 2007 - Hong Kong, China
Duration: 19 Aug 200722 Aug 2007

Publication series

NameProceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
Volume6

Conference

Conference6th International Conference on Machine Learning and Cybernetics, ICMLC 2007
Country/TerritoryChina
CityHong Kong
Period19/08/0722/08/07

Keywords

  • Adaptive parameters
  • Clustering algorithm
  • Rough k-means
  • Rough sets

Fingerprint

Dive into the research topics of 'Rough K-means cluster with adaptive parameters'. Together they form a unique fingerprint.

Cite this