Truss Decomposition in Massive Networks
- Jia Wang, James Cheng
- Computer ScienceProceedings of the VLDB Endowment
- 1 May 2012
This work improves the existing in-memory algorithm for computing k-truss in networks of moderate size and proposes two I/O-efficient algorithms to handle massive networks that cannot fit in main memory.
Fg-index: towards verification-free query processing on graph databases
- James Cheng, Yiping Ke, Wilfred Ng, An Lu
- Computer ScienceACM SIGMOD Conference
- 11 June 2007
A novel indexing technique that constructs a nested inverted-index, called FG- index, based on the set of Frequent subGraphs (FGs), which returns the exact set of query answers without performing candidate verification and is orders of magnitude more efficient than using the state-of-the-art graph index.
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs
- Da Yan, James Cheng, Yi Lu, Wilfred Ng
- Computer ScienceProceedings of the VLDB Endowment
- 1 October 2014
This paper proposes a block-centric framework, called Blogel, which naturally handles all the three adverse graph characteristics, and is able to achieve orders of magnitude performance improvements over the state-of-the-art distributed graph computing systems.
K-isomorphism: privacy preserving network publication against structural attacks
- James Cheng, A. Fu, Jia Liu
- Computer ScienceSIGMOD Conference
- 6 June 2010
These investigations show that k-isomorphism, or anonymization by forming k pairwise isomorphic subgraphs, is both sufficient and necessary for the protection of privacy in social networks and the problem is shown to be NP-hard.
A model-based approach to attributed graph clustering
- Zhiqiang Xu, Yiping Ke, Yi Wang, Hong Cheng, James Cheng
- Computer ScienceSIGMOD Conference
- 20 May 2012
This paper develops a Bayesian probabilistic model for attributed graphs that provides a principled and natural framework for capturing both structural and attribute aspects of a graph, while avoiding the artificial design of a distance measure.
Path Problems in Temporal Graphs
- Huanhuan Wu, James Cheng, Silu Huang, Yiping Ke, Yi Lu, Yanyan Xu
- Computer ScienceProceedings of the VLDB Endowment
- 1 May 2014
The shortcomings of classic shortest path in a temporal graph are shown, various concepts of "shortest" path for temporal graphs are studied, and efficient algorithms to compute these temporal paths are proposed.
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
- James Cheng, Silu Huang, Huanhuan Wu, A. Fu
- Computer ScienceACM SIGMOD Conference
- 22 June 2013
TF-label is an efficient and scalable labeling scheme for processing reachability queries that is constructed based on a novel topological folding that recursively folds an input graph into half so as to reduce the label size, thus improving query efficiency.
Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applications
- Fanhua Shang, James Cheng, Yuanyuan Liu, Z. Luo, Zhouchen Lin
- Computer ScienceIEEE Transactions on Pattern Analysis and Machine…
- 1 September 2018
The double nuclear norm and Frobenius/nuclear hybrid norm penalties are defined and it is proved that they are in essence the Schatten-LaTeX quasi-norms, respectively, which lead to much more tractable and scalable Lipschitz optimization problems.
Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data
- Yuanyuan Liu, Fanhua Shang, L. Jiao, James Cheng, Hong Cheng
- Computer ScienceIEEE Transactions on Cybernetics
- 1 November 2015
A novel trace norm regularized CANDECOMP/PARAFAC decomposition (TNCP) method for simultaneous tensor decomposition and completion that is significantly faster than the state-of-the-art methods and scales to larger problems.
Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation
- Da Yan, James Cheng, Yi Lu, Wilfred Ng
- Computer ScienceThe Web Conference
- 2 March 2015
Two effective message reduction techniques are proposed: vertex mirroring with message combining, and an additional request-respond API that bound the number of messages sent/received by any single vertex.
...
...