7 citations · 8 across the 3 of their papers we have counts for
4 papers
Interpretable Unsupervised Community Detection with LLM-Symbolized Structured Processes
Aoting Zeng, Kai Wang, Jianwei Wang +3
Community detection is a fundamental task in graph analytics that aims to identify cohesive groups of entities with similar behaviors or interests. Classic objective-driven methods…
Motif Counting in Complex Networks: A Comprehensive Survey
Haozhe Yin, Kai Wang, Wenjie Zhang +3
Motif counting plays a crucial role in understanding the structural properties of networks. By computing motif frequencies, researchers can draw key insights into the structural pr…
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
Yizhang He, Kai Wang, Wenjie Zhang +2
Bipartite graphs, formed by two vertex layers, arise as a natural fit for modeling the relationships between two groups of entities. In bipartite graphs, common neighborhood comput…
Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs
Yizhang He, Kai Wang, Wenjie Zhang +2
We propose a novel cohesive subgraph model called -strengthened -core (denoted as -core), which is the first to consider both tie strength and vertex engagement…