ACM Transactions on Spatial Algorithms and Systems最新文献_第3页

Detection of Non-designated Evacuation Shelters from Real-time Population Dynamics using Autoencoder-based Anomaly Detection 利用基于自动编码器的异常检测技术从实时人口动态中检测非指定疏散避难所

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2024-01-29 DOI: 10.1145/3643679

Keiichi Ochiai, Masayuki Terada, Makoto Hanashima, Hiroaki Sano, Y. Usuda

{"title":"Detection of Non-designated Evacuation Shelters from Real-time Population Dynamics using Autoencoder-based Anomaly Detection","authors":"Keiichi Ochiai, Masayuki Terada, Makoto Hanashima, Hiroaki Sano, Y. Usuda","doi":"10.1145/3643679","DOIUrl":"https://doi.org/10.1145/3643679","url":null,"abstract":"\u0000 In a disaster situation, local and municipal governments need to distribute relief supplies and provide administrative support to evacuees. Although people are supposed to evacuate to evacuation shelters designated by local governments, some people take refuge at non-designated facilities, called\u0000 non-designated evacuation shelters\u0000 , due to unavoidable circumstances such as damages on the access routes to designated evacuation shelters. Upon occurrence of a disaster, therefore, it is necessary for the local governments to quickly find the locations of non-designated evacuation shelters. In this paper, we propose a method to detect non-designated evacuation shelters based on autoencoder (AE)-based anomaly detection using real-time population dynamics generated from operation data of cellular phone networks. We assume that reconstruction errors of an AE model include both the errors due to characteristic differences between locations and the errors due to anomalies in population dynamics. Thus, we propose to use the ratio of the reconstruction error before and after the earthquake to determine the threshold of anomaly detection. We evaluate the performance of the proposed method on data from three actual earthquakes in Japan. The evaluation results show that our reconstruction-error-based approach can achieve better accuracy for the actual disaster data compared to a baseline method that exploits statistical anomaly detection.\u0000","PeriodicalId":43641,"journal":{"name":"ACM Transactions on Spatial Algorithms and Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140489925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Geography-aware Heterogeneous Graph Contrastive Learning for Travel Recommendation 用于旅游推荐的地理感知异构图对比学习

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2024-01-22 DOI: 10.1145/3641277

Lei Chen, Jie Cao, Weichao Liang, Qiaolin Ye

{"title":"Geography-aware Heterogeneous Graph Contrastive Learning for Travel Recommendation","authors":"Lei Chen, Jie Cao, Weichao Liang, Qiaolin Ye","doi":"10.1145/3641277","DOIUrl":"https://doi.org/10.1145/3641277","url":null,"abstract":"\u0000 Recommendation system concentrates on quickly matching products to consumer’s needs which plays a major role in improving user experiences and increase conversion rate. Travel recommendation has become a hot topic in both industry and academia with the development of the tourism industry. Nevertheless, the selection of travel products entails careful consideration of various geographical factors, such as departure and destination. Meanwhile, due to the limitation of finance and time, users browse and purchase travel products less frequently than they do for traditional products, which leads to data sparsity problem in representation learning. To solve these challenges, a novel model named GHGCL (short for\u0000 G\u0000 eography-aware\u0000 H\u0000 eterogeneous\u0000 G\u0000 raph\u0000 C\u0000 ontrastive\u0000 L\u0000 earning) is proposed for recommending travel products. Concretely, we model the travel recommender system as an heterogeneous information network with geographical information, and capture diverse user preferences from local and high-order structures. Especially, we design two kinds of contrastive learning tasks for better user and travel product representation learning. The multi-view contrastive learning aims to bridge the gap between network schema and meta-path view representations. The meta-path contrastive learning focuses on modeling the coarse-grained commonality between different meta-paths from the perspective of different geographical factors,\u0000 i.e.,\u0000 departure and destination. We assess the performance of GHGCL by performing a series of experiments on a real-world dataset and the results clearly verify its superiority as compared to the baseline methods.\u0000","PeriodicalId":43641,"journal":{"name":"ACM Transactions on Spatial Algorithms and Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139607734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Adaptive Spatio-Temporal Graph Learning for Bus Station Profiling 用于公交车站轮廓分析的自适应时空图学习

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-12-07 DOI: 10.1145/3636459

Mingliang Hou, Feng Xia, Xin Chen, V. Saikrishna, Honglong Chen

{"title":"Adaptive Spatio-Temporal Graph Learning for Bus Station Profiling","authors":"Mingliang Hou, Feng Xia, Xin Chen, V. Saikrishna, Honglong Chen","doi":"10.1145/3636459","DOIUrl":"https://doi.org/10.1145/3636459","url":null,"abstract":"Understanding and managing public transportation systems require capturing complex spatio-temporal correlations within datasets. Existing studies often use predefined graphs in graph learning frameworks, neglecting shifted spatial and long-term temporal correlations, which are crucial in practical applications. To address these problems, we propose a novel bus station profiling framework to automatically infer the spatio-temporal correlations and capture the shifted spatial and long-term temporal correlations in the public transportation dataset. The proposed framework adopts and advances the graph learning structure through the following innovative ideas: (1) Designing an adaptive graph learning mechanism to capture the interactions between spatio-temporal correlations rather than relying on pre-defined graphs; (2) Modeling shifted correlation in shifted spatial graphs to learn fine-grained spatio-temporal features; (3) Employing self-attention mechanism to learn the long-term temporal correlations preserved in public transportation data. We conduct extensive experiments on three real-world datasets and exploit the learned profiles of stations for the station passenger flow prediction task. Experimental results demonstrate that the proposed framework outperforms all baselines under different settings and can produce meaningful bus station profiles.","PeriodicalId":43641,"journal":{"name":"ACM Transactions on Spatial Algorithms and Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138591142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Forecasting Urban Sensory Values through Learning Attention-adjusted Graph Spatio-Temporal Networks 通过学习注意力调整图时空网络预测城市感官值

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-12-04 DOI: 10.1145/3635140

Yi-Ju Lu, Cheng-Te Li

引用次数: 0

Deformation Gated Recurrent Network for Lane-Level Abnormal Driving Behavior Recognition 用于车道级异常驾驶行为识别的变形门控递归网络

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-12-02 DOI: 10.1145/3635141

Guojiang Shen, Juntao Wang, Xiangjie Kong, Zhanhao Ji, Bing Zhu, Tie Qiu

引用次数: 0

HTF: Homogeneous Tree Framework for Differentially-Private Release of Large Geospatial Datasets with Self-Tuning Structure Height. 基于结构高度自调优的大型地理空间数据集差分私有发布的同构树框架

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-12-01 Epub Date: 2023-11-20 DOI: 10.1145/3569087

Sina Shaham, Gabriel Ghinita, Ritesh Ahuja, John Krumm, Cyrus Shahabi

{"title":"HTF: Homogeneous Tree Framework for Differentially-Private Release of Large Geospatial Datasets with Self-Tuning Structure Height.","authors":"Sina Shaham, Gabriel Ghinita, Ritesh Ahuja, John Krumm, Cyrus Shahabi","doi":"10.1145/3569087","DOIUrl":"10.1145/3569087","url":null,"abstract":"Mobile apps that use location data are pervasive, spanning domains such as transportation, urban planning and healthcare. Important use cases for location data rely on statistical queries, e.g., identifying hotspots where users work and travel. Such queries can be answered efficiently by building histograms. However, precise histograms can expose sensitive details about individual users. Differential privacy (DP) is a mature and widely-adopted protection model, but most approaches for DP-compliant histograms work in a data-independent fashion, leading to poor accuracy. The few proposed data-dependent techniques attempt to adjust histogram partitions based on dataset characteristics, but they do not perform well due to the addition of noise required to achieve DP. In addition, they use ad-hoc criteria to decide the depth of the partitioning. We identify density homogeneity as a main factor driving the accuracy of DP-compliant histograms, and we build a data structure that splits the space such that data density is homogeneous within each resulting partition. We propose a self-tuning approach to decide the depth of the partitioning structure that optimizes the use of privacy budget. Furthermore, we provide an optimization that scales the proposed split approach to large datasets while maintaining accuracy. We show through extensive experiments on large-scale real-world data that the proposed approach achieves superior accuracy compared to existing approaches.","PeriodicalId":43641,"journal":{"name":"ACM Transactions on Spatial Algorithms and Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10881200/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44219469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

STICAP: Spatio-Temporal Interactive Attention for Citywide Crowd Activity Prediction STICAP：用于全城人群活动预测的时空互动注意力

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-12-01 DOI: 10.1145/3603375

Huiqun Huang, Suining He, Xi Yang, Mahan Tabatabaie

{"title":"STICAP: Spatio-Temporal Interactive Attention for Citywide Crowd Activity Prediction","authors":"Huiqun Huang, Suining He, Xi Yang, Mahan Tabatabaie","doi":"10.1145/3603375","DOIUrl":"https://doi.org/10.1145/3603375","url":null,"abstract":"Accurate citywide crowd activity prediction (CAP) can enable proactive crowd mobility management and timely responses to urban events, which has become increasingly important for a myriad of smart city planning and management purposes. However, complex correlations across the crowd activities, spatial and temporal urban environment features and their interactive dependencies, and relevant external factors (e.g., weather conditions) make it highly challenging to predict crowd activities accurately in terms of different venue categories (for instance, venues related to dining, services, and residence) and varying degrees (e.g., daytime and nighttime). To address the above concerns, we propose STICAP, a citywide spatio-temporal interactive crowd activity prediction approach. In particular, STICAP takes in the location-based social network check-in data (e.g., from Foursquare/Gowalla) as the model inputs, and forecasts the crowd activity within each time step for each venue category. Furthermore, we have integrated multiple levels of temporal discretization to interactively capture the relations with historical data. Then three parallel Residual Spatial Attention Networks (RSAN) in the Spatial Attention Component exploit the hourly, daily, and weekly spatial features of crowd activities, which are further fused and processed by the Temporal Attention Component for interactive CAP. Along with other external factors such as weather conditions and holidays, STICAP adaptively and accurately forecasts the final crowd activities per venue category, enabling potential activity recommendation and other smart city applications. Extensive experimental studies based on three different real-word crowd activity datasets have demonstrated that our proposed STICAP outperforms the baseline and state-of-the-art algorithms in CAP accuracy, with an average error reduction of 35.02%","PeriodicalId":43641,"journal":{"name":"ACM Transactions on Spatial Algorithms and Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138621022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Editorial: Special Issue on the Best Papers from the 2021 ACM SIGSPATIAL Conference 编辑：2021 年 ACM SIGSPATIAL 会议最佳论文特刊

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-11-30 DOI: 10.1145/3632619

W. Aref

引用次数: 0

Adaptive Joint Spatio-Temporal Graph Learning Network for Traffic Data Forecasting 用于交通数据预测的自适应时空联合图学习网络

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-11-28 DOI: 10.1145/3634913

Tianyi Wang, Shu-Ching Chen

引用次数: 0

Exploiting Network Structure in Multi-criteria Distributed and Competitive Stationary-resource Searching 在多标准分布式竞争性固定资源搜索中利用网络结构

IF 1.9

ACM Transactions on Spatial Algorithms and Systems Pub Date : 2023-11-20 DOI: 10.1145/3569937

Fandel Lin, Hsun-Ping Hsieh

{"title":"Exploiting Network Structure in Multi-criteria Distributed and Competitive Stationary-resource Searching","authors":"Fandel Lin, Hsun-Ping Hsieh","doi":"10.1145/3569937","DOIUrl":"https://doi.org/10.1145/3569937","url":null,"abstract":"Transportation between satellite cities or inside the city center has always been a crucial factor in contributing to a better quality of life. This article focuses on multi-criteria distributed and competitive route planning for stationary resources in regions where neither real-time nor historical availability of the targeted resource is accessible. We propose an inference-than-planning approach, with an availability inference for stationary resources in areas with no sensor coverage and a distributed routing where no information is shared among agents. We leverage the inferred availability and network structure in the searching space to suggest a two-stage algorithm with three relaxing policies: adjacent cruising, on-orbital annealing, and orbital transitioning. We take two publicly accessible parking-slot datasets from San Francisco and Melbourne for evaluation. Overall results show that the proposed availability inference model can retain decent performance. Furthermore, our proposed routing algorithm maintains the quality of solutions by achieving the Pareto-optimal between searching experience and resource utilization among baseline and state-of-the-art methods under various circumstances.","PeriodicalId":43641,"journal":{"name":"ACM Transactions on Spatial Algorithms and Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139258484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0