Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Truss Decomposition in Massive Networks
- J. Wang, James Cheng
- Computer Science
- Proc. VLDB Endow.
- 1 May 2012
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… Expand
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs
- Da Yan, James Cheng, Y. Lu, Wilfred Ng
- Computer Science
- Proc. VLDB Endow.
- 1 October 2014
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… Expand
A model-based approach to attributed graph clustering
- Zhiqiang Xu, Yiping Ke, Yi Wang, H. Cheng, James Cheng
- Computer Science
- SIGMOD Conference
- 20 May 2012
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… Expand
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
- James Cheng, Silu Huang, Huanhuan Wu, A. Fu
- Computer Science
- SIGMOD '13
- 22 June 2013
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… Expand
Path Problems in Temporal Graphs
- Huanhuan Wu, James Cheng, Silu Huang, Yiping Ke, Y. Lu, Y. Xu
- Computer Science
- Proc. VLDB Endow.
- 1 May 2014
Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient or even flawed in a temporal graph, as the temporal information… Expand
Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation
- Da Yan, James Cheng, Y. Lu, Wilfred Ng
- Computer Science
- WWW '15
- 2 March 2015
Massive graphs, such as online social networks and communication networks, have become common today. To efficiently analyze such large graphs, many distributed graph computing systems have been… Expand
Efficient core decomposition in massive networks
- James Cheng, Yiping Ke, Shumo Chu, M. Özsu
- Computer Science
- IEEE 27th International Conference on Data…
- 11 April 2011
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… Expand
Triangle listing in massive networks and its applications
- Shumo Chu, James Cheng
- Computer Science
- KDD
- 21 August 2011
Triangle listing is one of the fundamental algorithmic problems whose solution has numerous applications especially in the analysis of complex networks, such as the computation of clustering… Expand
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks
- Minhao Jiang, A. Fu, Raymond Chi-Wing Wong, James Cheng, Yanyan Xu
- Computer Science
- Proc. VLDB Endow.
- 4 March 2014
We study the problem of point-to-point distance querying for massive scale-free graphs, which is important for numerous applications. Given a directed or undirected graph, we propose to build an… Expand
Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applications
- F. Shang, James Cheng, Yuanyuan Liu, Z. Luo, Zhouchen Lin
- Computer Science, Mathematics
- IEEE Transactions on Pattern Analysis and Machine…
- 1 September 2018
The heavy-tailed distributions of corrupted outliers and singular values of all channels in low-level vision have proven effective priors for many applications such as background modeling,… Expand