|
Recent talks
An Effective Graph-based Framework for Name Disambiguation. The Second Int. symposium on Dataology and Data Science, Graduate School of the Chinese Academy of Sciences , Beijing , China, May 30, 2011. Key Research Problems in Data Mining and Our Research Summary in this Area. Qinghai University, Xining, Qinghai, China (Invited by NDBR'11 and the CCF Qinghai branch), May 28, 201. An Effective Graph-based Framework for Name Disambiguation. The Third Tsinghua-Kyoto Symposium on Intelligent Technologies and Information Management for Knowledge Society, Tsinghua University, Beijing , China, March 21, 2011. An Effective Graph-based Framework for Name Disambiguation. The 5th Beijing-Hong Kong International Doctoral Forum, Beijing, China, August 23 2010. Mining and Managing Graph Data: Algorithms, Applications, and Case Studies. The 2010 Ph.D. Summer School on Data Intensive Computing and Semi-Structured Data management. Renmin Univerity of China. July 30, 2010. Graph Data Mining and its Applications. The First Tsinghua-Kyoto Symposium on Intelligent Technologies and Information Management for Knowledge Society, Tsinghua University, Beijing , China, September 1, 2009. Generator Mining from Sequence and Graph Data and its Application in Classification. The 2009 Advanced Disciplines Lectures (ADL'09, organized by CCF), Beijing, China, July 7, 2009. A Unified Graph-based Framework for Name Disambiguation. The 2009 National Data Base Progress Strategy and Submissions Review Meeting (NDBR'09), Chengdu, China, June 6, 2009. Graph Data Mining and its Applications. Panel talk at the 25th National Database Conference (NDBC'08), Guilin, China. Oct. 25, 2008. Mining Graph Data: A Survey and Some Case Studies. HP Labs China, Beijing, China. August 14, 2008. Out-of-Core Coherent Closed Quasi-Clique Mining from Large Dense Graph Databases. The 2007 International Workshop on Frontier of Data Management, Renmin University of China, Beijing, China. December 17, 2007. Out-of-Core Coherent Closed Quasi-Clique Mining from Large Dense Graph Databases. New Technology Research Division, Baidu.com, Inc., Beijing, China. November 30, 2007. Efficient Frequent Closed Sequence Mining and Beyond. Department of Computer Science, School of Computing, National University of Singapore, Singapore. September 13, 2005. BIDE: Efficient Mining of Frequent Closed Sequences. Institute of Software, Chinese Academy of Sciences, Beijing, China. April 6, 2005. Efficient Mining of Closed Patterns with Tough Constraint. Digital Technology Center, University of Minnesota, Minneapolis, USA. October 29, 2003. |