Feature Selection in Spectral Clustering
سال
: 2011
چکیده: Spectral clustering is a powerful technique in clustering specially when the structure of
data is not linear and classical clustering methods lead to fail. In this paper, we propose a
spectral clustering algorithm with a feature selection schema based on extracted features of
Kernel PCA. In the proposed algorithm, selecting appropriate vectors is dependent upon
entropy of clusters on these vectors and weighting method is influenced by sum of the
existence gap between clusters and entropy of the vectors. Tuning the parameters has a great
effect on the results of spectral clustering techniques. In the ideal case, comparing our
method with NJW and Kernel K-Means indicate the successful of the proposed algorithm.
data is not linear and classical clustering methods lead to fail. In this paper, we propose a
spectral clustering algorithm with a feature selection schema based on extracted features of
Kernel PCA. In the proposed algorithm, selecting appropriate vectors is dependent upon
entropy of clusters on these vectors and weighting method is influenced by sum of the
existence gap between clusters and entropy of the vectors. Tuning the parameters has a great
effect on the results of spectral clustering techniques. In the ideal case, comparing our
method with NJW and Kernel K-Means indicate the successful of the proposed algorithm.
کلیدواژه(گان): spectral clustering,kernel PCA,feature selection,entropy
کالکشن
:
-
آمار بازدید
Feature Selection in Spectral Clustering
Show full item record
contributor author | هادی صدوقی یزدی | en |
contributor author | سهیلا اشکذری طوسی | en |
contributor author | Hadi Sadoghi Yazdi | fa |
contributor author | Soheila Ashkezari Toussi | fa |
date accessioned | 2020-06-06T14:36:53Z | |
date available | 2020-06-06T14:36:53Z | |
date issued | 2011 | |
identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/3404085 | |
description abstract | Spectral clustering is a powerful technique in clustering specially when the structure of data is not linear and classical clustering methods lead to fail. In this paper, we propose a spectral clustering algorithm with a feature selection schema based on extracted features of Kernel PCA. In the proposed algorithm, selecting appropriate vectors is dependent upon entropy of clusters on these vectors and weighting method is influenced by sum of the existence gap between clusters and entropy of the vectors. Tuning the parameters has a great effect on the results of spectral clustering techniques. In the ideal case, comparing our method with NJW and Kernel K-Means indicate the successful of the proposed algorithm. | en |
language | English | |
title | Feature Selection in Spectral Clustering | en |
type | Journal Paper | |
contenttype | External Fulltext | |
subject keywords | spectral clustering | en |
subject keywords | kernel PCA | en |
subject keywords | feature selection | en |
subject keywords | entropy | en |
journal title | International Journal of Signal Processing, Image Processing and Pattern Recognition | fa |
pages | 179-194 | |
journal volume | 4 | |
journal issue | 3 | |
identifier link | https://profdoc.um.ac.ir/paper-abstract-1024082.html | |
identifier articleid | 1024082 |