433 citations · 968 across the 48 of their papers we have counts for
6 papers · 1 filter
An Optimal and Progressive Approach to Online Search of Top-k Influential Communities
Fei Bi, Lijun Chang, Xuemin Lin +1
Community search over large graphs is a fundamental problem in graph analysis. Recent studies propose to compute top-k influential communities, where each reported community not on…
Dynamical SimRank Search on Time-Varying Networks
Weiren Yu, Xuemin Lin, Wenjie Zhang +1
In this article, we study the efficient dynamical computation of all-pairs SimRanks on time-varying graphs. Li {\em et al}.'s approach requires time and m…
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation
Lijun Chang, Xing Feng, Xuemin Lin +2
Graph edit distance (GED) is an important similarity measure adopted in a similarity-based analysis between two graphs, and computing GED is a primitive operator in graph database…
Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization
Yang Wang, Lin Wu
Multi-view data clustering attracts more attention than their single view counterparts due to the fact that leveraging multiple independent and complementary information from multi…
Enumerating k-Vertex Connected Components in Large Graphs
Dong Wen, Lu Qin, Xuemin Lin +2
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network…
Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval
Yang Wang, Xuemin Lin, Lin Wu +1
Given a query photo issued by a user (q-user), the landmark retrieval is to return a set of photos with their landmarks similar to those of the query, while the existing studies on…