• Publications
  • Influence
On graph query optimization in large networks
TLDR
We present a high performance graph indexing mechanism, SPath, to address the graph query problem on large networks. Expand
  • 288
  • 44
  • PDF
P-Rank: a comprehensive structural similarity measure over information networks
TLDR
In this paper, we propose a new similarity measure, P-Rank (Penetrating Rank), toward effectively computing the structural similarities of entities in real information networks. Expand
  • 198
  • 37
  • PDF
RankClus: integrating clustering with ranking for heterogeneous information network analysis
TLDR
We address the problem of generating clusters for a specified type of objects, as well as ranking information for all types of objects based on these clusters in a multi-typed information network. Expand
  • 360
  • 29
  • PDF
Graph cube: on warehousing and OLAP multidimensional networks
TLDR
We introduce Graph Cube, a new data warehousing model that supports OLAP queries effectively on large multidimensional networks. Expand
  • 168
  • 20
  • PDF
Graph Indexing: Tree + Delta >= Graph
TLDR
We propose a new cost-effective graph indexing method based on frequent tree-features of the graph database. Expand
  • 223
  • 19
  • PDF
Evaluating Event Credibility on Twitter
TLDR
We propose a credibility analysis approach enhanced with event graph-based optimization to solve the problem of automatically assessing credibility of Twitter events. Expand
  • 189
  • 19
  • PDF
Similarity Search in Graph Databases: A Multi-Layered Indexing Approach
TLDR
We consider in this paper the similarity search problem that retrieves relevant graphs from a graph database under the well-known graph edit distance (GED) constraint. Expand
  • 36
  • 10
  • PDF
Truss-based Community Search: a Truss-equivalence Based Indexing Approach
TLDR
We study the community search problem in the truss-based model aimed at discovering all dense and cohesive k-truss communities to which the query vertex q belongs. Expand
  • 49
  • 6
  • PDF
Backward Path Growth for Efficient Mobile Sequential Recommendation
TLDR
We propose a novel dynamic programming based method to solve the mobile sequential recommendation problem consisting of two separate stages: an offline pre-processing stage and an online search stage. Expand
  • 24
  • 6
  • PDF
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration
TLDR
We propose a novel density-based network clustering algorithm, called gSkeletonClu (graph-skeleton based clustering). Expand
  • 65
  • 5
  • PDF
...
1
2
3
4
...