Improved K-Means Traffic Data Clustering Based on Mutual Information and Divergence
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    K-means algorithm is a commonly used clustering algorithm and has been applied to traffic hotspot extraction. However, due to the number of clusters and the subjective setting of the initial clustering center, the traffic hotspots extracted by the existing clustering methods are often difficult to meet the requirements. Based on mutual information and divergence, an improved SK-means algorithm is proposed and applied to traffic hotspot extraction. In the proposed method, an initial clustering center is found based on mutual information between different points. In addition, the number of clusters is determined based on the ratio of mutual information and divergence. The proposed method is applied to the extraction of traffic hotspots in Chengdu for a certain period of time, and compared with the traditional K-means, the experimental results show that the proposed method has higher clustering accuracy and the extracted hotspots are more realistic.

    Reference
    Related
    Cited by
Get Citation

徐文进,许瑶,解钦.基于互信息和散度改进K-Means在交通数据聚类中的应用.计算机系统应用,2020,29(1):171-175

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 21,2019
  • Revised:July 04,2019
  • Adopted:
  • Online: December 30,2019
  • Published: January 15,2020
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