Xiaolin Han

Orcid: 0000-0002-4347-1692

Affiliations:
  • Northwestern Polytechnical University, Xi'an, China
  • University of Hong Kong, Department of Computer Science, Hong Kong (former)


According to our database1, Xiaolin Han authored at least 19 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Hypergraph-Enhanced Multi-Granularity Stochastic Weight Completion in Sparse Road Networks.
ACM Trans. Knowl. Discov. Data, April, 2025

Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density.
CoRR, April, 2025

Cross-modal multi-relational graph reasoning: A novel model for multimodal textbook comprehension.
Inf. Fusion, 2025

ReadGraph: Relational Evolution Enhanced Anomaly Detection in Dynamic Heterogeneous Graph.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2025, 2025

SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search.
Proceedings of the Companion of the 2025 International Conference on Management of Data, 2025

UTCS: Effective Unsupervised Temporal Community Search with Pre-training of Temporal Dynamics and Subgraph Knowledge.
Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2025

2024
Accelerating directed densest subgraph queries with software and hardware approaches.
VLDB J., January, 2024

FDM: Effective and efficient incident detection on sparse trajectory data.
Inf. Syst., 2024

Spatial-temporal Memories Enhanced Graph Autoencoder for Anomaly Detection in Dynamic Graphs.
CoRR, 2024

TRoute: Dynamic Time-Dependent Route Recommendation on Road Networks.
Proceedings of the Web Information Systems and Applications, 2024

2022
A framework for differentially-private knowledge graph embeddings.
J. Web Semant., 2022

Finding Locally Densest Subgraphs: A Convex Programming Approach.
Proc. VLDB Endow., 2022

DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection.
Proc. VLDB Endow., 2022

A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks.
Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2020
An ML-Powered Human Behavior Management System.
IEEE Data Eng. Bull., 2020

Traffic Incident Detection: A Trajectory-based Approach.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

M-Cypher: A GQL Framework Supporting Motifs.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Traffic Incident Detection: A Deep Learning Framework.
Proceedings of the 20th IEEE International Conference on Mobile Data Management, 2019


  Loading...