Research on domain-specific features clustering based spectral clustering

  • Authors:
  • Xiquan Yang;Meijia Wang;Lin Fang;Lin Yue;Yinghua Lv

  • Affiliations:
  • School of Computer Science and Information Technology, Northeast Normal University, Changchun, Jilin, P.R. China;School of Computer Science and Information Technology, Northeast Normal University, Changchun, Jilin, P.R. China;School of Computer Science and Information Technology, Northeast Normal University, Changchun, Jilin, P.R. China;School of Computer Science and Information Technology, Northeast Normal University, Changchun, Jilin, P.R. China;School of Computer Science and Information Technology, Northeast Normal University, Changchun, Jilin, P.R. China

  • Venue:
  • ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Domain-Specific features clustering aims to cluster the features from related domains into K clusters. Although traditional clustering algorithms can be used to domain-specific features clustering, the performance may not good as the features have little inter-connection in related domains. In this paper, we develop a solution that uses the domain-independent feature as a bridge to connect the domain-specific features. And we use spectral clustering to cluster the domain-specific features into K clusters. We present theoretical analysis to show that our algorithm is able to produce high quality clusters. The experimental results show that our algorithm improves the clustering performance over the traditional algorithms.