通过签入历史进行协作活动识别

Defu Lian, Xing Xie
{"title":"通过签入历史进行协作活动识别","authors":"Defu Lian, Xing Xie","doi":"10.1145/2063212.2063230","DOIUrl":null,"url":null,"abstract":"With the growing number of smartphones and increasing interest of location-based social network, check-in becomes more and more popular. Check-in means a user has visited a location, e.g., a Point of Interest (POI). The category of the POI implies the activities which can be conducted. In this paper, we are trying to discover the categories of the POIs in which users are being located (i.e., activities) based on GPS reading, time, user identification and other contextual information. However, in the real world, a single user's data is often insufficient for training individual activity recognition model due to limited check-ins each day. Thus we study how to collaboratively use similar users' check-in histories to train Conditional Random Fields (CRF) to provide better activity recognition for each user. We leverage k-Nearest Neighbors (kNN) and Hierarchical Agglomerative Clustering (HAC) for clustering similar users and learn a separated CRF for each cluster on the histories of its users. As for similarity, the first metric involves linear combination of three types of user factors attained by matrix decomposition on User-Activity, User-Temporal and User-Transition matrices. The second metric between two clusters can be the cosine similarity between weights of CRF corresponding to these two clusters. By the initial experiment on real world check-in data from Dianping, we show that it is possible to improve the classifier performance through collaboration and that the first similarity metric is not good to find the real neighbors.","PeriodicalId":107369,"journal":{"name":"Workshop on Location-based Social Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Collaborative activity recognition via check-in history\",\"authors\":\"Defu Lian, Xing Xie\",\"doi\":\"10.1145/2063212.2063230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the growing number of smartphones and increasing interest of location-based social network, check-in becomes more and more popular. Check-in means a user has visited a location, e.g., a Point of Interest (POI). The category of the POI implies the activities which can be conducted. In this paper, we are trying to discover the categories of the POIs in which users are being located (i.e., activities) based on GPS reading, time, user identification and other contextual information. However, in the real world, a single user's data is often insufficient for training individual activity recognition model due to limited check-ins each day. Thus we study how to collaboratively use similar users' check-in histories to train Conditional Random Fields (CRF) to provide better activity recognition for each user. We leverage k-Nearest Neighbors (kNN) and Hierarchical Agglomerative Clustering (HAC) for clustering similar users and learn a separated CRF for each cluster on the histories of its users. As for similarity, the first metric involves linear combination of three types of user factors attained by matrix decomposition on User-Activity, User-Temporal and User-Transition matrices. The second metric between two clusters can be the cosine similarity between weights of CRF corresponding to these two clusters. By the initial experiment on real world check-in data from Dianping, we show that it is possible to improve the classifier performance through collaboration and that the first similarity metric is not good to find the real neighbors.\",\"PeriodicalId\":107369,\"journal\":{\"name\":\"Workshop on Location-based Social Networks\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Location-based Social Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2063212.2063230\",\"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/2063212.2063230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37

摘要

随着智能手机越来越多,人们对基于位置的社交网络越来越感兴趣,签到服务变得越来越流行。签到意味着用户已经访问了一个地点,例如兴趣点(POI)。POI的类别意味着可以进行的活动。在本文中,我们试图发现基于GPS读取、时间、用户识别和其他上下文信息的用户定位(即活动)的poi类别。然而,在现实世界中,由于每天签到次数有限,单个用户的数据往往不足以训练个人活动识别模型。因此,我们研究了如何协同使用相似用户的签入历史来训练条件随机场(CRF),从而为每个用户提供更好的活动识别。我们利用k近邻(kNN)和层次聚集聚类(HAC)对相似用户进行聚类,并根据其用户的历史为每个集群学习一个单独的CRF。对于相似度,第一个度量涉及通过对用户活动、用户时间和用户转移矩阵进行矩阵分解得到的三类用户因素的线性组合。两个簇之间的第二个度量可以是这两个簇对应的CRF权重之间的余弦相似度。通过对大众点评真实世界签到数据的初步实验,我们证明了通过协作可以提高分类器的性能,并且第一个相似度度量并不适合寻找真实的邻居。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Collaborative activity recognition via check-in history
With the growing number of smartphones and increasing interest of location-based social network, check-in becomes more and more popular. Check-in means a user has visited a location, e.g., a Point of Interest (POI). The category of the POI implies the activities which can be conducted. In this paper, we are trying to discover the categories of the POIs in which users are being located (i.e., activities) based on GPS reading, time, user identification and other contextual information. However, in the real world, a single user's data is often insufficient for training individual activity recognition model due to limited check-ins each day. Thus we study how to collaboratively use similar users' check-in histories to train Conditional Random Fields (CRF) to provide better activity recognition for each user. We leverage k-Nearest Neighbors (kNN) and Hierarchical Agglomerative Clustering (HAC) for clustering similar users and learn a separated CRF for each cluster on the histories of its users. As for similarity, the first metric involves linear combination of three types of user factors attained by matrix decomposition on User-Activity, User-Temporal and User-Transition matrices. The second metric between two clusters can be the cosine similarity between weights of CRF corresponding to these two clusters. By the initial experiment on real world check-in data from Dianping, we show that it is possible to improve the classifier performance through collaboration and that the first similarity metric is not good to find the real neighbors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Forecasting location-based events with spatio-temporal storytelling VacationFinder: a tool for collecting, analyzing, and visualizing geotagged Twitter data to find top vacation spots Sophy: a morphological framework for structuring geo-referenced social media From where do tweets originate?: a GIS approach for user location inference WeiboStand: capturing Chinese breaking news using Weibo "tweets"
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1