James Cheng

According to our database1, James Cheng authored at least 127 papers between 2004 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
GraphD: Distributed Vertex-Centric Graph Processing Beyond the Memory Limit.
IEEE Trans. Parallel Distrib. Syst., 2018

Fuzzy Double Trace Norm Minimization for Recommendation Systems.
IEEE Trans. Fuzzy Systems, 2018

FlexPS: Flexible Parallelism Control in Parameter Server Architecture.
PVLDB, 2018

Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applications.
IEEE Trans. Pattern Anal. Mach. Intell., 2018

Norm-Range Partition: A Univiseral Catalyst for LSH based Maximum Inner Product Search (MIPS).
CoRR, 2018

Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applications.
CoRR, 2018

ASVRG: Accelerated Proximal SVRG.
CoRR, 2018

Norm-Ranging LSH for Maximum Inner Product Search.
CoRR, 2018

A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates.
CoRR, 2018

Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization.
CoRR, 2018

Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization.
CoRR, 2018

VR-SGD: A Simple Stochastic Variance Reduction Method for Machine Learning.
CoRR, 2018

Scalable De Novo Genome Assembly Using Pregel.
CoRR, 2018

A General and Efficient Querying Method for Learning to Hash.
Proceedings of the 2018 International Conference on Management of Data, 2018

A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates.
Proceedings of the 35th International Conference on Machine Learning, 2018

Scalable De Novo Genome Assembly Using Pregel.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

G-Miner: an efficient task-oriented graph mining system.
Proceedings of the Thirteenth EuroSys Conference, 2018

Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Systems for Big Graph Analytics
Springer Briefs in Computer Science, Springer, ISBN: 978-3-319-58216-0, 2017

LFTF: A Framework for Efficient Tensor Analytics at Scale.
PVLDB, 2017

Efficient nonparametric and asymptotic Bayesian model selection methods for attributed graph clustering.
Knowl. Inf. Syst., 2017

G-thinker: Big Graph Mining Made Easier and Faster.
CoRR, 2017

Fast Stochastic Variance Reduced Gradient Method with Momentum Acceleration for Machine Learning.
CoRR, 2017

Variance Reduced Stochastic Gradient Descent with Sufficient Decrease.
CoRR, 2017

Accelerated Variance Reduced Stochastic ADMM.
CoRR, 2017

The Best of Both Worlds: Big Data Programming with Both Productivity and Performance.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

LoSHa: A General Framework for Scalable Locality Sensitive Hashing.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

Accelerated First-order Methods for Geodesically Convex Optimization on Riemannian Manifolds.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Efficient Processing of Growing Temporal Graphs.
Proceedings of the Database Systems for Advanced Applications, 2017

Architectural implications on the performance and cost of graph analytics systems.
Proceedings of the 2017 Symposium on Cloud Computing, SoCC 2017, Santa Clara, CA, USA, 2017

Accelerated Variance Reduced Stochastic ADMM.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Distributed Maximal Clique Computation and Management.
IEEE Trans. Services Computing, 2016

Generalized Higher Order Orthogonal Iteration for Tensor Learning and Decomposition.
IEEE Trans. Neural Netw. Learning Syst., 2016

Efficient Algorithms for Temporal Path Computation.
IEEE Trans. Knowl. Data Eng., 2016

Husky: Towards a More Efficient and Expressive Distributed Computing Framework.
PVLDB, 2016

A General-Purpose Query-Centric Framework for Querying Big Graphs.
PVLDB, 2016

Efficient Processing of Very Large Graphs in a Small Cluster.
CoRR, 2016

Lightweight Fault Tolerance in Large-Scale Distributed Graph Processing.
CoRR, 2016

Quegel: A General-Purpose Query-Centric Framework for Querying Big Graphs.
CoRR, 2016

Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph.
CoRR, 2016

Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization.
CoRR, 2016

Unified Scalable Equivalent Formulations for Schatten Quasi-Norms.
CoRR, 2016

End-to-End Java Security Performance Enhancements for Oracle SPARC Servers.
Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering, 2016

Quegel: A General-Purpose System for Querying Big Graphs.
Proceedings of the 2016 International Conference on Management of Data, 2016

Big Graph Analytics Systems.
Proceedings of the 2016 International Conference on Management of Data, 2016

Diversified Temporal Subgraph Pattern Mining.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Reachability and time-based path queries in temporal graphs.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

A comparison of general-purpose distributed systems for data processing.
Proceedings of the 2016 IEEE International Conference on Big Data, 2016

SGraph: A Distributed Streaming System for Processing Big Graphs.
Proceedings of the Big Data Computing and Communications - Second International Conference, 2016

Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data.
IEEE Trans. Cybernetics, 2015

Efficient location-based search of trajectories with location importance.
Knowl. Inf. Syst., 2015

Fast PageRank approximation by adaptive sampling.
Knowl. Inf. Syst., 2015

Robust bilinear factorization with missing and grossly corrupted observations.
Inf. Sci., 2015

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation.
CoRR, 2015

Regularized Orthogonal Tensor Decompositions for Multi-Relational Learning.
CoRR, 2015

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation.
Proceedings of the 24th International Conference on World Wide Web, 2015

Core decomposition in large temporal graphs.
Proceedings of the 2015 IEEE International Conference on Big Data, 2015

