James Cheng

Suggest Changes
Jiawei Han105
Jeffrey Xu Yu88
Xifeng Yan77
Ilan Horn72
James C. Dehnert72
60Jeffrey Xu Yu
50Wilfred Ng
43Yiping Ke
40Hong Cheng
38Lu Qin

Filter Results:

  • Full text PDF available (102)

Publication Year

2003
2017
  • This year (13)
  • Last 5 years (81)
  • Last 10 years (111)

Publication Type

Co-author

Journals and Conferences

Data Set Used

Key Phrases

Learn More
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to efficiently process graph queries. Querying graph databases is costly since it involves <i>subgraph isomorphism</i> testing, which is an <i>NP-complete</i> problem. In recent years,… (More)
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due to the diversity and complexity of graph data, on which an adversary can use many types of background knowledge to conduct an attack. One popular type of attacks as studied by… (More)
A model-based approach to attributed graph clustering
Graph clustering, also known as community detection, is a long-standing problem in data mining. However, with the proliferation of rich attribute information available for objects in real-world graphs, how to leverage structural and attribute information for clustering attributed graphs becomes a new challenge. Most existing works take a distance-based… (More)
Truss Decomposition in Massive Networks
The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k-truss. Compared with k-core which is also efficient to compute, k-truss represents the “core” of a k-core that keeps the key information of, while… (More)
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs
The rapid growth in the volume of many real-world graphs (e.g., social networks, web graphs, and spatial networks) has led to the development of various vertex-centric distributed graph computing systems in recent years. However, real-world graphs from different domains have very different characteristics, which often create bottlenecks in vertex-centric… (More)
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
Reachability querying is a basic graph operation with numerous important applications in databases, network analysis, computational biology, software engineering, etc. Although many indexes have been proposed to answer reachability queries, most of them are only efficient for handling relatively small graphs. We propose TF-label, an efficient and scalable… (More)
Efficient core decomposition in massive networks
The k-core of a graph is the largest subgraph in which every vertex is connected to at least k other vertices within the subgraph. Core decomposition finds the k-core of the graph for every possible k. Past studies have shown important applications of core decomposition such as in the study of the properties of large networks (e.g., sustainability,… (More)
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of frequent itemsets (FIs). Unlike mining static databases, mining data streams poses many new challenges. In addition to the one-scan nature, the unbounded memory requirement and the… (More)