从语义轨迹挖掘用户相似度

J. Ying, E. H. Lu, Wang-Chien Lee, Tz-Chiao Weng, V. Tseng
{"title":"从语义轨迹挖掘用户相似度","authors":"J. Ying, E. H. Lu, Wang-Chien Lee, Tz-Chiao Weng, V. Tseng","doi":"10.1145/1867699.1867703","DOIUrl":null,"url":null,"abstract":"In recent years, research on measuring trajectory similarity has attracted a lot of attentions. Most of similarities are defined based on the geographic features of mobile users' trajectories. However, trajectories geographically close may not necessarily be similar because the activities implied by nearby landmarks they pass through may be different. In this paper, we argue that a better similarity measurement should have taken into account the semantics of trajectories. In this paper, we propose a novel approach for recommending potential friends based on users' semantic trajectories for location-based social networks. The core of our proposal is a novel trajectory similarity measurement, namely, Maximal Semantic Trajectory Pattern Similarity (MSTP-Similarity), which measures the semantic similarity between trajectories. Accordingly, we propose a user similarity measurement based on MSTP-Similarity of user trajectories and use it as the basis for recommending potential friends to a user. Through experimental evaluation, the proposed friend recommendation approach is shown to deliver excellent performance.","PeriodicalId":107369,"journal":{"name":"Workshop on Location-based Social Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"220","resultStr":"{\"title\":\"Mining user similarity from semantic trajectories\",\"authors\":\"J. Ying, E. H. Lu, Wang-Chien Lee, Tz-Chiao Weng, V. Tseng\",\"doi\":\"10.1145/1867699.1867703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, research on measuring trajectory similarity has attracted a lot of attentions. Most of similarities are defined based on the geographic features of mobile users' trajectories. However, trajectories geographically close may not necessarily be similar because the activities implied by nearby landmarks they pass through may be different. In this paper, we argue that a better similarity measurement should have taken into account the semantics of trajectories. In this paper, we propose a novel approach for recommending potential friends based on users' semantic trajectories for location-based social networks. The core of our proposal is a novel trajectory similarity measurement, namely, Maximal Semantic Trajectory Pattern Similarity (MSTP-Similarity), which measures the semantic similarity between trajectories. Accordingly, we propose a user similarity measurement based on MSTP-Similarity of user trajectories and use it as the basis for recommending potential friends to a user. Through experimental evaluation, the proposed friend recommendation approach is shown to deliver excellent performance.\",\"PeriodicalId\":107369,\"journal\":{\"name\":\"Workshop on Location-based Social Networks\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"220\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Location-based Social Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1867699.1867703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Location-based Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1867699.1867703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 220

摘要

近年来,弹道相似度测量的研究引起了人们的广泛关注。大多数相似性是基于移动用户轨迹的地理特征来定义的。然而,地理上接近的轨迹可能并不一定相似,因为它们经过的附近地标所暗示的活动可能不同。在本文中,我们认为一个更好的相似性度量应该考虑到轨迹的语义。在本文中,我们提出了一种基于用户语义轨迹的基于位置的社交网络推荐潜在朋友的新方法。本文的核心是一种新的轨迹相似度度量方法,即最大语义轨迹模式相似度(maximum Semantic trajectory Pattern similarity, MSTP-Similarity),用于度量轨迹之间的语义相似度。因此,我们提出了一种基于用户轨迹的mstp相似度的用户相似度度量,并将其作为向用户推荐潜在朋友的基础。实验结果表明,本文提出的好友推荐方法具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining user similarity from semantic trajectories
In recent years, research on measuring trajectory similarity has attracted a lot of attentions. Most of similarities are defined based on the geographic features of mobile users' trajectories. However, trajectories geographically close may not necessarily be similar because the activities implied by nearby landmarks they pass through may be different. In this paper, we argue that a better similarity measurement should have taken into account the semantics of trajectories. In this paper, we propose a novel approach for recommending potential friends based on users' semantic trajectories for location-based social networks. The core of our proposal is a novel trajectory similarity measurement, namely, Maximal Semantic Trajectory Pattern Similarity (MSTP-Similarity), which measures the semantic similarity between trajectories. Accordingly, we propose a user similarity measurement based on MSTP-Similarity of user trajectories and use it as the basis for recommending potential friends to a user. Through experimental evaluation, the proposed friend recommendation approach is shown to deliver excellent performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信