联合学习辅助框架,定期识别城市空间中的用户社区

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Ad Hoc Networks Pub Date : 2024-07-02 DOI:10.1016/j.adhoc.2024.103589
Cláudio Diego T. de Souza , José Ferreira de Rezende , Carlos Alberto V. Campos
{"title":"联合学习辅助框架,定期识别城市空间中的用户社区","authors":"Cláudio Diego T. de Souza ,&nbsp;José Ferreira de Rezende ,&nbsp;Carlos Alberto V. Campos","doi":"10.1016/j.adhoc.2024.103589","DOIUrl":null,"url":null,"abstract":"<div><p>Identifying individuals with similar behaviors and mobility patterns has become essential to improving the functioning of urban services. However, since these patterns can vary over time, such identification needs to be done periodically. Furthermore, once mobility data expresses the routine of individuals, privacy must be guaranteed. In this work, we propose a framework for periodically detecting and grouping individuals with behavioral similarities into communities. To accomplish this, we built an autoencoder model to extract spatio-temporal mobility features from raw user data at periodic intervals. We used Federated Learning (FL) as a training approach to preserve privacy and alleviate time-consuming training and communication costs. To determine the number of communities without risking an arbitrary number, we compared the choices of two probabilistic methods, the Akaike Information Criterion (AIC) and the Bayesian Information Criterion (BIC). Since the communities are updated periodically, we also analyzed the impact of aged samples on the proposed framework. Finally, we compared the performance of our FL-based solution to a centralized training approach. We analyzed similarity and dissimilarity metrics on mobility samples and the contact time of individuals in three different scenarios. Our results indicate that AIC outperforms BIC when choosing the number of communities, although both satisfy the evaluation metrics. We also found that using older samples benefits more complex spatio-temporal scenarios. Finally, no significant losses were detected when compared to a centralized training approach, reinforcing the advantages of using the FL-based method.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Federated Learning assisted framework to periodically identify user communities in urban space\",\"authors\":\"Cláudio Diego T. de Souza ,&nbsp;José Ferreira de Rezende ,&nbsp;Carlos Alberto V. Campos\",\"doi\":\"10.1016/j.adhoc.2024.103589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Identifying individuals with similar behaviors and mobility patterns has become essential to improving the functioning of urban services. However, since these patterns can vary over time, such identification needs to be done periodically. Furthermore, once mobility data expresses the routine of individuals, privacy must be guaranteed. In this work, we propose a framework for periodically detecting and grouping individuals with behavioral similarities into communities. To accomplish this, we built an autoencoder model to extract spatio-temporal mobility features from raw user data at periodic intervals. We used Federated Learning (FL) as a training approach to preserve privacy and alleviate time-consuming training and communication costs. To determine the number of communities without risking an arbitrary number, we compared the choices of two probabilistic methods, the Akaike Information Criterion (AIC) and the Bayesian Information Criterion (BIC). Since the communities are updated periodically, we also analyzed the impact of aged samples on the proposed framework. Finally, we compared the performance of our FL-based solution to a centralized training approach. We analyzed similarity and dissimilarity metrics on mobility samples and the contact time of individuals in three different scenarios. Our results indicate that AIC outperforms BIC when choosing the number of communities, although both satisfy the evaluation metrics. We also found that using older samples benefits more complex spatio-temporal scenarios. Finally, no significant losses were detected when compared to a centralized training approach, reinforcing the advantages of using the FL-based method.</p></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570870524002002\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524002002","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

识别具有相似行为和流动模式的个人对于改善城市服务功能至关重要。然而,由于这些模式会随着时间的推移而变化,因此需要定期进行识别。此外,一旦移动数据表示了个人的日常行为,就必须保证隐私。在这项工作中,我们提出了一个框架,用于定期检测行为相似的个人并将其归类为社区。为此,我们建立了一个自动编码器模型,定期从原始用户数据中提取时空移动特征。我们使用联盟学习(FL)作为训练方法,以保护隐私并减轻耗时的训练和通信成本。为了确定社区数量而不冒任意数量的风险,我们比较了两种概率方法的选择:阿凯克信息准则(AIC)和贝叶斯信息准则(BIC)。由于社区会定期更新,我们还分析了老化样本对拟议框架的影响。最后,我们比较了基于 FL 的解决方案和集中式训练方法的性能。我们分析了三种不同场景中移动样本和个体接触时间的相似度和不相似度指标。我们的结果表明,在选择社区数量时,AIC 优于 BIC,尽管两者都能满足评估指标。我们还发现,使用较老的样本有利于更复杂的时空场景。最后,与集中式训练方法相比,我们没有发现明显的损失,这加强了使用基于 FL 的方法的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Federated Learning assisted framework to periodically identify user communities in urban space

Identifying individuals with similar behaviors and mobility patterns has become essential to improving the functioning of urban services. However, since these patterns can vary over time, such identification needs to be done periodically. Furthermore, once mobility data expresses the routine of individuals, privacy must be guaranteed. In this work, we propose a framework for periodically detecting and grouping individuals with behavioral similarities into communities. To accomplish this, we built an autoencoder model to extract spatio-temporal mobility features from raw user data at periodic intervals. We used Federated Learning (FL) as a training approach to preserve privacy and alleviate time-consuming training and communication costs. To determine the number of communities without risking an arbitrary number, we compared the choices of two probabilistic methods, the Akaike Information Criterion (AIC) and the Bayesian Information Criterion (BIC). Since the communities are updated periodically, we also analyzed the impact of aged samples on the proposed framework. Finally, we compared the performance of our FL-based solution to a centralized training approach. We analyzed similarity and dissimilarity metrics on mobility samples and the contact time of individuals in three different scenarios. Our results indicate that AIC outperforms BIC when choosing the number of communities, although both satisfy the evaluation metrics. We also found that using older samples benefits more complex spatio-temporal scenarios. Finally, no significant losses were detected when compared to a centralized training approach, reinforcing the advantages of using the FL-based method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
期刊最新文献
TAVA: Traceable anonymity-self-controllable V2X Authentication over dynamic multiple charging-service providers RL-based mobile edge computing scheme for high reliability low latency services in UAV-aided IIoT networks Editorial Board PLLM-CS: Pre-trained Large Language Model (LLM) for cyber threat detection in satellite networks A two-context-aware approach for navigation: A case study for vehicular route recommendation
×
引用
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