Improved possibilistic C-means clustering algorithms

Jiang She Zhang; Yiu Wing Leung

doi:10.1109/TFUZZ.2004.825079

Improved possibilistic C-means clustering algorithms

Jiang She Zhang^*, Yiu Wing Leung

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Journal article › peer-review

161 Citations (Scopus)

Abstract

A possibilistic approach was proposed in a previous paper for C-means clustering, and two algorithms realizing this approach were reported in two previous papers. Although the possibilistic approach is sound, these two algorithms tend to find identical clusters. In this paper, we modify and improve these algorithms to overcome their shortcoming. The numerical results demonstrate that the improved algorithms can determine proper clusters and they can realize the advantages of the possibilistic approach.

Original language	English
Pages (from-to)	209-217
Number of pages	9
Journal	IEEE Transactions on Fuzzy Systems
Volume	12
Issue number	2
DOIs	https://doi.org/10.1109/TFUZZ.2004.825079
Publication status	Published - Apr 2004

Scopus Subject Areas

Control and Systems Engineering
Computational Theory and Mathematics
Artificial Intelligence
Applied Mathematics

User-Defined Keywords

Approach
C-means
Clustering
Possibilistic

Access to Document

10.1109/TFUZZ.2004.825079

Cite this

@article{0ff542bcf41c4f9d92cb6f28674d6755,

title = "Improved possibilistic C-means clustering algorithms",

abstract = "A possibilistic approach was proposed in a previous paper for C-means clustering, and two algorithms realizing this approach were reported in two previous papers. Although the possibilistic approach is sound, these two algorithms tend to find identical clusters. In this paper, we modify and improve these algorithms to overcome their shortcoming. The numerical results demonstrate that the improved algorithms can determine proper clusters and they can realize the advantages of the possibilistic approach.",

keywords = "Approach, C-means, Clustering, Possibilistic",

author = "Zhang, {Jiang She} and Leung, {Yiu Wing}",

note = "Funding Information: Manuscript received February 28, 2000; revised July 13, 2001, September 18, 2002, and July 14, 2003. This work was supported by the Hong Kong Baptist University Faculty Research Grant, NSFC Project 60075001, and High-Tech R&D (863) 2001AA113 182. J.-S. Zhang is with the Department of Information Science, Xi{\textquoteright}an Jiaotong University, 710049 Xi{\textquoteright}an, China. Y.-W. Leung is with the Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong. Digital Object Identifier 10.1109/TFUZZ.2004.825079",

year = "2004",

month = apr,

doi = "10.1109/TFUZZ.2004.825079",

language = "English",

volume = "12",

pages = "209--217",

journal = "IEEE Transactions on Fuzzy Systems",

issn = "1063-6706",

publisher = "IEEE",

number = "2",

}

TY - JOUR

T1 - Improved possibilistic C-means clustering algorithms

AU - Zhang, Jiang She

AU - Leung, Yiu Wing

N1 - Funding Information: Manuscript received February 28, 2000; revised July 13, 2001, September 18, 2002, and July 14, 2003. This work was supported by the Hong Kong Baptist University Faculty Research Grant, NSFC Project 60075001, and High-Tech R&D (863) 2001AA113 182. J.-S. Zhang is with the Department of Information Science, Xi’an Jiaotong University, 710049 Xi’an, China. Y.-W. Leung is with the Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong. Digital Object Identifier 10.1109/TFUZZ.2004.825079

PY - 2004/4

Y1 - 2004/4

N2 - A possibilistic approach was proposed in a previous paper for C-means clustering, and two algorithms realizing this approach were reported in two previous papers. Although the possibilistic approach is sound, these two algorithms tend to find identical clusters. In this paper, we modify and improve these algorithms to overcome their shortcoming. The numerical results demonstrate that the improved algorithms can determine proper clusters and they can realize the advantages of the possibilistic approach.

AB - A possibilistic approach was proposed in a previous paper for C-means clustering, and two algorithms realizing this approach were reported in two previous papers. Although the possibilistic approach is sound, these two algorithms tend to find identical clusters. In this paper, we modify and improve these algorithms to overcome their shortcoming. The numerical results demonstrate that the improved algorithms can determine proper clusters and they can realize the advantages of the possibilistic approach.

KW - Approach

KW - C-means

KW - Clustering

KW - Possibilistic

UR - http://www.scopus.com/inward/record.url?scp=1942532748&partnerID=8YFLogxK

U2 - 10.1109/TFUZZ.2004.825079

DO - 10.1109/TFUZZ.2004.825079

M3 - Journal article

AN - SCOPUS:1942532748

SN - 1063-6706

VL - 12

SP - 209

EP - 217

JO - IEEE Transactions on Fuzzy Systems

JF - IEEE Transactions on Fuzzy Systems

IS - 2

ER -

Improved possibilistic C-means clustering algorithms

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this