Sijie Ruan

Sijie Ruan

Auto-generated profile, based on publicly available information

Sijie Ruan

Beijing Institute of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 March 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
THTianfu He
Tianfu He
JBJie Bao
Jie Bao
SRSijie Ruan
Sijie Ruan
RLRuiyuan Li
Ruiyuan Li
YLYanhua Li
Yanhua Li
YZYu Zheng
Yu Zheng
Cycling as a green transportation mode has been promoted by many governments all over the world. As a result, constructing effective bike lanes has become a crucial task to promote the cycling life style, as well-planned bike lanes can reduce traffic congestions and safety risks. Unfortunately, existing trajectory mining approaches for bike lane planning do not consider one or more key realistic government constraints: 1)~budget limitations, 2)~construction convenience, and 3)~bike lane utilization. In this paper, we propose a data-driven approach to develop bike lane construction plans based on the large-scale real world bike trajectory data collected from Mobike, a station-less bike sharing system. We enforce these constraints to formulate our problem and introduce a flexible objective function to tune the benefit between coverage of users and the length of their trajectories. We prove the NP-hardness of the problem and propose greedy-based heuristics to address it. To improve the efficiency of the bike lane planning system for the urban planner, we propose a novel trajectory indexing structure and deploy the system based on a parallel computing framework (Storm) to improve the system's efficiency. Finally, extensive experiments and case studies are provided to demonstrate the system efficiency and effectiveness.

28 November 2023 in Computer Networks
Verified
Journal Article
Closed access
XYXiaodu Yang
Xiaodu Yang
SRSijie Ruan
Sijie Ruan
YYYinliang Yue
Yinliang Yue
BSBo Sun
Bo Sun

21 May 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
Shuliang WangShuliang Wang
Shuliang Wang
JZJiabao Zhu
Jiabao Zhu
YWYi Wang
Yi Wang
CMChen Ma
Chen Ma
XZXin Zhao
Xin Zhao
SRSijie Ruan
Sijie Ruan
Cross-domain sequential recommendation (CDSR) utilizes data from multiple domains to recommend the user’s next interaction based on his latest interaction sequence. Currently, many cross-domain sequential recommendation algorithms have been proven to achieve good recommendation performance. However, these algorithms overlook the influence of users’ long-term behavioral patterns and general interests when extracting their current preferences. In this article, we propose a Hierarchical Gating Network for Cross-Domain Sequential Recommendation (HGNCDSR). Specifically, we simultaneously train single-domain and cross-domain interaction sequences, utilizing a hierarchical gating network to capture user interest representations in single-domain and cross-domain, respectively. A feature gating and an instance gating are applied respectively to extract user interests at item feature level and instance level. While learning current preferences from behavior sequences, user representations that reflect behavioral patterns and general interests are simultaneously learned and strengthened. Additionally, we employ the item–item product to model the relationships between candidate items and those in the interaction sequence. Both current interests and item relevance are considered simultaneously, integrating single-domain and cross-domain user preferences to predict the user’s next interaction. We design extensive experiments to show that HGNCDSR has better recommendation performance than other state-of-the-art models.

11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
QXQianxiong Xu
Qianxiong Xu
CLCheng Long
Cheng Long
ZLZiyue Li
Ziyue Li
SRSijie Ruan
Sijie Ruan
RZRui Zhao
Rui Zhao
ZLZhishuai Li
Zhishuai Li
Sensors are commonly deployed to perceive the environment. However, due to the high cost, sensors are usually sparsely deployed. Kriging is the tailored task to infer the unobserved nodes (without sensors) using the observed nodes (with sensors). The essence of kriging task is transferability. Recently, several inductive spatio-temporal kriging methods have been proposed based on graph neural networks, being trained based on a graph built on top of observed nodes via pretext tasks such as masking nodes out and reconstructing them. However, the graph in training is inevitably much sparser than the graph in inference that includes all the observed and unobserved nodes. The learned pattern cannot be well generalized for inference, denoted as graph gap. To address this issue, we first present a novel Increment training strategy: instead of masking nodes (and reconstructing them), we add virtual nodes into the training graph so as to mitigate the graph gap issue naturally. Nevertheless, the empty-shell virtual nodes without labels could have bad-learned features and lack supervision signals. To solve these issues, we pair each virtual node with its most similar observed node and fuse their features together; to enhance the supervision signal, we construct reliable pseudo labels for virtual nodes. As a result, the learned pattern of virtual nodes could be safely transferred to real unobserved nodes for reliable kriging. We name our new Kriging model with Increment Training Strategy as KITS. Extensive experiments demonstrate that KITS consistently outperforms existing methods by large margins, e.g., the improvement over MAE score could be as high as 18.33%.

9 December 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
Shuliang WangShuliang Wang
Shuliang Wang
QYQianyu Yang
Qianyu Yang
SRSijie Ruan
Sijie Ruan
CLCheng Long
Cheng Long
YYYe Yuan
Ye Yuan
YZYu Zheng
Yu Zheng
Intelligent logistics relies on accurately predicting the service time, which is a part of time cost in the last-mile delivery. However, service time prediction (STP) is non-trivial given complex delivery circumstances, location heterogeneity, and skewed observations in space, which are not well-handled by existing solutions. In our prior work, we treat STP at each location as a learning task to keep the location heterogeneity, propose a prior knowledge-enhanced meta-learning to tackle skewed observations, and introduce a Transformer-based representation module to encode complex delivery circumstances. Maintaining the design principles of prior work, in this extended paper, we propose MetaSTP+. In addition to fusing the prior knowledge after the meta-learning process, MetaSTP+ also injects the prior knowledge before and during the meta-learning process to better tackle skewed observations. More specifically, MetaSTP+ completes the support set of tasks with scarce samples from other tasks based on prior knowledge and is equipped with a prior knowledge-aware historical observation encoding module to achieve those purposes accordingly. Experiments show MetaSTP+ outperforms the best baseline by 11.2% and 8.4% on two real-world datasets. Finally, an intelligent waybill assignment system based on MetaSTP+ is deployed in JD Logistics.

13 February 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Shuliang WangShuliang Wang
Shuliang Wang
ZWZiyu Wang
Ziyu Wang
SRSijie Ruan
Sijie Ruan
HHHaoyu Han
Haoyu Han
KXKeqin Xiong
Keqin Xiong
YZYu Zheng
Yu Zheng
The updated residential-level fine-grained digital map is essential for last-mile delivery. However, many of those low-level roads are not recorded in maps due to the high mapping costs. With the digitization of the logistics industry, couriers’ trajectories become a promising data source to complete missing roads in maps. Existing trajectory-based map updating work rely on heavy parameter tuning to overcome the positioning error issue due to their unsupervised nature, and are not able to handle issues of unreliable road indicators and skewed data distributions. To tackle those challenges, in this paper, we propose a framework DelvMap to complete missing roads in maps based on couriers’ trajectories and satellite images. DelvMap first leverages a dual signal fusion network (DSFNet) to extract an inferred map from both data modalities, which fully exploits the positive and negative signals in the satellite images to fuse with roads indicated from trajectories, then employs a map completion algorithm to complete the existing map with the inferred map, the connection strategy of which is adaptive to the number of traversing trajectories. Experiments show DelvMap outperforms baselines by at least 11.0% in TOPO F1 on the real-world dataset. Finally, we demonstrate a multi-modal map updating system based on DelvMap.