Electronic Science and Technology ›› 2019, Vol. 32 ›› Issue (11): 70-73.doi: 10.16180/j.cnki.issn1007-7820.2019.11.014

Previous Articles     Next Articles

A High Dimensional Data Clustering Algorithm Combining Greedy Selection and Feature Weighting

XIANG Zhihua,SHAO Yali   

  1. School of Information Technology,Guangdong Polytechnic College,Zhaoqing 526100, China
  • Received:2017-11-30 Online:2019-11-15 Published:2019-11-15
  • Supported by:
    Science and Technology Project of Guangdong Education Department(201713720010)

Abstract:

In order to solve the problem that traditional clustering algorithms can not cluster high-dimensional data, a high-dimensional data clustering algorithm combining greedy selection and feature weighting was proposed. By clustering one-dimensional feature data, the clustering results of one-dimensional data were obtained first, and then all dimension data were clustered by adding dimension clustering weights to achieve clustering of high-dimensional data. The results showed that the algorithm can accurately cluster sparse high-dimensional data samples and meet the needs of high-dimensional data clustering processing, and had good practical application value.

Key words: greedy strategy, feature weighting, clustering, high-dimensional data, Mean shift

CLC Number: 

  • TP392