Jinquan Hang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jinquan Hang has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Desheng Zhang
Rutgers University
5 shared publications - Guang Yang
Rutgers University, Piscataway, USA
5 shared publications - Xinyue Feng
Rutgers University, Piscataway, NJ, USA
4 shared publications - Guang Wang
Florida State University, Tallahassee, FL, USA
3 shared publications - Yuequn Zhang
Rutgers University, Piscataway, NJ, USA
3 shared publications - Haotian Wang
JD Logistics, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5658-5665
NeighSqueeze: Compact Neighborhood Grouping for Efficient Billion-Scale Heterogeneous Graph Learning
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5658-5665
Open AccessNeighSqueeze: Compact Neighborhood Grouping for Efficient Billion-Scale Heterogeneous Graph Learning
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 4424-4434
Hierarchical Structure Sharing Empowers Multi-task Heterogeneous GNNs for Customer Expansion
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 4424-4434
Open AccessHierarchical Structure Sharing Empowers Multi-task Heterogeneous GNNs for Customer Expansion
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2827-2836
Behavior-Aware Hypergraph Convolutional Network for Illegal Parking Prediction with Multi-Source Contextual Information
Illegal parking prediction is a crucial problem to help stakeholders with better urban planning and management. Existing works advance the field by capturing complex traffic correlations from spatial and temporal perspectives using deep learning models, and achieve state-of-the-art performance. However, current works do not consider the unique perspective from the illegal parking data collection process carried out by patrol officers, which can reflect a wealth of knowledge gained from each officer's on-the-ground experiences for more effective patrol. In this paper, we propose a novel behavior-aware hypergraph convolutional network named BHIPP for city-wide illegal parking prediction. To better represent the correlations of illegal parking events from patrol officers' perspective, we construct a new patrol hypergraph integrating patrol officers' experience alongsie multi-source contextual information. Additionally, we design a behavior-aware hypergraph convolutional network, which captures the complex and high-order illegal parking event correlations with officers' patrol behaviors explicitly considered. Further, we introduce a spatial-temporal illegal parking approximation module to estimate parking violations in under-patrolled regions using both historical and multi-source contextual data. Extensive experiments on real-world datasets demonstrate the superiority of our proposed BHIPP compared with a broad range of state-of-the-art baseline models across varying spatial-temporal granularities, from both regression and ranking aspects.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2827-2836
Open AccessBehavior-Aware Hypergraph Convolutional Network for Illegal Parking Prediction with Multi-Source Contextual Information
Illegal parking prediction is a crucial problem to help stakeholders with better urban planning and management. Existing works advance the field by capturing complex traffic correlations from spatial and temporal perspectives using deep learning models, and achieve state-of-the-art performance. However, current works do not consider the unique perspective from the illegal parking data collection process carried out by patrol officers, which can reflect a wealth of knowledge gained from each officer's on-the-ground experiences for more effective patrol. In this paper, we propose a novel behavior-aware hypergraph convolutional network named BHIPP for city-wide illegal parking prediction. To better represent the correlations of illegal parking events from patrol officers' perspective, we construct a new patrol hypergraph integrating patrol officers' experience alongsie multi-source contextual information. Additionally, we design a behavior-aware hypergraph convolutional network, which captures the complex and high-order illegal parking event correlations with officers' patrol behaviors explicitly considered. Further, we introduce a spatial-temporal illegal parking approximation module to estimate parking violations in under-patrolled regions using both historical and multi-source contextual data. Extensive experiments on real-world datasets demonstrate the superiority of our proposed BHIPP compared with a broad range of state-of-the-art baseline models across varying spatial-temporal granularities, from both regression and ranking aspects.
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5082-5092
Paths2Pair: Meta-path Based Link Prediction in Billion-Scale Commercial Heterogeneous Graphs
Link prediction, determining if a relation exists between two entities, is an essential task in the analysis of heterogeneous graphs with diverse entities and relations. Despite extensive research in link prediction, most existing works focus on predicting the relation type between given pairs of entities. However, it is almost impractical to check every entity pair when trying to find most hidden relations in a billion-scale heterogeneous graph due to the billion squared number of possible pairs. Meanwhile, most methods aggregate information at the node level, potentially leading to the loss of direct connection information between the two nodes. In this paper, we introduce Paths2Pair, a novel framework to address these limitations for link prediction in billion-scale commercial heterogeneous graphs. (i) First, it selects a subset of reliable entity pairs for prediction based on relevant meta-paths. (ii) Then, it utilizes various types of content information from the meta-paths between each selected entity pair to predict whether a target relation exists. We first evaluate our Paths2Pair based on a large-scale dataset, and results show Paths2Pair outperforms state-of-the-art baselines significantly. We then deploy our Paths2Pair on JD Logistics, one of the largest logistics companies in the world, for business expansion. The uncovered relations by Paths2Pair have helped JD Logistics identify 108,709 contacts to attract new company customers, resulting in an 84% increase in the success rate compared to the state-of-the-practice solution, demonstrating the practical value of our framework. We have released the code of our framework at https://github.com/JQHang/Paths2Pair.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5082-5092
Open AccessPaths2Pair: Meta-path Based Link Prediction in Billion-Scale Commercial Heterogeneous Graphs
Link prediction, determining if a relation exists between two entities, is an essential task in the analysis of heterogeneous graphs with diverse entities and relations. Despite extensive research in link prediction, most existing works focus on predicting the relation type between given pairs of entities. However, it is almost impractical to check every entity pair when trying to find most hidden relations in a billion-scale heterogeneous graph due to the billion squared number of possible pairs. Meanwhile, most methods aggregate information at the node level, potentially leading to the loss of direct connection information between the two nodes. In this paper, we introduce Paths2Pair, a novel framework to address these limitations for link prediction in billion-scale commercial heterogeneous graphs. (i) First, it selects a subset of reliable entity pairs for prediction based on relevant meta-paths. (ii) Then, it utilizes various types of content information from the meta-paths between each selected entity pair to predict whether a target relation exists. We first evaluate our Paths2Pair based on a large-scale dataset, and results show Paths2Pair outperforms state-of-the-art baselines significantly. We then deploy our Paths2Pair on JD Logistics, one of the largest logistics companies in the world, for business expansion. The uncovered relations by Paths2Pair have helped JD Logistics identify 108,709 contacts to attract new company customers, resulting in an 84% increase in the success rate compared to the state-of-the-practice solution, demonstrating the practical value of our framework. We have released the code of our framework at https://github.com/JQHang/Paths2Pair.
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 2939-2948
CARPG: Cross-City Knowledge Transfer for Traffic Accident Prediction via Attentive Region-Level Parameter Generation
Traffic accident prediction is a crucial problem for public safety, emergency treatment, and urban management. Existing works leverage extensive data collected from city infrastructures to achieve encouraging performance based on various machine learning techniques but cannot achieve a good performance in situations with limited data (i.e., data scarcity). Recent developments in transfer learning bring a new opportunity to solve the data scarcity problem. In this paper, we design a novel cross-city transfer learning framework named CARPG for predicting traffic accidents in data-scarce cities. We address the unique challenge of predicting traffic accidents caused by its two fundamental characteristics, i.e., spatial heterogeneity and inherent rareness, which result in the biased performance of the state-of-the-art transfer learning methods. Specifically, we build cross-city region connections by jointly learning the spatial region representations for both source and target cities with an inter-city global graph knowledge transfer process. Further, we design an efficient attention-based parameter-generating mechanism to learn region-specific traffic accident patterns, while controlling the total number of parameters. Built upon that, we ensure that only relevant patterns are transferred to each target region during the knowledge transfer process and further to be fine-tuned. We conduct extensive experiments on three real-world datasets, and the evaluation results demonstrate the superiority of our framework compared with state-of-the-art baseline models.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 2939-2948
Open AccessCARPG: Cross-City Knowledge Transfer for Traffic Accident Prediction via Attentive Region-Level Parameter Generation
Traffic accident prediction is a crucial problem for public safety, emergency treatment, and urban management. Existing works leverage extensive data collected from city infrastructures to achieve encouraging performance based on various machine learning techniques but cannot achieve a good performance in situations with limited data (i.e., data scarcity). Recent developments in transfer learning bring a new opportunity to solve the data scarcity problem. In this paper, we design a novel cross-city transfer learning framework named CARPG for predicting traffic accidents in data-scarce cities. We address the unique challenge of predicting traffic accidents caused by its two fundamental characteristics, i.e., spatial heterogeneity and inherent rareness, which result in the biased performance of the state-of-the-art transfer learning methods. Specifically, we build cross-city region connections by jointly learning the spatial region representations for both source and target cities with an inter-city global graph knowledge transfer process. Further, we design an efficient attention-based parameter-generating mechanism to learn region-specific traffic accident patterns, while controlling the total number of parameters. Built upon that, we ensure that only relevant patterns are transferred to each target region during the knowledge transfer process and further to be fine-tuned. We conduct extensive experiments on three real-world datasets, and the evaluation results demonstrate the superiority of our framework compared with state-of-the-art baseline models.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 12-16
Autonomous Road-Traveling and Monitoring Robot
In order to solve the problem that outdoor patrolling mission will be waste of manpower and material resources, this paper designs an autonomous Road-traveling and Monitoring Robot based on Track Car. This system includes the computer software and track car robot. The user can send the instruction to the crawler robot through the host computer software written in C # language. The tracker robot selects the STM32 as a controller to receive the user's instructions and then enters the manual control mode or the automatic patrol mode. User can establish track car robot's patrolling route through computer software's instruction. The system can effectively deal with outdoor patrolling mission, saving manpower and resources. The experimental results show that the system has the characteristics of smooth operation and strong reliability.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 12-16
Autonomous Road-Traveling and Monitoring Robot
In order to solve the problem that outdoor patrolling mission will be waste of manpower and material resources, this paper designs an autonomous Road-traveling and Monitoring Robot based on Track Car. This system includes the computer software and track car robot. The user can send the instruction to the crawler robot through the host computer software written in C # language. The tracker robot selects the STM32 as a controller to receive the user's instructions and then enters the manual control mode or the automatic patrol mode. User can establish track car robot's patrolling route through computer software's instruction. The system can effectively deal with outdoor patrolling mission, saving manpower and resources. The experimental results show that the system has the characteristics of smooth operation and strong reliability.