Local subspace learning by extended fuzzy c-medoids clustering

Authors:
N. Haga;K. Honda;A. Notsu;H. Ichihashi
Affiliations:
Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, Osaka, 599-8531, Japan.;Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, Osaka, 599-8531, Japan.;Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, Osaka, 599-8531, Japan.;Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, Osaka, 599-8531, Japan
Venue:
International Journal of Knowledge Engineering and Soft Data Paradigms
Year:
2010

Citing 4
Cited 1

Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
Low-complexity fuzzy relational clustering algorithms for Web mining

IEEE Transactions on Fuzzy Systems
Linear fuzzy clustering techniques with missing values and their application to local principal component analysis

IEEE Transactions on Fuzzy Systems
Regularized Linear Fuzzy Clustering and Probabilistic PCA Mixture Models

IEEE Transactions on Fuzzy Systems

A comparative study on TIBA imputation methods in FCMdd-based linear clustering with relational data

Advances in Fuzzy Systems - Special issue on Fuzzy Functions, Relations, and Fuzzy Transforms: Theoretical Aspects and Applications to Fuzzy Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear fuzzy clustering is a technique for extracting linear-shape clusters, in which the fuzzy c-means (FCM)-like iterative procedure is performed with the prototypes of linear varieties, and is also regarded as a local subspace learning method. In fuzzy c-medoids (FCMdd), cluster prototypes are selected from data samples and clustering criteria are calculated by using only mutual distances among samples. Then, it is applicable to relational data clustering. This paper proposes an extended FCMdd approach for linear fuzzy clustering of relational data, which uses multiple representative objects (medoids) for representing prototypes. In the algorithm, new prototype is given by solving a combinatorial optimisation problem for searching medoids and the computational complexity is reduced by searching only from a subset of objects having large membership values. The information summarisation approach can be regarded as a multicluster-type multidimensional scaling for summarising data in multiple low-dimensional feature spaces.