基于道路网络的对象聚类-软件学报.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.18, No.2, February 2007, pp.332−344 DOI: 10.1360/jos180332 Tel/Fax: +86-10 © 2007 by Journal of Software . All rights reserved. ∗ + , , ( , 100872) Clustering Objects in a Road Network + CHEN Ji-Dong , MENG Xiao-Feng, LAI Cai-Feng (Information School, Renmin University of China, Beijing 100872, China) + Corresponding author: Phn: +86-10 Fax: +86-10 E-mail: chenjd@, Chen JD, Meng XF, Lai CF. Clustering objects in a road network. Journal of Software, 2007,18(2):332−344. /1000-9825/18/332.htm Abstract : Most spatial clustering algorithms deal with the objects in Euclidean space. In many real applications, however, the accessibility of spatial objects is constrained by spatial networks (e.g. road network). It is therefore more realistic to work on clustering objects in a road network. The distance metric in such setting is redefined by the network distance, which has to be computed by the expensive shortest path distance over the network. The existing methods are not applicable to such cases. Therefore, by exploiting unique features of road networks, two new clustering algorithms are presented, which use the information of nodes and edges in the network to prune the search space and avoid some unnecessary distance computations. The experimental results indicate that the algorithms achieve high efficiency for clustering objects in real road network. Key words: data mining; clustering; road network; spatial object; network distance; shortest path : ., (),,. ,, .,. ,. , . : ;;; ;; : TP311 : A ∗ Supported by the National Natural Science Fou