Location-Based Distance Measures for Geosocial Similarity

Author:

Kanza Yaron1,Kravi Elad2,Safra Eliyahu3,Sagiv Yehoshua4

Affiliation:

1. AT8T Labs - Research, Bedminster, NJ, USA

2. Technion - Israel Institute of Technology, Haifa, Israel

3. General Electric Digital, Herzliya, Israel

4. Hebrew University, Jerusalem, Israel

Abstract

This article investigates the problem of geosocial similarity among users of online social networks, based on the locations of their activities (e.g., posting messages or photographs). Finding pairs of geosocially similar users or detecting that two sets of locations (of activities) belong to the same user has important applications in privacy protection, recommendation systems, urban planning, and public health, among others. It is explained and shown empirically that common distance measures between sets of locations are inadequate for determining geosocial similarity. Two novel distance measures between sets of locations are introduced. One is the mutually nearest distance that is based on computing a matching between two sets. The second measure uses a quad-tree index. It is highly scalable but incurs the overhead of creating and maintaining the index. Algorithms with optimization techniques are developed for computing the two distance measures and also for finding the k -most-similar users of a given one. Extensive experiments, using geotagged messages from Twitter, show that the new distance measures are both more accurate and more efficient than existing ones.

Funder

Israeli Ministry of Science and Technology

Israel Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference74 articles.

1. Similarity search on a large collection of point sets

2. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions

3. Ravindra K. Ahuja Thomas L. Magnanti and James B. Orlin. 1993. Network Flows: Theory Algorithms and Applications. Prentice Hall Upper Saddle River NJ. Ravindra K. Ahuja Thomas L. Magnanti and James B. Orlin. 1993. Network Flows: Theory Algorithms and Applications. Prentice Hall Upper Saddle River NJ.

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Low-Cost High-Performance Semantic and Physical Distance Calculation Method Based on ZIP Code;IEICE Transactions on Information and Systems;2022-05-01

2. Locality Sensitive Hash Aggregated Nonlinear Neighborhood Matrix Factorization for Online Sparse Big Data Analysis;ACM/IMS Transactions on Data Science;2021-11-30

3. Location Classification Based on Tweets;Proceedings of the 4th ACM SIGSPATIAL International Workshop on AI for Geographic Knowledge Discovery;2021-11-02

4. Exploring Weather Data to Predict Activity Attendance in Event-based Social Network;ACM Transactions on the Web;2021-05

5. A topology-based graph data model for indoor spatial-social networking;International Journal of Geographical Information Science;2021-04-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3