K-Hub Clustering Algorithm Based on Active Learning
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    K-Hub is an efficient high-dimensional data clustering algorithm, but it is sensitive to the choice of initial clustering centers and the instances which besides the class border may not be correctly clustered. In order to solve these problems, an improved method which incorporates active learning and semi-supervised clustering into K-Hub clustering algorithm is proposed. It uses active learning strategy to study pairwise constraints, and then, it uses these pairwise constraints to guide the clustering process of K-Hub. The experiment results demonstrate that the improved method can enhance the performance of K-Hub clustering algorithm.

    Reference
    Related
    Cited by
Get Citation

封建邦,何振峰.基于主动学习的K-Hub聚类算法.计算机系统应用,2016,25(3):187-193

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 05,2015
  • Revised:September 08,2015
  • Adopted:
  • Online: March 17,2016
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063