5 papers
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
Yiqi Wang, Long Yuan, Wenjie Zhang +3
Top-k Nearest Neighbors (kNN) problem on road network has numerous applications on location-based services. As direct search using the Dijkstra's algorithm results in a large searc…
GPUSCAN:Efficient Structural Graph Clustering on GPUs
Long Yuan, Zeyu Zhou, Xuemin Lin +3
Structural clustering is one of the most popular graph clustering methods, which has achieved great performance improvement by utilizing GPUs. Even though, the state-of-the-art GPU…
Effective Community Search on Large Attributed Bipartite Graphs
Zongyu Xu, Yihao Zhang, Long Yuan +5
Community search over bipartite graphs has attracted significant interest recently. In many applications such as user-item bipartite graph in E-commerce, customer-movie bipartite g…
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
Zi Chen, Long Yuan, Xuemin Lin +2
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. However, in real world, ma…
Higher-Order Neighborhood Truss Decomposition
Zi Chen, Long Yuan, Li Han +1
-truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the -truss model only considers the direct common neighbors…