A friend recommendation algorithm based on trajectory mining

被引:0
作者
Cui, Bolong [1 ]
机构
[1] Hangzhou Dianzi Univ, Coll Automat, Hangzhou, Zhejiang, Peoples R China
来源
PROCEEDINGS OF 2016 9TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 2 | 2016年
关键词
trajectory mining; friend recommendation; MTR; hot trail; theta-ADBSCAN;
D O I
10.1109/ISCID.2016.192
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, with the popularity of the running and other sports software, friend recommendation algorithm based on trajectory is gradually becoming a hot research. In this paper, the theta-ADBSCAN algorithm is used to dig the hot trail and the resident points of user's trajectory, then the trajectory segmentation algorithm is described, and the trajectory is replaced by the MTR which is composed of the piecewise points and the hot trail. At last, we further study user behavior similarity based on the trajectory region and the resident point for friend recommendation.
引用
收藏
页码:338 / 341
页数:4
相关论文
共 9 条
[1]  
Lo S, 2006, P ACM INT C WEB INT
[2]  
Lo S, P 2006 IEEE WIC ACM
[3]  
Niu Qingpeng, 2009, RES BLOG FRIENDS REC
[4]  
Rao Bharat, 2003, COMMUN ACM, P63
[5]  
Shi Lingfeng, 2012, RES APPL GRAPH QUERY
[6]  
Xiang liang, 2012, RECOMMENDATION SYSTE
[7]  
[于海群 Yu Haiqun], 2012, [计算机应用与软件, Computer Applications and Software], V29, P39
[8]  
Zheng Jiajia, 2011, FRIENDS RECOMMENDATI
[9]  
Zheng Y, 2009, MDM: 2009 10TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT, P357, DOI 10.1109/MDM.2009.50