Exploring Sequential Probability Tree for Movement-based Community Discovery

doi:10.1109/TKDE.2014.2304458

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/106217

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/106217

题名:	Exploring Sequential Probability Tree for Movement-based Community Discovery
作者:	Zhu, Wen-Yuan;Peng, Wen-Chih;Hung, Chih-Chieh;Lei, Po-Ruey;Chen, Ling-Jyh
关键词:	Trajectory profile;community structure;trajectory pattern mining
日期:	2014-11-01
上传时间:	2016-04-22 13:42:08 (UTC+8)
出版者:	Institute of Electrical and Electronics Engineers
摘要:	In this paper, we tackle the problem of discovering movement-based communities of users, where users in the same community have similar movement behaviors. Note that the identification of movement-based communities is beneficial to location-based services and trajectory recommendation services. Specifically, we propose a framework to mine movement-based communities which consists of three phases: 1) constructing trajectory profiles of users, 2) deriving similarity between trajectory profiles, and 3) discovering movement-based communities. In the first phase, we design a data structure, called the Sequential Probability tree (SP-tree), as a user trajectory profile. SP-trees not only derive sequential patterns, but also indicate transition probabilities of movements. Moreover, we propose two algorithms: BF (standing for breadth-first) and DF (standing for depth-first) to construct SP-tree structures as user profiles. To measure the similarity values among users\' trajectory profiles, we further develop a similarity function that takes SP-tree information into account. In light of the similarity values derived, we formulate an objective function to evaluate the quality of communities. According to the objective function derived, we propose a greedy algorithm Geo-Cluster to effectively derive communities. To evaluate our proposed algorithms, we have conducted comprehensive experiments on two real data sets. The experimental results show that our proposed framework can effectively discover movement-based user communities.
關聯:	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 26(11), pp.2717-2730
DOI:	10.1109/TKDE.2014.2304458
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
Exploring Sequential Probability Tree for Movement-based Community Discovery.pdf		1490Kb	Adobe PDF	0	检视/开启
index.html		0Kb	HTML	187	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....