2014
Efficient processing of k-hop reachability queries.
VLDB J., 2014

GBAGC: A General Bayesian Framework for Attributed Graph Clustering.
TKDD, 2014

Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees.
PVLDB, 2014

Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs.
PVLDB, 2014

Path Problems in Temporal Graphs.
PVLDB, 2014

Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation.
PVLDB, 2014

Tripartite Graph Clustering for Dynamic Sentiment Analysis on Social Media.
CoRR, 2014

Structured Low-Rank Matrix Factorization with Missing and Grossly Corrupted Observations.
CoRR, 2014

Generalized Higher-Order Tensor Decomposition via Parallel ADMM.
CoRR, 2014

Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks.
CoRR, 2014

Temporal Graph Traversals: Definitions, Algorithms, and Applications.
CoRR, 2014

Nuclear Norm Regularized Least Squares Optimization on Grassmannian Manifolds.
Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Tripartite graph clustering for dynamic sentiment analysis on social media.
Proceedings of the International Conference on Management of Data, 2014

Factor Matrix Trace Norm Minimization for Low-Rank Tensor Completion.
Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

Generalized Higher-Order Orthogonal Iteration for Tensor Decomposition and Completion.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Recovering Low-Rank and Sparse Matrices via Robust Bilateral Factorization.
Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

SocialTransfer: Transferring Social Knowledge for Cold-Start Cowdsourcing.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Truth Discovery in Data Streams: A Single-Pass Probabilistic Approach.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Robust Principal Component Analysis with Missing Data.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Distributed Maximal Clique Computation.
Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

Rectangle Counting in Large Bipartite Graphs.
Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

Generalized Higher-Order Tensor Decomposition via Parallel ADMM.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying.
PVLDB, 2013

TF-Label: a topological-folding labeling scheme for reachability querying in a large graph.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Redundancy-aware maximal cliques.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Finding distance-preserving subgraphs in large road networks.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2012
Triangle listing in massive networks.
TKDD, 2012

Truss Decomposition in Massive Networks.
PVLDB, 2012

K-Reach: Who is in Your Small World.
PVLDB, 2012

IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying on Large Graphs
CoRR, 2012

K-Reach: Who is in Your Small World
CoRR, 2012

Truss Decomposition in Massive Networks
CoRR, 2012

A model-based approach to attributed graph clustering.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Efficient processing of distance queries in large graphs: a vertex cover approach.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Fast algorithms for maximal clique enumeration with limited memory.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Efficient algorithms for generalized subgraph query processing.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Fast graph query processing with a low-cost index.
VLDB J., 2011

Finding maximal cliques in massive networks.
ACM Trans. Database Syst., 2011

Structure and attribute index for approximate graph matching in large graphs.
Inf. Syst., 2011

Triangle listing in massive networks and its applications.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Efficient core decomposition in massive networks.
Proceedings of the 27th International Conference on Data Engineering, 2011

2010
GBLENDER: towards blending visual query formulation and query processing in graph databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Finding maximal cliques in massive networks by H*-graph.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

K-isomorphism: privacy preserving network publication against structural attacks.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Querying Large Graph Databases.
Proceedings of the Database Systems for Advanced Applications, 2010

2009
Efficient query processing on graph databases.
ACM Trans. Database Syst., 2009

Top-k Correlative Graph Mining.
Proceedings of the SIAM International Conference on Data Mining, 2009

Efficient Discovery of Frequent Correlated Subgraph Pairs.
Proceedings of the ICDM 2009, 2009

Context-Aware Object Connection Discovery in Large Graphs.
Proceedings of the 25th International Conference on Data Engineering, 2009

Efficient processing of group-oriented connection queries in a large graph.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
Correlated pattern mining in quantitative databases.
ACM Trans. Database Syst., 2008

Efficient Correlation Search from Graph Databases.
IEEE Trans. Knowl. Data Eng., 2008

An information-theoretic approach to quantitative association rule mining.
Knowl. Inf. Syst., 2008

A survey on algorithms for mining frequent itemsets over data streams.
Knowl. Inf. Syst., 2008

Maintaining frequent closed itemsets over a sliding window.
J. Intell. Inf. Syst., 2008

Effective elimination of redundant association rules.
Data Min. Knowl. Discov., 2008

2007
Fg-index: towards verification-free query processing on graph databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2007

Correlation search in graph databases.
Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007

An Efficient Index Lattice for XML Query Evaluation.
Proceedings of the Advances in Databases: Concepts, 2007

Mining Vague Association Rules.
Proceedings of the Advances in Databases: Concepts, 2007

A Development of Hash-Lookup Trees to Support Querying Streaming XML.
Proceedings of the Advances in Databases: Concepts, 2007

2006
Comparative Analysis of XML Compression Technologies.
World Wide Web, 2006

Maintaining Frequent Itemsets over High-Speed Data Streams.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2006

Mining quantitative correlated patterns using an information-theoretic approach.
Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

delta-Tolerance Closed Frequent Itemsets.
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining.
Proceedings of the 22nd International Conference on Data Engineering, 2006

An Efficient Approach to Support Querying Secure Outsourced XML Information.
Proceedings of the Advanced Information Systems Engineering, 18th International Conference, 2006

2004
XQzip: Querying Compressed XML Using Structural Indexing.
Proceedings of the Advances in Database Technology, 2004


  Loading...