Institute of High Performance Computing

navigation

People: Vibrant & Dynamic Culture

People

----

Computing Science (CS)

Dr. KE Yi Ping

Dr. KE Yi Ping


Research Interests:

  • Large-scale data mining and machine learning
  • Data management and information analytics
  • Massive network analysis

Qualifications:

  • Ph.D. Computer Science, Hong Kong University of Science and Technology, Hong Kong, 2008
  • B.Sc. Computer Science, Fudan University, China, 2003

Published Journals/ Articles:

Journals

    • James Cheng,†Yiping Ke, Ada Fu, Jeffrey Xu Yu, and Linhong Zhu.†Finding Maximal Cliques in Massive Networks. In ACM Transactions on Database Systems (TODS), 36(4): 21:1-21:34, 2011.
    • James Cheng,†Yiping Ke, Ada Fu, and Jeffrey Xu Yu.†Fast Graph Query Processing with a Low-Cost Index. In the International Journal on Very Large Data Bases (VLDBJ), 20(4): 521-539, 2011.
    • Di Wu,†Yiping Ke, Jeffrey Xu Yu, Philip S. Yu, and Lei Chen.†Leadership Discovery When Data Correlatively Evolve. In World Wide Web Journal (WWWJ), 14(1): 1-25, January 2011.
    • James Cheng,†Yiping Ke, and Wilfred Ng.†Efficient Query Processing on Graph Databases. In ACM Transactions on Database Systems (TODS), 34(1): 1-48, April 2009.
    • Yiping Ke,†James Cheng, and Wilfred Ng.†Correlated Pattern Mining in Quantitative Databases. In ACM Transactions on Database Systems (TODS), 33(3): 1-45, August 2008.
    • Yiping Ke,†James Cheng, and Wilfred Ng.†Efficient Correlation Search from Graph Databases. In IEEE Transactions on Knowledge and Data Engineering (TKDE), 20(12): 1601-1615, December 2008.
    • James Cheng,†Yiping Ke, and Wilfred Ng.†Effective Elimination of Redundant Association Rules. In Data Mining and Knowledge Discovery (DMKD/DAMI), 16(2): 221-249, April 2008.†
    • Yiping Ke,†James Cheng, and Wilfred Ng.†An Information-Theoretic Approach to Quantitative Association Rule Mining.†In Knowledge and Information Systems Journal (KAIS), 16(2): 213-244, August 2008.
    • James Cheng,†Yiping Ke,†and Wilfred Ng.†A Survey on Algorithms for Mining Frequent Itemsets over Data Streams.†In Knowledge and Information Systems Journal (KAIS), 16(1): 1-27, July 2008.
    • James Cheng,†Yiping Ke,†and Wilfred Ng.†Maintaining Frequent Closed Itemsets over a Sliding Window. In Journal of Intelligent Information Systems (JIIS), 31(3): 191-215, December 2008.†
    • Yiping Ke, Lin Deng, Wilfred Ng,†and Dik Lun Lee.†Web Dynamics and their Ramifications for the Development of Web Search Engines. In†Computer Networks Journal†- Special Issue on Web Dynamics, 50(10): 1430-1447, 2006.†

