Highly Sparse Reductions to Kernel Spectral Clustering
نویسندگان
چکیده
Kernel spectral clustering is a model-based spectral clustering method formulated in a primal-dual framework. It has a powerful out-of-sample extension property and a model selection procedure based on the balanced line fit criterion. This paper is an improvement of a previous work which sparsified the kernel spectral clustering method using the line structure of the data projections in the eigenspace. However, the previous method works only in the case of well formed and well separated clusters as in other cases the line structure is lost. In this paper, we propose two highly sparse extensions of kernel spectral clustering that can overcome these limitations. For the selection of the reduced set we use the concept of angles between the data projections in the eigenspace. We show the effectiveness and the amount of sparsity obtained by the proposed methods for several synthetic and real world datasets.
منابع مشابه
Highly sparse kernel spectral clustering with predictive out-of-sample extensions
Kernel spectral clustering has been formulated as a primal dual optimization setting allowing natural extensions to out-of-sample data together with model selection in a learning framework which is important for obtaining a good generalization performance. In this paper, we propose a new sparse method for kernel spectral clustering. The approach exploits the structure of the eigenvectors and th...
متن کاملتجزیه ی تُنُک تصاویر ابرطیفی با استفاده از یک کتابخانه ی طیفی هرس شده
Spectral unmixing of hyperspectral images is one of the most important research fields in remote sensing. Recently, the direct use of spectral libraries in spectral unmixing is on increase. In this way which is called sparse unmixing, we do not need an endmember extraction algorithm and the number determination of endmembers priori. Since spectral libraries usually contain highly correlated s...
متن کاملAn improved spectral clustering algorithm based on local neighbors in kernel space
Similarity matrix is critical to the performance of spectral clustering. Mercer kernels have become popular largely due to its successes in applying kernel methods such as kernel PCA. A novel spectral clustering method is proposed based on local neighborhood in kernel space (SC-LNK), which assumes that each data point can be linearly reconstructed from its neighbors. The SC-LNK algorithm tries ...
متن کاملLearning the kernel matrix by resampling
In this abstract paper, we introduce a new kernel learning method by a nonparametric density estimator. The estimator consists of a group of k-centroids clusterings. Each clustering randomly selects data points with randomly selected features as its centroids, and learns a one-hot encoder by one-nearest-neighbor optimization. The estimator generates a sparse representation for each data point. ...
متن کاملKernel Spectral Clustering and applications
In this chapter we review the main literature related to kernel spectral clustering (KSC), an approach to clustering cast within a kernel-based optimization setting. KSC represents a least-squares support vector machine based formulation of spectral clustering described by a weighted kernel PCA objective. Just as in the classifier case, the binary clustering model is expressed by a hyperplane i...
متن کامل