...
首页> 外文期刊>Knowledge and Data Engineering, IEEE Transactions on >Exploring Sequential Probability Tree for Movement-Based Community Discovery
【24h】

Exploring Sequential Probability Tree for Movement-Based Community Discovery

机译:探索基于运动的社区发现的顺序概率树

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:在本文中,我们解决了发现基于运动的用户社区的问题,其中在同一社区中的用户具有相似的运动行为。请注意,基于移动的社区的标识有利于基于位置的服务和轨迹推荐服务。具体来说,我们提出了一个挖掘基于移动的社区的框架,该框架包括三个阶段:1)构建用户的轨迹配置文件; 2)推导轨迹配置文件之间的相似性; 3)发现基于移动的社区。在第一阶段,我们设计一个数据结构,称为顺序概率树(SP-tree),作为用户轨迹配置文件。 SP树不仅导出顺序模式,而且还指示运动的转移概率。此外,我们提出了两种算法:BF(代表广度优先)和DF(代表深度优先)来构造SP树结构作为用户配置文件。为了测量用户轨迹配置文件之间的相似度值,我们进一步开发了一个相似度函数,该函数考虑了SP树信息。根据得出的相似性值,我们制定了一个目标函数来评估社区的质量。根据导出的目标函数,我们提出了一种贪婪算法Geo-Cluster来有效地导出社区。为了评估我们提出的算法,我们对两个真实数据集进行了全面的实验。实验结果表明,我们提出的框架可以有效地发现基于移动的用户社区。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号