24 citations · 51 across the 12 of their papers we have counts for
12 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…
In-context Clustering-based Entity Resolution with Large Language Models: A Design Space Exploration
Jiajie Fu, Haitong Tang, Arijit Khan +3
Entity Resolution (ER) is a fundamental data quality improvement task that identifies and links records referring to the same real-world entity. Traditional ER approaches often rel…
SliceGX: Layer-wise GNN Explanation with Model-slicing
Tingting Zhu, Tingyang Chen, Yinghui Wu +2
Ensuring the trustworthiness of graph neural networks (GNNs), which are often treated as black-box models, requires effective explanation techniques. Existing GNN explanations typi…
Graph Data Management and Graph Machine Learning: Synergies and Opportunities
Arijit Khan, Xiangyu Ke, Yinghui Wu
The ubiquity of machine learning, particularly deep learning, applied to graphs is evident in applications ranging from cheminformatics (drug discovery) and bioinformatics (protein…
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
Xinwei Cai, Xiangyu Ke, Kai Wang +4
Bipartite graphs characterize relationships between two different sets of entities, like actor-movie, user-item, and author-paper. The butterfly, a 4-vertices 4-edges (2,2)-bicliqu…
Most Probable Densest Subgraphs
Arkaprava Saha, Xiangyu Ke, Arijit Khan +1
Computing the densest subgraph is a primitive graph operation with critical applications in detecting communities, events, and anomalies in biological, social, Web, and financial n…
Random Walk-based Community Key-members Search over Large Graphs
Yuxiang Wang, Yuyang Zhao, Xiaoliang Xu +3
Given a graph , a query node , and an integer , community search (CS) seeks a cohesive subgraph (measured by community models such as -core or -truss) from that…
Voting-based Opinion Maximization
Arkaprava Saha, Xiangyu Ke, Arijit Khan +1
We investigate the novel problem of voting-based opinion maximization in a social network: Find a given number of seed nodes for a target campaigner, in the presence of other compe…
Multi-relation Graph Summarization
Xiangyu Ke, Arijit Khan, Francesco Bonchi
Graph summarization is beneficial in a wide range of applications, such as visualization, interactive and exploratory analysis, approximate query processing, reducing the on-disk s…
An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs
Xiangyu Ke, Arijit Khan, Leroy Lim Hong Quan
Uncertain, or probabilistic, graphs have been increasingly used to represent noisy linked data in many emerging applications, and have recently attracted the attention of the datab…
Reliability Maximization in Uncertain Graphs
Xiangyu Ke, Arijit Khan, Mohammad Al Hasan +1
Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probabili…
Select Your Questions Wisely: For Entity Resolution With Crowd Errors
Vijaya Krishna Yalavarthi, Xiangyu Ke, Arijit Khan
Crowdsourcing is becoming increasingly important in entity resolution tasks due to their inherent complexity such as clustering of images and natural language processing. Humans ca…