Algorithms for clustering data
Algorithms for clustering data
Symbolic clustering using a new dissimilarity measure
Pattern Recognition
Agglomerative clustering of symbolic objects using the concepts of both similarity and dissimilarity
Pattern Recognition Letters
Multidimensional scaling of interval-valued dissimilarity data
Pattern Recognition Letters
Query dependent ranking using K-nearest neighbor
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Hi-index | 0.00 |
In this paper, a novel similarity measure for estimating the degree of similarity between two symbolic patterns, the features of which are of interval type is proposed. A method for clustering data patterns based on the mutual similarity value (MSV) and the concept of k-mutual nearest neighbourhood is explored. The concept of mutual nearest neighbourhood exploits the mutual closeness possessed by the patterns for clustering thereby providing the naturalistic proximity characteristics of the patterns. Experiments on various datasets have been conducted in order to study the efficacy of the proposed methodology.