31 citations · 57 across the 15 of their papers we have counts for
8 papers · 1 filter
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Kai Wang, Wenjie Zhang, Xuemin Lin +3
Bipartite graphs are widely used to model relationships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has b…
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…
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
Michael Yu, Lu Qin, Ying Zhang +2
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orient…
Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems
Yuanhang Yu, Dong Wen, Ying Zhang +3
Matrix Factorization (MF) has been widely applied in machine learning and data mining. A large number of algorithms have been studied to factorize matrices. Among them, stochastic…
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions
Hanchen Wang, Defu Lian, Ying Zhang +2
Entity interaction prediction is essential in many important applications such as chemistry, biology, material science, and medical science. The problem becomes quite challenging w…
Binarized Graph Neural Network
Hanchen Wang, Defu Lian, Ying Zhang +4
Recently, there have been some breakthroughs in graph analysis by applying the graph neural networks (GNNs) following a neighborhood aggregation scheme, which demonstrate outstandi…