Convex-set-based fuzzy clustering
- Authors
- Suh, Il hong; Kim, Jae hyun; Rhee, Frank chung hoon
- Issue Date
- Jun-1999
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- convex sets; FCM; fuzzy clustering; PCM
- Citation
- IEEE TRANSACTIONS ON FUZZY SYSTEMS, v.7, no.3, pp.271 - 285
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON FUZZY SYSTEMS
- Volume
- 7
- Number
- 3
- Start Page
- 271
- End Page
- 285
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46997
- DOI
- 10.1109/91.771084
- ISSN
- 1063-6706
- Abstract
- Prototype-based methods are commonly used in duster analysis and the results mag be highly dependent on the prototype used. In this paper, we propose a two-level fuzzy clustering method that involves adaptively expanding and merging convex polytopes, where the convex polytopes are considered as a "flexible" prototype. Therefore, the dependency on the use of a specified prototype can be eliminated, Also, the proposed method makes it possible to effectively represent an arbitrarily distributed data set without a priori knowledge of the number of clusters in the data set. In the first level of our proposed method, each cluster is represented by a convex polytope which is described by its set of vertices, Specifically, nonlinear membership functions are utilized to determine whether an input pattern creates a new cluster or whether an existing cluster should be modified. In the second level, the expandable clusters that are selected by an intercluster distance measure are merged to improve clustering efficiency and to reduce the order dependency of the incoming input patterns. Several experimental results are given to show the validity of our method.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.