Lu Jiang 0007

dblp:22/752-7 · DBLP profile ↗
← Back
13ranked-venue papers in the field
4as first author
10since 2021 · last 2026
0000-0003-4529-8114ORCID · conflict

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 8 (4 first)Database Systems & Data Management · 2Information Retrieval & Web Search · 2Big Data, Cloud & Distributed Data Systems · 1
YearPublicationVenuePosition
2026 Shift-Resilient Diffusive Imputation for Variable Subset Forecasting
Haihua Xu 0005, Qi Hao 0001, Jianpeng Zhao 0001, Ziyue Qiao, Lu Jiang 0007, Pengfei Wang 0008, Yingjie Zhou 0001, Pengyang Wang
WWW6
2025 SciTopic: Enhancing Topic Discovery in Scientific Literature Through Advanced LLM
Pengjiang Li 0001, Zaitian Wang, Xinhao Zhang 0001, Ran Zhang 0008, Lu Jiang 0007, Pengfei Wang 0008, Yuanchun Zhou
IEEE Big Data5
2025 UrbanXplain: A Language-Driven Urban Planning System with Explainable Reasoning and Real-Time 3D Rendering
abstract
We present UrbanXplain, a language-driven urban planning system that combines real-time 3D rendering with explainable reasoning. UrbanXplain enables an integrated planning workflow driven entirely by natural language input. This includes steps from functional zoning to land use implementation. The system uses a large language models (LLMs) to perform spatial inference. It converts high-level planning goals into structured zoning commands, assigns building functions such as residential, commercial, or cultural, and creates layout plans that respect constraints like height, material, and accessibility. A Unity3D-based simulator renders the output design in real time, allowing users to explore and interact with the results. A key feature of UrbanXplain is its support for reasoning traceability. For each decision, the system displays its semantic parsing, zoning logic, and siting justifications. This ensures transparency and supports iterative refinement. We evaluate UrbanX-plain in three scenario-based experiments: 15 minute city design, green infrastructure planning, and energy efficient mixed-use layouts. These cases show LLMs supporting interpretable, adaptive, and cognitively accessible urban planning.
Yanan Xiao, Yinan Xiao, Lu Jiang 0007, Minghao Yin, Pengyang Wang
SIGSPATIAL/GIS4
2025 Imputation via Domain Adaptation: Rethinking Variable Subset Forecasting from Knowledge Transfer
abstract
Multivariate time series forecasting in practical deployment faces a critical challenge termed Variable Subset Forecasting (VSF), where certain variables accessible during training are entirely missing during inference. This creates a stark discrepancy between the training (source domain with full variables) and inference (target domain with partial variables) environments, disrupting cross-variable dependencies and fragmenting global temporal patterns. Existing imputation methods, limited to transferring local knowledge (e.g., temporal neighbors or pairwise correlations), fail to capture essential global dynamics, leading to severe performance degradation under distribution shifts. To address these challenges, we redefine VSF as a cross-domain knowledge transfer problem and propose VIDA, a framework that systematically transfers Variable Invariant knowledge from complete to partial observations through Domain Adaptation. Key to our approach is (1) Global time-frequency joint representation learning, which encodes temporal dynamics via dilated convolutions and captures low-frequency spectral consistency using Fourier neural operators, and (2) Sinkhorn-regularized distribution alignment to bridge non-overlapping feature supports across domains via optimal transport. Unlike imputation-first methods, VIDA enforces task-driven consistency by jointly optimizing predictions on reconstructed and original data, ensuring the transferred knowledge directly enhances forecasting robustness. Extensive experiments across four real-world datasets show that VIDA outperforms state-of-the-art imputation methods by 25% on average with partially observed variables. This work establishes a new paradigm for variable-missing scenarios by unifying imputation and forecasting through principled knowledge transfer.
Runchang Liang, Qi Hao 0001, Yue Gao 0015, Kunpeng Liu 0001, Lu Jiang 0007, Pengyang Wang, Minghao Yin
KDD (2)5
2025 Understanding User Perspectives for MOOC Quality Evaluation with Hypergraph Learning
abstract
Evaluation of Massive Open Online Course (MOOC) quality is crucial to enhance the educational resources, benefiting user services, and enhancing students’ learning efficiency. Despite achieving encouraging results, current efforts are hindered by complex relationships between entities and individual varies. To address the above problem, in this article, we frame the issue as a task of learning course representations and proceed to develop an U ser-Centric H ypergraph R epresentation L earning ( UHRL ) for online course quality evaluation. In particular, we initially construct a MOOC hypergraph to depict the interactions and connections between the entities and use cross-hyperedge alignment to reveal the semantics of courses. And then we incorporate an attention mechanism in the information transmission process to ensure semantic integrity. Furthermore, to tackle the bias of users’ preference, our framework exploits mutual information for preserving the fairness of representation learning. Finally, our comprehensive experiments on three real-world datasets confirm the effectiveness of our approach compared to cutting-edge methods in evaluating online course quality across various performance metrics.
Lu Jiang 0007, Ruilou Zhang, Yanan Xiao, Kunpeng Liu 0001, Minghao Yin
ACM Trans. Knowl. Discov. Data1
2025 Is Precise Recovery Necessary? A Task-Oriented Imputation Approach for Time Series Forecasting on Variable Subset
abstract
Variable Subset Forecasting (VSF) refers to a unique scenario in multivariate time series forecasting, where available variables in the inference phase are only a subset of the variables in the training phase. VSF presents significant challenges as the entire time series may be missing, and neither inter- nor intra-variable correlations persist. Such conditions impede the effectiveness of traditional imputation methods, primarily focusing on filling in individual missing data points. Inspired by the principle of feature engineering that not all variables contribute positively to forecasting, we proposeTask-OrientedImputation forVSF(TOI-VSF), a novel framework shifts the focus from accurate data recovery to directly support the downstream forecasting task. TOI-VSF incorporates a self-supervised imputation module, agnostic to the forecasting model, designed to fill in missing variables while preserving the vital characteristics and temporal patterns of time series data. Additionally, we implement a joint learning strategy for imputation and forecasting, ensuring that the imputation process is directly aligned with and beneficial to the forecasting objective. Extensive experiments across four datasets demonstrate the superiority of TOI-VSF, outperforming baseline methods by 15% on average.
Qi Hao 0001, Runchang Liang, Yue Gao 0015, Hao Dong 0010, Wei Fan 0010, Lu Jiang 0007, Pengyang Wang
IEEE Trans. Knowl. Data Eng.6
2024 Towards Dynamic University Course Timetabling Problem: An Automated Approach Augmented via Reinforcement Learning
abstract
University Course Timetabling Problem (UCTP) is a significant resource allocation challenge with NP-hard characteristics. As problem sizes increase, finding an optimal solution becomes increasingly complex. To address this, we propose an automated planning method using Reinforcement Learning (RL), which treats UCTP as a series of dynamic decision-making tasks. The RL agent acts as an automated planner, operating in a simulated environment that reflects the complexity and constraints of a university course. It adapts to changes in the timetable by evaluating the outcomes of its actions, continuously refining its strategy to identify and implement the most effective actions. During the explore phase, the agent tests new strategies using a priority-driven reward system and an experience replay mechanism. This approach replays high-value actions, enhancing solution diversity and reducing the search space. In the exploit phase, the agent leverages its accumulated knowledge to apply proven effective strategies. It also incorporates unbiased external evaluations to avoid local optima and ensure global optimization of its strategy. Extensive testing on multiple real-world datasets shows that our automated planning framework consistently outperforms existing methods in various complex scheduling scenarios. This confirms its effectiveness and practicality in meeting diverse scheduling needs.
Yanan Xiao, XiangLin Li, Lu Jiang 0007, Pengfei Wang 0008
ICDM3
2023 Reinforced Explainable Knowledge Concept Recommendation in MOOCs
abstract
In this article, we study knowledge concept recommendation in Massive Open Online Courses (MOOCs) in an explainable manner. Knowledge concepts, composing course units (e.g., videos) in MOOCs, refer to topics and skills that students are expected to master. Compared to traditional course recommendation in MOOCs, knowledge concepts recommendation has drawn more attention because students’ interests over knowledge concepts can better revealstudents’ real intention in a more refined granularity. However, there are three unique challenges in knowledge concept recommendation: (1) How to design an appropriate data structure to capture complex relationships between knowledge concepts, course units, and other participants (e.g., students, teachers)? (2) How to model interactions between students and knowledge concepts? (3) How to make explainable recommendation results to students? To tackle these challenges, we formulate the knowledge concept recommendation as a reinforcement learning task integrated with MOOC knowledge graph (KG). Specifically, we first construct MOOC KG as the environment to capture all the relationships and behavioral histories by considering all the entities (e.g., students, teachers, videos, courses, and knowledge concepts) on the MOOC provider. Then, to model the interactions between students and knowledge concepts, we train an agent to mimic students’ learning behavioral patterns facing the complex environment. Moreover, to provide explainable recommendation results, we generate recommended knowledge concepts in the format of a path from MOOC KG to indicate semantic reasons. Finally, we conduct extensive experiments on a real-world MOOC dataset to demonstrate the effectiveness of our proposed method.
Lu Jiang 0007, Kunpeng Liu 0001, Yibin Wang 0007, Dongjie Wang 0001, Pengyang Wang, Yanjie Fu, Minghao Yin
ACM Trans. Intell. Syst. Technol.1
2021 Augmenting Personalized Question Recommendation with Hierarchical Information for Online Test Platform
Lu Jiang 0007, Wanfei Zhang, Yibin Wang 0007, Lin Yue
ADMA1
2021 EduHawkes: A Neural Hawkes Process Approach for Online Study Behavior Modeling
abstract
The COVID-19 pandemic forces schools to move teaching online and stimulates the development of online tutoring platforms.Although online tutoring platforms provide students the access to learning materials and tools anytime and anywhere, the quality of studies is impeded by the fact that students learn by watching videos, which lacks interactions between teachers and students.Such dilemma prevents us from respectively understanding and improving the online learning patterns and efficiency of students.To achieve this goal, we need to solve three challenges: (1) How can we quantify the study quality of online learning?(2) How can we design an appropriate data structure to describe online study behaviors?(3) How can we model the online study behaviors to better mine online study patterns?To address the challenges, we first propose a new measurement to quantify the online study quality from the perspective of study engagement.We then define a study behavior sequence to describe online study behaviors.The study behavior at each timestamp is an event of a video lecture watching behavior type, such as, watching, dragging forward and dragging backward.Moreover, we develop a neural hawkes process framework (namely EduHawkes ) for online study behavior modeling.The EduHawkes is a novel hierarchical encode-decode architecture with simultaneously optimizing the study behavior prediction task (event-level) and the study quality prediction task (course-level).In the experiments, we apply EduHawkes to the applications of study quality prediction and flippant student identification in order to demonstrate the improved performances of our proposed method on modeling online study behaviors.
Lu Jiang 0007, Pengyang Wang, Ke Cheng 0003, Kunpeng Liu 0001, Minghao Yin, Bo Jin 0001, Yanjie Fu
SDM1
2020 Partial Relationship Aware Influence Diffusion via a Multi-channel Encoding Scheme for Social Recommendation
abstract
Social recommendation tasks exploit social connections to enhance recommendation performance. To fully utilize each user's first-order and high-order neighborhood preferences, recent approaches incorporate influence diffusion process for better user preference modeling. Despite the superior performance of these models, they either neglect the latent individual interests hidden in the user-item interactions or rely on computationally expensive graph attention models to uncover the item-induced sub-relations, which essentially determine the influence propagation passages. Considering the sparse substructures are derived from original social network, we name them as partial relationships between users. We argue such relationships can be directly modeled such that both personal interests and shared interests can propagate along a few channels (or dimensions) of latent users' embeddings. To this end, we propose a partial relationship aware influence diffusion structure via a computationally efficient multi-channel encoding scheme. Specifically, the encoding scheme first simplifies graph attention operation based on a channel-wise sparsity assumption, and then adds an InfluenceNorm function to maintain such sparsity. Moreover, ChannelNorm is designed to alleviate the oversmoothing problem in graph neural network models. Extensive experiments on two benchmark datasets show that our method is comparable to state-of-the-art graph attention-based social recommendation models while capturing user interests according to partial relationships more efficiently.
Bo Jin 0001, Ke Cheng 0003, Liang Zhang 0031, Yanjie Fu, Minghao Yin, Lu Jiang 0007
CIKM6
2020 Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agent
abstract
Feature selection aims to select a subset of features to optimize the performances of downstream predictive tasks. Recently, multi-agent reinforced feature selection (MARFS) has been introduced to automate feature selection, by creating agents for each feature to select or deselect corresponding features. Although MARFS enjoys the automation of the selection process, MARFS suffers from not just the data complexity in terms of contents and dimensionality, but also the exponentially-increasing computational costs with regard to the number of agents. The raised concern leads to a new research question: Can we simplify the selection process of agents under reinforcement learning context so as to improve the efficiency and costs of feature selection? To address the question, we develop a single-agent reinforced feature selection approach integrated with restructured choice strategy. Specifically, the restructured choice strategy includes: 1) we exploit only one single agent to handle the selection task of multiple features, instead of using multiple agents. 2) we develop a scanning method to empower the single agent to make multiple selection/deselection decisions in each round of scanning. 3) we exploit the relevance to predictive labels of features to prioritize the scanning orders of the agent for multiple features. 4) we propose a convolutional auto-encoder algorithm, integrated with the encoded index information of features, to improve state representation. 5) we design a reward scheme that take into account both prediction accuracy and feature redundancy to facilitate the exploration process. Finally, we present extensive experimental results to demonstrate the efficiency and effectiveness of the proposed method.
Xiaosa Zhao, Kunpeng Liu 0001, Wei Fan 0010, Lu Jiang 0007, Xiaowei Zhao 0004, Minghao Yin, Yanjie Fu
ICDM4
2020 Incremental Mobile User Profiling: Reinforcement Learning with Spatial Knowledge Graph for Modeling Event Streams
abstract
We study the integration of reinforcement learning and spatial knowledge graph for incremental mobile user profiling, which aims to map mobile users to dynamically-updated profile vectors by incremental learning from a mixed-user event stream. After exploring many profiling methods, we identify a new imitation based criteria to better evaluate and optimize profiling accuracy. Considering the objective of teaching an autonomous agent to imitate a mobile user to plan next-visit based on the user's profile, the user profile is the most accurate when the agent can perfectly mimic the activity patterns of the user. We propose to formulate the problem into a reinforcement learning task, where an agent is a next-visit planner, an action is a POI that a user will visit next, and the state of environment is a fused representation of a user and spatial entities (e.g., POIs, activity types, functional zones). An event that a user takes an action to visit a POI, will change the environment, resulting into a new state of user profiles and spatial entities, which helps the agent to predict next visit more accurately. After analyzing such interactions among events, users, and spatial entities, we identify (1)semantic connectivity among spatial entities, and, thus, introduce a spatial Knowledge Graph (KG) to characterize the semantics of user visits over connected locations, activities, and zones. Besides, we identify (2) mutual influence between users and the spatial KG, and, thus, develop a mutual-updating strategy between users and the spatial KG, mixed with temporal context, to quantify the state representation that evolves over time. Along these lines, we develop a reinforcement learning framework integrated with spatial KG. The proposed framework can achieve incremental learning in multi-user profiling given a mixed-user event stream. Finally, we apply our approach to human mobility activity prediction and present extensive experiments to demonstrate improved performances.
Pengyang Wang, Kunpeng Liu 0001, Lu Jiang 0007, Yanjie Fu
KDD3