K-Means Algorithm Based on Synthetic Weighting of AHP and CRITIC
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    The traditional K-means algorithm is regarded that the attributes of swatches have the same effect on the clustering analysis. Based on AHP and CRITIC, comprehensive weighting of K-means clustering algorithm is proposed to solve the problem in this paper. First, each of attribute weight is calculated by CV-K-means method, thus judgment matrix is determined by comparing the two.Then, according to the analytic hierarchy process subjective weights of attributes is determined. And using the CRITIC method the objective weight of each attribute is determined, difference coefficient method is used to determine coefficient of combination. The experimental results show that the algorithm accuracy is higher than the traditional K-means algorithm.

    Reference
    Related
    Cited by
Get Citation

丁晓琴,张德生.基于AHP和CRITIC综合赋权的K-means算法.计算机系统应用,2016,25(7):182-186

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 24,2015
  • Revised:January 07,2016
  • Adopted:
  • Online: July 21,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