Sequential fuzzy cluster extraction by a graph spectral method
Pattern Recognition Letters
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cluster analysis based in fuzzy relations
Fuzzy Sets and Systems - Special issue on clustering and learning
Fuzzy Clustering Models and Applications
Fuzzy Clustering Models and Applications
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science)
Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science)
On relational possibilistic clustering
Pattern Recognition
Note: Resistance distance and the normalized Laplacian spectrum
Discrete Applied Mathematics
A tutorial on spectral clustering
Statistics and Computing
Establishing performance evaluation structures by fuzzy relation-based cluster analysis
Computers & Mathematics with Applications
A method of relational fuzzy clustering based on producing feature vectors using FastMap
Information Sciences: an International Journal
Robust fuzzy clustering of relational data
IEEE Transactions on Fuzzy Systems
A Possibilistic Fuzzy c-Means Clustering Algorithm
IEEE Transactions on Fuzzy Systems
Enhancing community detection using a network weighting strategy
Information Sciences: an International Journal
Maximizing modularity intensity for community partition and evolution
Information Sciences: an International Journal
Hi-index | 0.07 |
An additive spectral method for fuzzy clustering is proposed. The method operates on a clustering model which is an extension of the spectral decomposition of a square matrix. The computation proceeds by extracting clusters one by one, which makes the spectral approach quite natural. The iterative extraction of clusters, also, allows us to draw several stopping rules to the procedure. This applies to several relational data types differently normalized: network structure data (the first eigenvector subtracted), affinity between multidimensional vectors (the pseudo-inverse Laplacian transformation), and conventional relational data including in-house data of similarity between research topics according to working of a research center. The method is experimentally compared with several classic and recent techniques and shown to be competitive.