Xuemin Lin
4 papers in the PaperMetrix corpus
Papers by this author
-
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
2020
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is …
-
Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method
2022 · arXiv (Cornell University)
A large number of studies on Graph Outlier Detection (GOD) have emerged in recent years due to its wide applications, in which Unsupervised Node Outlier Detection (UNOD) on attributed networks is an important area. UNOD …
-
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing
2025 · Proceedings of the VLDB Endowment
Missing data imputation, which aims to impute the missing values in the raw datasets, is crucial for modern data-driven models like large language models (LLMs). Despite its importance, existing solutions either 1) only support numerical …
-
Unlocking Multi-Modal Potentials for Link Prediction on Dynamic Text-Attributed Graphs
2025 · arXiv (Cornell University)
Dynamic Text-Attributed Graphs (DyTAGs) are a novel graph paradigm that captures evolving temporal events (edges) alongside rich textual attributes. Existing studies can be broadly categorized into TGNN-driven and LLM-driven approaches, both of which encode textual …