Kai Wang is currently a Postdoc Researcher in the Data and Knowledge Research Group at The University of New South Wales. He obtained his Ph.D. from The University of New South Wales in 2020 and his bachelor’s degree from Zhejiang University in 2016, both in Computer Science. In 2015, He worked as a research assistant at The Hong Kong Polytechnic University. His research interests lie in big data analytics, especially for the graph/network and spatial data. He has published several papers in top conferences, including VLDB and ICDE.
Cohesive structures widely exist in networks and mining cohesive structures is one of the most fundamental problems to analyze complex networks. In this presentation, different levels of cohesive-structure-based network analytic methods are introduced to meet the demand of nowadays real-world applications. Firstly, in the motif level, the butterfly (i.e., a complete 2 x 2 biclique) counting problem on bipartite networks is investigated. Secondly, in the subgraph mining level, the radius-bounded k-cores (RB-k-cores) computing problem on geo-social networks which aims to find cohesive subgraphs satisfying both social and spatial constraints is introduced. Thirdly, in the graph hierarchical decomposition level, the efficient bitruss decomposition algorithms on bipartite networks is presented.
版权所有©2017 湖南大学党委宣传部 地址：湖南省长沙市岳麓区麓山南路麓山门 邮编：410082 Email：firstname.lastname@example.org 域名备案信息：[www.hnu.edu.cn,www.hnu.cn/湘ICP备05000239号] [hnu.cn 湘教QS3-200503-000481 hnu.edu.cn 湘教QS4-201312-010059]