default search action
Yiping Ke
Publications
- 2016
- [j15]Huanhuan Wu, James Cheng, Yiping Ke, Silu Huang, Yuzhen Huang, Hejun Wu:
Efficient Algorithms for Temporal Path Computation. IEEE Trans. Knowl. Data Eng. 28(11): 2927-2942 (2016) - [c26]Huanhuan Wu, Yuzhen Huang, James Cheng, Jinfeng Li, Yiping Ke:
Reachability and time-based path queries in temporal graphs. ICDE 2016: 145-156 - [i3]Huanhuan Wu, Yuzhen Huang, James Cheng, Jinfeng Li, Yiping Ke:
Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph. CoRR abs/1601.05909 (2016) - 2015
- [c24]Huanhuan Wu, James Cheng, Yi Lu, Yiping Ke, Yuzhen Huang, Da Yan, Hejun Wu:
Core decomposition in large temporal graphs. IEEE BigData 2015: 649-658 - 2014
- [j14]Huanhuan Wu, James Cheng, Silu Huang, Yiping Ke, Yi Lu, Yanyan Xu:
Path Problems in Temporal Graphs. Proc. VLDB Endow. 7(9): 721-732 (2014) - [j13]Zhiqiang Xu, Yiping Ke, Yi Wang, Hong Cheng, James Cheng:
GBAGC: A General Bayesian Framework for Attributed Graph Clustering. ACM Trans. Knowl. Discov. Data 9(1): 5:1-5:43 (2014) - 2012
- [c22]James Cheng, Linhong Zhu, Yiping Ke, Shumo Chu:
Fast algorithms for maximal clique enumeration with limited memory. KDD 2012: 1240-1248 - [c21]James Cheng, Yiping Ke, Shumo Chu, Carter Cheng:
Efficient processing of distance queries in large graphs: a vertex cover approach. SIGMOD Conference 2012: 457-468 - [c20]Zhiqiang Xu, Yiping Ke, Yi Wang, Hong Cheng, James Cheng:
A model-based approach to attributed graph clustering. SIGMOD Conference 2012: 505-516 - 2011
- [j11]James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu:
Finding maximal cliques in massive networks. ACM Trans. Database Syst. 36(4): 21:1-21:34 (2011) - [j10]James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu:
Fast graph query processing with a low-cost index. VLDB J. 20(4): 521-539 (2011) - [c18]James Cheng, Yiping Ke, Shumo Chu, M. Tamer Özsu:
Efficient core decomposition in massive networks. ICDE 2011: 51-62 - 2010
- [c15]Yiping Ke, James Cheng, Jeffrey Xu Yu:
Querying Large Graph Databases. DASFAA (2) 2010: 487-488 - [c14]James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu:
Finding maximal cliques in massive networks by H*-graph. SIGMOD Conference 2010: 447-458 - 2009
- [j8]James Cheng, Yiping Ke, Wilfred Ng:
Efficient query processing on graph databases. ACM Trans. Database Syst. 34(1): 2:1-2:48 (2009) - [c13]James Cheng, Yiping Ke, Wilfred Ng:
Efficient processing of group-oriented connection queries in a large graph. CIKM 2009: 1481-1484 - [c12]James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu:
Context-Aware Object Connection Discovery in Large Graphs. ICDE 2009: 856-867 - [c11]Yiping Ke, James Cheng, Jeffrey Xu Yu:
Efficient Discovery of Frequent Correlated Subgraph Pairs. ICDM 2009: 239-248 - [c10]Yiping Ke, James Cheng, Jeffrey Xu Yu:
Top-k Correlative Graph Mining. SDM 2009: 1038-1049 - 2008
- [j7]James Cheng, Yiping Ke, Wilfred Ng:
Effective elimination of redundant association rules. Data Min. Knowl. Discov. 16(2): 221-249 (2008) - [j6]James Cheng, Yiping Ke, Wilfred Ng:
Maintaining frequent closed itemsets over a sliding window. J. Intell. Inf. Syst. 31(3): 191-215 (2008) - [j5]James Cheng, Yiping Ke, Wilfred Ng:
A survey on algorithms for mining frequent itemsets over data streams. Knowl. Inf. Syst. 16(1): 1-27 (2008) - [j4]Yiping Ke, James Cheng, Wilfred Ng:
An information-theoretic approach to quantitative association rule mining. Knowl. Inf. Syst. 16(2): 213-244 (2008) - [j3]Yiping Ke, James Cheng, Wilfred Ng:
Efficient Correlation Search from Graph Databases. IEEE Trans. Knowl. Data Eng. 20(12): 1601-1615 (2008) - [j2]Yiping Ke, James Cheng, Wilfred Ng:
Correlated pattern mining in quantitative databases. ACM Trans. Database Syst. 33(3): 14:1-14:45 (2008) - 2007
- [c8]An Lu, Yiping Ke, James Cheng, Wilfred Ng:
Mining Vague Association Rules. DASFAA 2007: 891-897 - [c7]Yiping Ke, James Cheng, Wilfred Ng:
Correlation search in graph databases. KDD 2007: 390-399 - [c6]James Cheng, Yiping Ke, Wilfred Ng, An Lu:
Fg-index: towards verification-free query processing on graph databases. SIGMOD Conference 2007: 857-872 - 2006
- [c5]Yiping Ke, James Cheng, Wilfred Ng:
MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining. ICDE 2006: 112 - [c4]James Cheng, Yiping Ke, Wilfred Ng:
delta-Tolerance Closed Frequent Itemsets. ICDM 2006: 139-148 - [c3]Yiping Ke, James Cheng, Wilfred Ng:
Mining quantitative correlated patterns using an information-theoretic approach. KDD 2006: 227-236 - [c2]James Cheng, Yiping Ke, Wilfred Ng:
Maintaining Frequent Itemsets over High-Speed Data Streams. PAKDD 2006: 462-467
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint