澳门永利总站网址大全_首页

Cohesive Subgraph Search in Large Graphs

主讲人:祝园园

 

主讲人简介:祝园园,女,副教授,博士生导师,武汉大学计算机学院副教授。现为中国计算机学会数据库专委会执行委员,ACM SIGMOD China专委会委员。主要研究方向为图数据管理与分析,图机器学习,大数据计算与分析等,目前已国内外学术期刊和会议上发表论文30余篇,包括The VLDB JournalTKDE VLDBICDECIKMEDBTDASFAABIBM等等。主持多项国家及省部级科研项目,包括国家自然科学基金面上项目两项和青年项目1项、湖北省自然科学基金基面上2项和青年项目1项、苏州市科技发展计划项目等。担任国内外顶级期刊和学术会议IEEE Transactions on Knowledge and Data EngineeringWorld Wide Web JournalInternational Journal of Cooperative Information SystemData Science and Engineering、软件学报、计算机学报等审稿人。担任 ICDM International Workshop on Graph Analytics 2018以及ACM SIGMOD China Forum 2018的程序委员会主席。担任VLDBICDEKDDAAAIIJCAISIGIRCIKMWSDM DSAFAAPAKDD30多个著名国际会议的程序委员会委员。

 

报告摘要:Graph is a powerful tool for modeling structural relationships between data objects in many application domains. In many real-world applications, finding cohesive subgraphs is an essential way to understand real-world graph data. In this talk, first, I will introduce recent cohesive graph models including k-core and k-truss, and the state-of-the-art methods. Then, I will share our recent progress on cohesive subgraph search, including finer grained community search, location based on community search, and keyword based community search.

 

时间:2022.11.25,上午10:00

地点:腾讯会议:145-538-018