Semi-Supervised K-Means Clustering Algorithm for Multi-Type Relational Data
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    A semi-supervised K-means clustering algorithm for multi-type relational data is proposed, which extends traditional K-means clustering by new methods of selecting initial clusters and similarity measures, so that it can semi-supervise cluster multi-type relational data. In order to achieve high performance, in the algorithm, besides attribute information, both labeled data and relationship information are employed. Experimental results on Movie database show the effectiveness of this method.

    Reference
    Related
    Cited by
Get Citation

高 滢,刘大有,齐 红,刘 赫.一种半监督K均值多关系数据聚类算法.软件学报,2008,19(11):2814-2821

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 19,2008
  • Revised:August 26,2008
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063