图 书 馆
并行结构图聚类Parallel Structural Graph Clustering |
|
| 课程网址: | http://videolectures.net/ecmlpkdd2011_seeland_clustering/ |
| 主讲教师: | Madeleine Seeland |
| 开课单位: | 慕尼黑工业大学 |
| 开课时间: | 信息不详。欢迎您在右侧留言补充。 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | We address the problem of clustering large graph databases according to scaffolds (i.e., large structural overlaps) that are shared between cluster members. In previous work, an online algorithm was proposed for this task that produces overlapping (non-disjoint) and nonexhaustive clusterings. In this paper, we parallelize this algorithm to take advantage of high-performance parallel hardware and further improve the algorithm in three ways: a refined cluster membership test based on a set abstraction of graphs, sorting graphs according to size, to avoid cluster membership tests in the first place, and the definition of a cluster representative once the cluster scaffold is unique, to avoid cluster comparisons with all cluster members. In experiments on a large database of chemical structures, we show that running times can be reduced by a large factor for one parameter setting used in previous work. For harder parameter settings, it was possible to obtain results within reasonable time for 300,000 structures, compared to 10,000 structures in previous work. This shows that structural, scaffold-based clustering of smaller libraries for virtual screening is already feasible. |
| 关 键 词: | 网络分析; 聚类分析; 计算机科学; 机器学习; 无监督学习 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-12-05：cwx |
| 阅读次数: | 43 |