| 基于路径的聚类分析 |
| |
| 引用本文： | 张开广,孟红玲,亢金轩. 基于路径的聚类分析[J]. 测绘科学技术学报, 2006, 23(2): 145-148 |
| |
| 作者姓名： | 张开广 孟红玲 亢金轩 |
| |
| 作者单位： | 郑州师范高等专科学校,河南,郑州,450044;信息工程大学,测绘学院,河南,郑州,450052;郑州师范高等专科学校,河南,郑州,450044;洛阳工业高等专科学校,河南,洛阳,471000 |
| |
| 摘 要： | 聚类分析的很多算法中都采用连接两点直线的欧氏距离来判断空间亲疏性,然而当有障碍物层存在时,连接两点的直线已不能完全表达它们之间的关系,特别是当有指定的交通路线时,两点之间的连通路径和距离必须遵从特定的路径.文中讨论在了障碍物或指定的交通路线存在的情况下点集的聚类分析,给出了解决有障碍物或指定交通路线时进行聚类分析的算法PathClust.
|
| 关 键 词： | 聚类分析 地址匹配 最佳路径 最佳距离 |
| 文章编号： | 1673-6338（2006）02-0145-04 |
| 收稿时间： | 2005-11-11 |
| 修稿时间： | 2006-01-28 |
Automatic Clustering of Point-Data Sets Based on Path |
| |
| ZHANG Kai-guang,MENG Hong-ling,KANG Jin-xuan. Automatic Clustering of Point-Data Sets Based on Path[J]. Journal of Zhengzhou Institute of Surveying and Mapping, 2006, 23(2): 145-148 |
| |
| Authors: | ZHANG Kai-guang MENG Hong-ling KANG Jin-xuan |
| |
| Affiliation: | 1 .Zhengzhou Teacher College, Zhengzhou 450044 ,China; 2 .Institute of Surveying and Mapping, Information Engineering University, Zhengzhou 450052 ,China; 3 .Luoyang College of Technology, Luoyang 471000 ,China |
| |
| Abstract: | Many clustering algorithms use the Euclidean However, when the layers of obstacles presented, the tions completely. Especially, when the transportation trace the some fixed path. PathClust is put forward to distance of two points to measure the spatial proximity, line linking the two points could not represent the rela network exists, the route linking the two points must realize the clustering of points in the presence of obstacles or the transportation networks. |
| |
| Keywords: | clustering analysis address geoeoding optimum route the shortest distance |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
