Dimension reduction by local principal component analysis
Neural Computation
Mixtures of probabilistic principal component analyzers
Neural Computation
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Clustering incomplete relational data using the non-Euclidean relational fuzzy c-means algorithm
Pattern Recognition Letters
Local subspace learning by extended fuzzy c-medoids clustering
International Journal of Knowledge Engineering and Soft Data Paradigms
Low-complexity fuzzy relational clustering algorithms for Web mining
IEEE Transactions on Fuzzy Systems
Regularized Linear Fuzzy Clustering and Probabilistic PCA Mixture Models
IEEE Transactions on Fuzzy Systems
Modeling the manifolds of images of handwritten digits
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Relational fuzzy clustering has been developed for extracting intrinsic cluster structures of relational data and was extended to a linear fuzzy clustering model based on Fuzzy c-Medoids (FCMdd) concept, in which Fuzzy c-Means-(FCM-) like iterative algorithm was performed by defining linear cluster prototypes using two representative medoids for each line prototype. In this paper, the FCMdd-type linear clustering model is further modified in order to handle incomplete data including missing values, and the applicability of several imputation methods is compared. In several numerical experiments, it is demonstrated that some pre-imputation strategies contribute to properly selecting representative medoids of each cluster.