Conferences

    • James Cheng,†Linhong Zhu,†Yiping Ke, and Shumo Chu.†Fast Algorithms for Maximal Clique Enumeration with Limited Memory.†In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 1240-1248, 2012.
    • Zhiqiang Xu,†Yiping Ke, Yi Wang, Hong Cheng, and James Cheng. A Model-based Approach to Attributed Graph Clustering. In Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 505-516,2012.
    • James Cheng,†Yiping Ke, Shumo Chu, and Carter Cheng. Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach. In Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 457-468, 2012.
    • Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu,†Yiping Ke, and Xuemin Lin.†High Efficiency and Quality: Large Graphs Matching. In Proceedings of the 20th ACM Conference on Information and Knowledge Management (CIKM), pages 1755-1764, 2011.
    • James Cheng,†Yiping Ke, Shumo Chu, and M. Tamer Ozsu.†Efficient Core Decomposition in Massive Networks. In Proceedings of the 27th IEEE International Conference on Data Engineering (ICDE), pages 51-62, 2011.
    • James Cheng,†Yiping Ke, Ada Fu, Jeffrey Xu Yu, and Linhong Zhu.†Finding Maximal Cliques in Massive Networks by H*-graph. In Proceedings of the 29th ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 447-458, 2010.†
    • Di Wu,†Yiping Ke, Jeffrey Xu Yu, Philip S. Yu, and Lei Chen.†Detecting Leaders from Correlated Time Series. In Proceedings of the 15th International Conference on Database Systems for Advanced Applications (DASFAA), pages 352-367, 2010.†(Best Paper Award)
    • Qi Pan, Hong Cheng, Di Wu, Jeffrey Xu Yu, and†Yiping Ke.†Stock Risk Mining by News. In Proceedings of the 21st Australasian Database Conference (ADC), pages 179-188, 2010.†(Best Paper Award)
    • Yiping Ke, James Cheng, and Jeffrey Xu Yu.†Efficient Discovery of Frequent Correlated Subgraph Pairs. In Proceedings of the 9th IEEE International Conference on Data Mining (ICDM), pages 239-248, 2009.
    • James Cheng,†Yiping Ke, and Wilfred Ng.†Efficient Processing of Group-Oriented Connection Queries in a Large Graph. (Short Paper) In Proceedings of the 18th ACM Conference on Information and Knowledge Management (CIKM), pages 1481-1484, 2009.
    • Yiping Ke, James Cheng, and Jeffrey Xu Yu.†Top-k Correlative Graph Mining. In Proceedings of the 9th SIAM International Conference on Data Mining (SDM), pages 1038-1049, 2009.
    • James Cheng,†Yiping Ke, Wilfred Ng, and Jeffrey Xu Yu.†Context-Aware Object Connection Discovery in Large Graphs.†In Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE), pages 856-867, 2009.†
    • Zheng Liu, Jeffrey Xu Yu,†Yiping Ke, Xuemin Lin, and Lei Chen.†Spotting Significant Changing Subgraphs in Evolving Graphs. (Short Paper) In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM), pages 917-922, 2008.†
    • Yiping Ke, James Cheng, and Wilfred Ng.†Correlation Search in Graph Databases.†In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 390-399, 2007.†(Nomination for the Best Paper Award)
    • James Cheng,†Yiping Ke,†Wilfred Ng, and An Lu.†FG-Index: Towards Verification-Free Query Processing on Graph Databases. In Proceedings of the 26th ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 857-872, 2007.
    • An Lu,†Yiping Ke, James Cheng, and Wilfred Ng.†Mining Vague Association Rules. (Short Paper) In Proceedings of the 12th International Conference on Database Systems for Advanced Applications (DASFAA), pages 891-897, 2007.†
    • James Cheng,†Yiping Ke,†and Wilfred Ng.†δ-Tolerance Closed Frequent Itemsets. In Proceedings of the 6th IEEE International Conference on Data Mining (ICDM), pages 139-148, 2006.
    • Yiping Ke, James Cheng,†and Wilfred Ng.†Mining Quantitative Correlated Patterns Using an Information-Theoretic Approach.†In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 227-236, 2006.†
    • James Cheng, Yiping Ke, and Wilfred Ng.†Maintaining Frequent Itemsets over High-Speed Data Streams.†(Short Paper) In Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pages 462-467, 2006.
    • Yiping Ke, James Cheng, and Wilfred Ng.†MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining.†(Poster) In Proceedings of the 22nd International Conference on Data Engineering (ICDE), page 112, 2006.
    • Qingzhao Tan,†Yiping Ke, and Wilfred Ng.†WUML: A Web Usage Manipulation Language For Querying Web Log Data.†In Proceedings of the 23rd International Conference on Conceptual Modeling (ER), pages 567-581, 2004.†

This page is last updated at: 25-JAN-2013