A Self-adaptive Spectral Clustering Based on Geodesic Distance and Shared Nearest Neighbors
نویسندگان
چکیده
Spectral clustering is a method of subspace clustering which is suitable for the data of any shape and converges to global optimal solution. By combining concepts of shared nearest neighbors and geodesic distance with spectral clustering, a self-adaptive spectral clustering based on geodesic distance and shared nearest neighbors was proposed. Experiments show that the improved spectral clustering algorithm can fully take into account the information of neighbors, but also measure the exact distance and better process the geodetic data.
منابع مشابه
An Adaptive Spectral Clustering Algorithm Based on the Importance of Shared Nearest Neighbors
The construction of a similarity matrix is one significant step for the spectral clustering algorithm; while the Gaussian kernel function is one of the most common measures for constructing the similarity matrix. However, with a fixed scaling parameter, the similarity between two data points is not adaptive and appropriate for multi-scale datasets. In this paper, through quantitating the value ...
متن کاملGeometry-Aware Neighborhood Search for Learning Local Models for Image Reconstruction
Local learning of sparse image models has proven to be very effective to solve inverse problems in many computer vision applications. To learn such models, the data samples are often clustered using the K-means algorithm with the Euclidean distance as a dissimilarity metric. However, the Euclidean distance may not always be a good dissimilarity measure for comparing data samples lying on a mani...
متن کاملClustering Using Shared Reference Points Algorithm Based On a Sound Data Model
A novel clustering algorithm CSHARP is presented for the purpose of finding clusters of arbitrary shapes and arbitrary densities in high dimensional feature spaces. It can be considered as a variation of the Shared Nearest Neighbor algorithm (SNN), in which each sample data point votes for the points in its k-nearest neighborhood. Sets of points sharing a common mutual nearest neighbor are cons...
متن کاملISOLLE: LLE with geodesic distance
We propose an extension of the algorithm for nonlinear dimensional reduction locally linear embedding (LLE) based on the usage of the geodesic distance (ISOLLE). In LLE, each data point is reconstructed from a linear combination of its n nearest neighbors, which are typically found using the Euclidean distance. We show that the search for the neighbors performed with respect to the geodesic dis...
متن کاملGeodesic Clustering
We propose a new class of distances for the purpose of data clustering, called the geodesic distance, and introduce a geodesic extension of K-medoids algorithm. We analyze the theoretical properties of the geodesic distance within a clustering framework and prove that the geodesic K-medoids algorithm converges to the correct clustering assignment in the asymptotic regime, even in the presence o...
متن کامل