图 书 馆
扫描：一种网络结构聚类算法SCAN: A Structural Clustering Algorithm for Networks |
|
| 课程网址: | http://videolectures.net/kdd07_xu_scan/ |
| 主讲教师: | Xiaowei Xu |
| 开课单位: | 阿肯色大学 |
| 开课时间: | 2007-09-14 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of intra-cluster edges. While such algorithms find useful and interesting structures, they tend to fail to identify and isolate two kinds of vertices that play special roles - vertices that bridge clusters (hubs) and vertices that are marginally connected to clusters (outliers). Identifying hubs is useful for applications such as viral marketing and epidemiology since hubs are responsible for spreading ideas or disease. In contrast, outliers have little or no influence, and may be isolated as noise in the data. In this paper, we proposed a novel algorithm called SCAN (Structural Clustering Algorithm for Networks), which detects clusters, hubs and outliers in networks. It clusters vertices based on a structural similarity measure. The algorithm is fast and efficient, visiting each vertex only once. An empirical evaluation of the method using both synthetic and real datasets demonstrates superior performance over other methods such as the modularity-based algorithms. |
| 关 键 词: | 网络聚类; 扫描; 桥梁集群 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-07-17：yumf |
| 阅读次数: | 293 |