STCCD: Semantic trajectory clustering based on community detection in networks

被引:18
作者
Liu, Caihong [1 ,2 ]
Guo, Chonghui [1 ]
机构
[1] Dalian Univ Technol, Inst Syst Engn, Dalian 116024, Liaoning, Peoples R China
[2] Dalian Univ Foreign Languages, Coll Software, Dalian 116044, Liaoning, Peoples R China
基金
中国国家自然科学基金;
关键词
Trajectory clustering; Trajectory similarity; Complex network; Community detection; COMPLEX NETWORKS; INFORMATION-CONTENT; TIME-SERIES; SIMILARITY; ALGORITHM; CENTRALITY; SEARCH; POWER;
D O I
10.1016/j.eswa.2020.113689
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most of traditional trajectory clustering algorithms often cluster similar trajectories from a temporal or spatial perspective. One weak point is that the semantic relationship between the trajectories is ignored. In some cases, trajectories with spatio-temporal similarities may be semantically related, and the negligence of semantic information may result in unreasonable trajectory clustering results. In addition, the existing semantic trajectory clustering algorithms only consider the local semantic relationship between adjacent spatio-temporal trajectories, and the overall global semantic relationship between trajectories is still unknown. Considering the disadvantages of the current trajectory clustering methods, we proposed a novel algorithm for semantic trajectory clustering based on community detection (STCCD) in networks, which can better measure the semantic similarity of trajectories and capture global relationship among trajectories from the perspective of the network, and can get better trajectory clustering results compared to some traditional and recently proposed methods. Experimental results demonstrate that the proposed method can effectively mine the trajectory clustering information and related knowledge from the semantic trajectory data. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:20
相关论文
共 90 条
[1]   Link communities reveal multiscale complexity in networks [J].
Ahn, Yong-Yeol ;
Bagrow, James P. ;
Lehmann, Sune .
NATURE, 2010, 466 (7307) :761-U11
[2]  
Alvares L.O., 2007, P 15 ANN ACM INT S A, P1, DOI [DOI 10.1145/1341012.1341041, 10.1145/1341012.1341041]
[3]  
[Anonymous], 2012, NEW FRONTIERS MINING
[4]  
[Anonymous], 1999, SIGKDD, DOI [DOI 10.1145/312129.312198, 10.1145/312129.312198]
[5]  
Augustin D, 2018, P 2018 IEEE INT C VE, P1, DOI [10.1109/ICVES.2018.8519494, DOI 10.1109/ICVES.2018.8519494]
[6]   MEASURING POWER OF HIERARCHICAL CLUSTER-ANALYSIS [J].
BAKER, FB ;
HUBERT, LJ .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1975, 70 (349) :31-38
[7]   Taxonomy-based information content and wordnet-wiktionary-wikipedia glosses for semantic relatedness [J].
Ben Aouicha, Mohamed ;
Taieb, Mohamed Ali Hadj ;
Ben Hamadou, Abdelmajid .
APPLIED INTELLIGENCE, 2016, 45 (02) :475-511
[8]  
Berton L., 2018, Int. Jt. Conf. Neural Netw. (IJCNN), V2018, P1, DOI [10.1109/IJCNN.2018.8489524, DOI 10.1109/IJCNN.2018.8489524]
[9]  
Berton L, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P4343
[10]   Review and Perspective for Distance-Based Clustering of Vehicle Trajectories [J].
Besse, Philippe C. ;
Guillouet, Brendan ;
Loubes, Jean-Michel ;
Royer, Francois .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2016, 17 (11) :3306-3317