Xiaobin Ren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaobin Ren has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Kaiqi Zhao
Shenzhen Key Laboratory of Internet Information Collaboration, Harbin Institute of Technology, Shenzhen, Shenzhen, China
4 shared publications - Katerina Taškova
School of Computer Science, University of Auckland, Auckland, New Zealand
3 shared publications - Lianyan Li
Department of Civil and Environmental Engineering University of Auckland Auckland New Zealand
3 shared publications - Patricia Riddle
School of Computer Science, University of Auckland, Auckland, New Zealand
3 shared publications - Baojuan Zheng
Commerical Vehicle Technology Center, SAIC Motor Group Co., Ltd., Shanghai 200041, China
1 shared publication - Jiaying Liu
Faculty of Science, Northeast University, Qinhuangdao 110819, China
1 shared publication
Latest Publications
- 7 June 2026
- Published by Springer Nature
- p. 132-144
PMME: Spatio-Temporal Few-Shot Learning via Pattern Matching with Memory Enhancement
- 7 June 2026
- Published by Springer Nature
- p. 132-144
PMME: Spatio-Temporal Few-Shot Learning via Pattern Matching with Memory Enhancement
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1251-1262
AnchorGK: Anchor-based Incremental and Stratified Graph Learning Framework for Inductive Spatio-Temporal Kriging
Spatio-temporal kriging is an essential research problem in sensor networks due to the sparsity of deployed sensors. While recent studies consider spatial and temporal correlations, they often overlook the sparse spatial distribution of locations and the incomplete features across locations. To tackle these problems, we propose an Anchor-based Incremental and Stratified Graph Learning Framework for Inductive Spatio-Temporal Kriging (AnchorGK). AnchorGK introduces anchor locations to enable effective data stratification for accurate kriging. Anchor locations are constructed based on feature availability, and strata are subsequently established based on the an- chor locations. This stratification serves two purposes: 1) it ensures that the spatial correlations between unknown areas (no observations) and surrounding known locations are accurately represented and dynamically updated within the graph learning framework, and 2) it facilitates the use of all available features across different strata through a novel incremental representation method. Building on the data stratification, we propose a dual-view graph learning layer that integrates information from relevant features and locations and learns distinct representations for different strata. Finally, kriging is performed based on the obtained strata representations. Experimental results on multiple benchmark datasets demonstrate that AnchorGK consistently outperforms existing state-of-the-art methods. Our codes, datasets, and related materials are given in: https://github.com/xren451/Spatial-interpolation
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1251-1262
Open AccessAnchorGK: Anchor-based Incremental and Stratified Graph Learning Framework for Inductive Spatio-Temporal Kriging
Spatio-temporal kriging is an essential research problem in sensor networks due to the sparsity of deployed sensors. While recent studies consider spatial and temporal correlations, they often overlook the sparse spatial distribution of locations and the incomplete features across locations. To tackle these problems, we propose an Anchor-based Incremental and Stratified Graph Learning Framework for Inductive Spatio-Temporal Kriging (AnchorGK). AnchorGK introduces anchor locations to enable effective data stratification for accurate kriging. Anchor locations are constructed based on feature availability, and strata are subsequently established based on the an- chor locations. This stratification serves two purposes: 1) it ensures that the spatial correlations between unknown areas (no observations) and surrounding known locations are accurately represented and dynamically updated within the graph learning framework, and 2) it facilitates the use of all available features across different strata through a novel incremental representation method. Building on the data stratification, we propose a dual-view graph learning layer that integrates information from relevant features and locations and learns distinct representations for different strata. Finally, kriging is performed based on the obtained strata representations. Experimental results on multiple benchmark datasets demonstrate that AnchorGK consistently outperforms existing state-of-the-art methods. Our codes, datasets, and related materials are given in: https://github.com/xren451/Spatial-interpolation
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1973-1982
Periormer: Periodic Transformer for Seasonal and Irregularly Sampled Time Series
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1973-1982
Open AccessPeriormer: Periodic Transformer for Seasonal and Irregularly Sampled Time Series
- Open Access
- 13 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (2) , 1-25
DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation
Missing data imputation for location-based sensor data has attracted much attention in recent years. The state-of-the-art imputation methods based on graph neural networks have a priori assumption that the spatial correlations between sensor locations are static. However, real-world data sets often exhibit dynamic spatial correlations. This paper proposes a novel approach to capturing the dynamics of spatial correlations between geographical locations as a composition of the constant, long-term trends and periodic patterns. To this end, we design a new method called Dynamic Adjacency Matrix Representation (DAMR) that extracts various dynamic patterns of spatial correlations and represents them as adjacency matrices. The adjacency matrices are then aggregated and fed into a well-designed graph representation learning layer for predicting the missing values. Through extensive experiments on six real-world data sets, we demonstrate that DAMR reduces the MAE by up to 19.4% compared with the state-of-the-art methods for the missing value imputation task
- 13 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (2) , 1-25
Open AccessDAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation
Missing data imputation for location-based sensor data has attracted much attention in recent years. The state-of-the-art imputation methods based on graph neural networks have a priori assumption that the spatial correlations between sensor locations are static. However, real-world data sets often exhibit dynamic spatial correlations. This paper proposes a novel approach to capturing the dynamics of spatial correlations between geographical locations as a composition of the constant, long-term trends and periodic patterns. To this end, we design a new method called Dynamic Adjacency Matrix Representation (DAMR) that extracts various dynamic patterns of spatial correlations and represents them as adjacency matrices. The adjacency matrices are then aggregated and fed into a well-designed graph representation learning layer for predicting the missing values. Through extensive experiments on six real-world data sets, we demonstrate that DAMR reduces the MAE by up to 19.4% compared with the state-of-the-art methods for the missing value imputation task
- Open Access
- 20 December 2021
- Published by MDPI AG in Electronics
- Vol. 10 (24) , 3179
A Real-Time Matrix Iterative Optimization Algorithm of Booking Elevator Group and Numerical Simulation Formed by Multi-Sensor Combination
Elevators are an essential indoor transportation tool in high-rise buildings. The world is advocating the design concept of safety, energy-saving, and intelligence. We focus on improving operation speed and utilization efficiency of the elevator group. This paper proposed a real-time reservation elevator groups optimization algorithm, and a dynamic matrix iterative model has been established. The indoor navigation technology UWB is applied, which can help users to quickly find elevators. The manned equilibrium efficiency and running time equilibrium efficiency of elevator group are given. Moreover, the data filtering criterion formulas for user waiting time and elevator remaining space are defined. In this paper, three numerical examples are given. Example 1 is a single elevator in n-storey building. Example 2 is compared with different scheduling algorithms, such as FCFS, SSTF, LOOK, and SCAN algorithms, and the results show that our method has the advantages of short total running time and less round-trip frequency. At last, the matrix of numerical iteration results are visualized, and the data movement status of people on each floor can be observed. Example 3 introduced elevator group algorithms. For high-rise buildings, this paper adopts a high, medium, and low hierarchical management model; this model has high coordination, as well as fast response, batch process, and adaptive function. Finally, we also discussed and compared the complexity of single elevator and elevator group algorithms. Therefore, this method has great development potential and practical application value, which deserves further study.
- 20 December 2021
- Published by MDPI AG in Electronics
- Vol. 10 (24) , 3179
Open AccessA Real-Time Matrix Iterative Optimization Algorithm of Booking Elevator Group and Numerical Simulation Formed by Multi-Sensor Combination
Elevators are an essential indoor transportation tool in high-rise buildings. The world is advocating the design concept of safety, energy-saving, and intelligence. We focus on improving operation speed and utilization efficiency of the elevator group. This paper proposed a real-time reservation elevator groups optimization algorithm, and a dynamic matrix iterative model has been established. The indoor navigation technology UWB is applied, which can help users to quickly find elevators. The manned equilibrium efficiency and running time equilibrium efficiency of elevator group are given. Moreover, the data filtering criterion formulas for user waiting time and elevator remaining space are defined. In this paper, three numerical examples are given. Example 1 is a single elevator in n-storey building. Example 2 is compared with different scheduling algorithms, such as FCFS, SSTF, LOOK, and SCAN algorithms, and the results show that our method has the advantages of short total running time and less round-trip frequency. At last, the matrix of numerical iteration results are visualized, and the data movement status of people on each floor can be observed. Example 3 introduced elevator group algorithms. For high-rise buildings, this paper adopts a high, medium, and low hierarchical management model; this model has high coordination, as well as fast response, batch process, and adaptive function. Finally, we also discussed and compared the complexity of single elevator and elevator group algorithms. Therefore, this method has great development potential and practical application value, which deserves further study.