基于仿射传播的道路网络聚类 |
| |
引用本文: | 史加荣,王建国,王玉英.基于仿射传播的道路网络聚类[J].数学建模及其应用,2012,1(4):20-23. |
| |
作者姓名: | 史加荣 王建国 王玉英 |
| |
摘 要: | 对于道路网络聚类问题,提出了仿射传播算法。首先,将道路网络上的交叉路口和结点作为顶点,建立了无向图;然后,根据最短路径计算网络距离,进而得到图的相似度矩阵;并基于仿射传播算法对道路网络进行聚类;最后,试验结果证实了本文方法的有效性与稳定性。
|
关 键 词: | 道路网络 聚类 仿射传播 最短路径 |
Road Network Clustering Based on Affinity Propagation |
| |
Authors: | Shi Jiarong Wang Jianguo and Wang Yuying |
| |
Abstract: | An affinity propagation algorithm is proposed for the road network clustering problem. First, an undirected graph is constructed through regarding intersections and nodes as vertices. Second, the network distances are computed by the shortest paths and they are transformed the similarity metric. Next, the road network is clustered according to the affinity propagation. Finally, experimental results demonstrate the effectiveness and stability. |
| |
Keywords: | road network clustering affinity propagation shortest path |
|
| 点击此处可从《数学建模及其应用》浏览原始摘要信息 |
| 点击此处可从《数学建模及其应用》下载免费的PDF全文 |