6 papers
Adaptive Graph Refinement and Label Propagation with LLMs for Cost-Effective Entity Resolution
Hongtao Wang, Renchi Yang, Haoran Zheng +1
Dirty entity resolution (ER), which identifies records referring to the same real-world entity from a single, messy dataset, is a fundamental task in data management and mining. Ho…
Cross-Contrastive Clustering for Multimodal Attributed Graphs with Dual Graph Filtering
Haoran Zheng, Renchi Yang, Hongtao Wang +1
Multimodal Attributed Graphs (MMAGs) are an expressive data model for representing the complex interconnections among entities that associate attributes from multiple data modaliti…
Rethinking Message Passing Neural Networks with Diffusion Distance-guided Stress Majorization
Haoran Zheng, Renchi Yang, Yubo Zhou +1
Message passing neural networks (MPNNs) have emerged as go-to models for learning on graph-structured data in the past decade. Despite their effectiveness, most of such models stil…
SAFT: Structure-aware Transformers for Textual Interaction Classification
Hongtao Wang, Renchi Yang, Hewen Wang +2
Textual interaction networks (TINs) are an omnipresent data structure used to model the interplay between users and items on e-commerce websites, social networks, etc., where each…
Adaptive Local Clustering over Attributed Graphs
Haoran Zheng, Renchi Yang, Jianliang Xu
Given a graph and a seed node , the objective of local graph clustering (LGC) is to identify a subgraph (a.k.a. local cluster) surrounding in time roughl…
GraSP: Simple yet Effective Graph Similarity Predictions
Haoran Zheng, Jieming Shi, Renchi Yang
Graph similarity computation (GSC) is to calculate the similarity between one pair of graphs, which is a fundamental problem with fruitful applications in the graph community. In G…