# Yiping Ke

According to our database

Collaborative distances:

^{1}, Yiping Ke authored at least 46 papers between 2004 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Uncluttered Domain Sub-Similarity Modeling for Transfer Regression.

Proceedings of the IEEE International Conference on Data Mining, 2018

Transfer Hawkes Processes with Content Information.

Proceedings of the IEEE International Conference on Data Mining, 2018

2017

A Fast Algorithm for Matrix Eigen-decompositionn.

Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Source-Target Similarity Modelings for Multi-Source Transfer Gaussian Process Regression.

Proceedings of the 34th International Conference on Machine Learning, 2017

Domain Specific Feature Transfer for Hybrid Domain Adaptation.

Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016

Efficient Algorithms for Temporal Path Computation.

IEEE Trans. Knowl. Data Eng., 2016

Deep Nonlinear Feature Coding for Unsupervised Domain Adaptation.

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Reachability and time-based path queries in temporal graphs.

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Effective and Efficient Spectral Clustering on Text and Link Data.

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015

Core decomposition in large temporal graphs.

Proceedings of the 2015 IEEE International Conference on Big Data, 2015

2014

GBAGC: A General Bayesian Framework for Attributed Graph Clustering.

TKDD, 2014

Path Problems in Temporal Graphs.

PVLDB, 2014

A Fast Inference Algorithm for Stochastic Blockmodel.

Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

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

2011

Leadership discovery when data correlatively evolve.

World Wide Web, 2011

Fast graph query processing with a low-cost index.

VLDB J., 2011

Finding maximal cliques in massive networks.

ACM Trans. Database Syst., 2011

Efficient core decomposition in massive networks.

Proceedings of the 27th International Conference on Data Engineering, 2011

High efficiency and quality: large graphs matching.

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010

Finding maximal cliques in massive networks by H*-graph.

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Detecting Leaders from Correlated Time Series.

Proceedings of the Database Systems for Advanced Applications, 2010

Querying Large Graph Databases.

Proceedings of the Database Systems for Advanced Applications, 2010

Stock risk mining by news.

Proceedings of the Database Technologies 2010, 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

Spotting Significant Changing Subgraphs in Evolving Graphs.

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 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

Mining Vague Association Rules.

Proceedings of the Advances in Databases: Concepts, 2007

2006

Web dynamics and their ramifications for the development of Web search engines.

Computer Networks, 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

2004

WUML: A Web Usage Manipulation Language for Querying Web Log Data.

Proceedings of the Conceptual Modeling, 2004