Analytically tractable case of fuzzy c-means clustering

DOI10.1016/j.patcog.2005.06.005zbMath1079.68609OpenAlexW2074389556MaRDI QIDQ2573638

Oleg S. Pianykh

Publication date: 22 November 2005

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2005.06.005

zbMATH Keywords

ClusteringHankel matrixOptimizationFuzzy c-means

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items

Unsupervised minor prototype detection using an adaptive population partitioning algorithm, The structural clustering and analysis of metric based on granular space, PATTERN RECOGNITION OF LONGITUDINAL TRIAL DATA WITH NONIGNORABLE MISSINGNESS: AN EMPIRICAL CASE STUDY

Uses Software

• LAPACK
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local convergence of the fuzzy c-means algorithms
• How bad are Hankel matrices?
• Mathematical classification and clustering
• LAPACK Users' Guide
• Finding Groups in Data
• Printer graphics for clustering
• Eigenvalue Locations of Generalized Companion Predictor Matrices
• A Stable Numerical Method for Inverting Shape from Moments
• Conditioning of Rectangular Vandermonde Matrices with Nodes in the Unit Disk
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters