Bio


I am a Postdoctoral Scholar in AI for biomedical data science at Stanford University, under the supervision of Prof. Mark Musen. Prior to that, I received my Ph.D. (with summa cum laude) in computer science at University of Stuttgart, Germany and the Intl. Max Plank Research School for Intelligent Systems (IMPRS-IS), under the supervision of Prof. Steffen Staab. My PhD was funded by the prestigious Marie Curie PhD Fellowship. I was also an associate member of the TrustAGI Lab at Griffith University, Australia, advised by Prof. Shirui Pan.

Honors & Awards


  • Best Dissertation Award in Computer Science, University of Stuttgart (2024)
  • Publication Prize in 2022, University of Stuttgart (2023)
  • Spotlight Scholar, International Max Plan Research School for Intelligent Systems (IMPRS) (2023)
  • Best Student Paper Award, International Semantic Web Conference (ISWC) (2022)

Professional Education


  • Ph.D., Intl. Max Plank Research School for Intelligent Systems (IMPRS-IS), Computer Science (2024)
  • Ph.D., University of Stuttgart, Computer Science (2024)

Stanford Advisors


Current Research and Scholarly Interests


AI, Foundation Models, Biomedical Data Science

All Publications


  • Towards Expressive Spectral-Temporal Graph Neural Networks for Time Series Forecasting IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE Jin, M., Shi, G., Li, Y., Xiong, B., Zhou, T., Salim, F. D., Zhao, L., Wu, L., Wen, Q., Pan, S. 2025; 47 (6): 4926-4939

    Abstract

    Time series forecasting has remained a focal point due to its vital applications in sectors such as energy management and transportation planning. Spectral-temporal graph neural network is a promising abstraction underlying most time series forecasting models that are based on graph neural networks (GNNs). However, more is needed to know about the underpinnings of this branch of methods. In this paper, we establish a theoretical framework that unravels the expressive power of spectral-temporal GNNs. Our results show that linear spectral-temporal GNNs are universal under mild assumptions, and their expressive power is bounded by our extended first-order Weisfeiler-Leman algorithm on discrete-time dynamic graphs. To make our findings useful in practice on valid instantiations, we discuss related constraints in detail and outline a theoretical blueprint for designing spatial and temporal modules in spectral domains. Building on these insights and to demonstrate how powerful spectral-temporal GNNs are based on our framework, we propose a simple instantiation named Temporal Graph Gegenbauer Convolution (TGGC), which significantly outperforms most existing models with only linear components and shows better model efficiency.

    View details for DOI 10.1109/TPAMI.2025.3545671

    View details for Web of Science ID 001484716600031

    View details for PubMedID 40031664

  • HypMix: Hyperbolic Representation Learning for Graphs with Mixed Hierarchical and Non-hierarchical Structures. Proceedings of the ... ACM International Conference on Information & Knowledge Management. ACM International Conference on Information and Knowledge Management Lee, E. W., Xiong, B., Yang, C., Ho, J. C. 2024; 2024: 3852-3856

    Abstract

    Heterogeneous networks contain multiple types of nodes and links, with some link types encapsulating hierarchical structure over entities. Hierarchical relationships can codify information such as subcategories or one entity being subsumed by another and are often used for organizing conceptual knowledge into a tree-structured graph. Hyperbolic embedding models learn node representations in a hyperbolic space suitable for preserving the hierarchical structure. Unfortunately, current hyperbolic embedding models only implicitly capture the hierarchical structure, failing to distinguish between node types, and they only assume a single tree. In practice, many networks contain a mixture of hierarchical and non-hierarchical structures, and the hierarchical relations may be represented as multiple trees with complex structures, such as sharing certain entities. In this work, we propose a new hyperbolic representation learning model that can handle complex hierarchical structures and also learn the representation of both hierarchical and non-hierarchic structures. We evaluate our model on several datasets, including identifying relevant articles for a systematic review, which is an essential tool for evidence-driven medicine and node classification.

    View details for DOI 10.1145/3627673.3679940

    View details for PubMedID 40018085

    View details for PubMedCentralID PMC11867734