计算机科学 ›› 2010, Vol. 37 ›› Issue (9): 187-189.

• 数据库与数据挖掘 • 上一篇    下一篇

自适应粒度的道路移动对象聚类算法

史恒亮,刘传领,白光一,唐振民   

  1. (南京理工大学计算机学院 南京210094);(河南科技大学电信学院;洛阳471003);(方舟信息技术(苏州)有限公司 苏州215021)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金项目(90820306)资助。

Self-adaptable Granularity Road Network Moving Objects' Clustering Algorithm

SHI Heng-liang,LIU Chuan-ling,BAI Guang-yi, TANG Zhen-min   

  • Online:2018-12-01 Published:2018-12-01

摘要: 以往的聚类算法能够减少道路交通网络中移动对象与中心数据库的通信开销,但聚类粒度的大小是根据经验设定的。分析了影响距离聚类粒度大小的因素,提出用PP网络来训练历史数据,动态地获取距离聚类粒度值和时间粒度值,并把这些粒度值作为新的历史数据来训练网络,使得粒度值能够根据道路交通网络中因素的改变而动态改变,从而产生有效的道路网络聚类,减少通信开销,并预报道路交通的拥堵情况,为最优路径规划提供依据。

关键词: BP网络,自适应粒度,道路交通网络,移动对象,聚类算法

Abstract: Although previous clustering algorithms can reduce the communication cost between moving objects and central database in road traffic network, the clustering granularity is set by experiences. hhis paper analysed the influence factors on clustering distance granularity, and introduced a novel method to train historical data with I3P network, and then got clustering distance granularity and clustering time granularity dynamically. Being new historical data, these granularity values can be made to train BP network further. This network can self-adapt in respect of influence factors dynamically, and birth efficient clustering granularity values to reduce communication cost, and forecast traffic jams as optimal route planning's observation.

Key words: BP network, Self-adaptable granularity, Road-traffic network, Moving objects, Clustering algorithm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!