澳门新葡8455最新网站,www.8455.com,新葡京最新官网

当前位置: 澳门新葡8455最新网站 > 学术活动 > 正文
Community Detection by L0-penalized Graph Laplacian
澳门新葡8455最新网站:2017年05月04日 09:21 点击数:

报告人:席瑞斌

报告地点:澳门新葡8455最新网站四楼学术报告厅

报告澳门新葡8455最新网站:2017年05月06日星期六16:30-17:00

邀请人:

报告摘要:

Community detection in network analysis aims at partitioning nodes in a network into K disjoint communities. Most currently available algorithms assume that K is known, but choosing a correct K is generally very difficult for real networks. In this paper, we propose a tightness criterion, a novel model free criterion, and an efficient algorithm to maximize this criterion for community detection. This tightness criterion is closely related with the graph Laplacian with L0 penalty. Our method does not require a known K and can properly detect communities in networks with outliers.The theoretical result guarantees that, under the degree corrected stochastic block model, even for networks with outliers, the maximizer of the tightness criterion can extract communities with small misclassification rates even when the number of communities grows to infinity as the network size grows. Numerical results show that the proposed method work considerably better than other community detection methods. Application to a college football data and a yeast protein-protein data also reveals that the proposed method performs significantly better.

.

 

主讲人概况:

席瑞斌,北京大学大学研究员。

Copyright ©版权所有:澳门新葡8455最新网站

地址:吉林省长春市人民大街5268号|邮编:130024|电话:0431-85099589|传真:0431-85098237


XML 地图 | Sitemap 地图