图 书 馆
大型 kPlex 的快速枚举Fast Enumeration of Large kPlexes |
|
| 课程网址: | http://videolectures.net/kdd2017_firmani_large_kplexes/ |
| 主讲教师: | Donatella Firmani |
| 开课单位: | 罗马第三大学 |
| 开课时间: | 2017-10-09 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | The k-plex is a formal yet flexible way of defining communities in any kind of network. It generalizes the notion of clique and is more appropriate in most real cases: while a node of a clique C is connected to all other nodes of C, a node of a k-plex may miss k connections. Unfortunately, computing all maximal k-plexes is a gruesome task and state of the art algorithms can only process small-size networks. In this paper we propose a new approach for enumerating large k-plexes in networks that speeds up the search of several orders of magnitude by leveraging: (i) methods for strongly reducing the search space and (ii) efficient techniques for the computation of maximal cliques. Several experiments show that our strategy is effective and is able to increase the size of the networks for which the computation of large k-plexes is feasible from a few hundred to several hundred thousand nodes. |
| 关 键 词: | 快速枚举; 枚举网络; 数据科学 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2023-12-26：wujk |
| 最后编审: | 2023-12-26：wujk |
| 阅读次数: | 24 |