时间

2019年3月22号 10:00-11:00

 

地点

北京大学王选所106会议室

 

介绍

Various networks ranging from social networks, collaboration networks to biological networks, have grown steadily.  Cliques refer to subgraphs in an undirected graph where any two vertices in a subgraph are adjacent to each other. Take online social networks as an example.  Cliques are used to model groups of individuals who know each other, and are widely used to represent dense communities in complex networks and the max clique problem has been extensively studied.  The max clique problem is known to have direct applications in various fields and cliques are of vital importance in developing graph-based algorithms to analyze the structure and function of networks arising in diverse areas. In this talk, we will talk about finding maximal cliques and maximum cliques in massive graphs.

 

简历

Dr Jeffrey Xu Yu is a Professor in the Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong. His current main research interests include graph mining, graph query processing, graph pattern matching, keywords search in databases, and online social networks. Dr. Yu served as an Information
Director and a member in ACM SIGMOD executive committee (2007-2011), an associate editor of IEEE Transactions on Knowledge and Data Engineering (2004-2008), and an associate editor in VLDB Journal (2007-2013). Currently he servers as an associate editor of ACM Transactions on Database Systems (TODS), WWW Journal, Data Science and
Engineering, the International Journal of Cooperative Information Systems, the Journal on Health Information Science and Systems (HISS), and Journal of Information Processing. Dr. Yu served/serves in many organization committees and program committees in international conferences/workshops including PC Co-chair of APWeb'04, WAIM'06, APWeb/WAIM'07, WISE'09, PAKDD'10, DASFAA'11, ICDM'12, NDBC'13, ADMA'14, CIKM'15 and Bigcomp17, and conference general Co-chair of APWeb'13, ICDM'18, and CIKM'19.