Projected Gustafson-Kessel Clustering Algorithm and Its Convergence

DOI10.1007/978-3-642-21563-6_9zbMath1305.68146OpenAlexW56819399MaRDI QIDQ3019860

Charu Puri, Naveen Kumar

Publication date: 29 July 2011

Published in: Transactions on Rough Sets XIV (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21563-6_9

zbMATH Keywords

convergencerough setshigh dimensional datasubspace clusteringvalidity measuresGustafson-Kessel algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Uses Software

• clusfind

Cites Work

• Clustering and feature selection using sparse principal component analysis
• A rough fuzzy approach to web usage categorization
• Data mining. Concepts and techniques
• Local convergence of the fuzzy c-means algorithms
• Interval set clustering of web users with rough \(K\)-means
• A convergence theorem for the fuzzy subspace clustering (FSC) algorithm
• Evolutionary Rough k-Medoid Clustering
• Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
• A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
• Detection and Characterization of Cluster Substructure I. Linear Structure: Fuzzy c-Lines
• Finding Groups in Data
• Association Reducts: A Framework for Mining Multi-attribute Dependencies
• Computational Intelligence
• A new approach to clustering
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Projected Gustafson-Kessel Clustering Algorithm and Its Convergence