主講人👩‍🚒：祝園園

主講人簡介🧑🏼‍🌾：祝園園，女🙇🏽‍♂️，副教授🤹‍♂️，博士生導師，武漢大學計算機沐鸣副教授。現為中國計算機學會數據庫專委會執行委員🧘🏼‍♀️，ACM SIGMOD China專委會委員🧑‍🧒‍🧒。主要研究方向為圖數據管理與分析，圖機器學習，大數據計算與分析等，目前已國內外學術期刊和會議上發表論文30余篇，包括The VLDB Journal🥷🏻、TKDE、 VLDB❣️🚣、ICDE☔️、CIKM、EDBT👨🏼‍💻、DASFAA、BIBM等等。主持多項國家及省部級科研項目🙆🏻‍♀️，包括國家自然科學基金面上項目兩項和青年項目1項、湖北省自然科學基金基面上2項和青年項目1項🏃🏻‍♂️‍➡️、蘇州市科技發展計劃項目等🔝⛴。擔任國內外頂級期刊和學術會議IEEE Transactions on Knowledge and Data Engineering、World Wide Web Journal、International Journal of Cooperative Information System、Data Science and Engineering🦄、軟件學報、計算機學報等審稿人⛪️。擔任 ICDM International Workshop on Graph Analytics 2018以及ACM SIGMOD China Forum 2018的程序委員會主席。擔任VLDB👎🏻、ICDE🫶、KDD、AAAI、IJCAI、SIGIR🫲、CIKM、WSDM🤸🏽‍♀️、 DSAFAA、PAKDD等30多個著名國際會議的程序委員會委員🦿。

報告摘要：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