Algorithms for clustering data
Algorithms for clustering data
A Validity Measure for Fuzzy Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Validating fuzzy partitions obtained through c-shells clustering
Pattern Recognition Letters - Special issue on fuzzy set technology in pattern recognition
A linear iteration time layout algorithm for visualising high-dimensional data
Proceedings of the 7th conference on Visualization '96
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Fast multidimensional scaling through sampling, springs and interpolation
Information Visualization
Relational generalizations of cluster validity indices
IEEE Transactions on Fuzzy Systems
iVAT and aVAT: enhanced visual analysis for cluster tendency assessment
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Some new indexes of cluster validity
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Low-complexity fuzzy relational clustering algorithms for Web mining
IEEE Transactions on Fuzzy Systems
Visual Assessment of Clustering Tendency for Rectangular Dissimilarity Matrices
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Fuzzy Systems
Optimization of clustering criteria by reformulation
IEEE Transactions on Fuzzy Systems
Computing with words with the ontological self-organizing map
IEEE Transactions on Fuzzy Systems - Special section on computing with words
Hi-index | 0.00 |
Clustering aims to identify groups of similar objects. To evaluate the results of cluster algorithms, an investigator uses cluster-validity indices. While the theory of cluster validity is well established for vector object data, little effort has been made to extend it to relationship-based data. As such, this paper proposes a theory of reformulation for object-data validity indices so that they can be used to rank the results produced by the relational c-means clustering algorithms. More specifically, we create a class of relational validity indices, which is called dual-relational indices, that are guaranteed under certain, but easily met, constraints to produce the same results and, hence, the same cluster counts, as their object-data counterparts.