Computer Science ›› 2010, Vol. 37 ›› Issue (9): 187-189.
Previous Articles Next Articles
SHI Heng-liang,LIU Chuan-ling,BAI Guang-yi, TANG Zhen-min
Online:
Published:
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
SHI Heng-liang,LIU Chuan-ling,BAI Guang-yi, TANG Zhen-min. Self-adaptable Granularity Road Network Moving Objects' Clustering Algorithm[J].Computer Science, 2010, 37(9): 187-189.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2010/V37/I9/187
Cited