图 书 馆
Doulion:在大规模计算三角形图中使用硬币Doulion: Counting Triangles in Massive Graphs with a Coin |
|
| 课程网址: | http://videolectures.net/kdd09_tsourakakis_dctmgwc/ |
| 主讲教师: | Tsourakakis Charalampos E |
| 开课单位: | 卡内基梅隆大学 |
| 开课时间: | 信息不详。欢迎您在右侧留言补充。 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analysis. Metrics frequently computed such as the clustering coefficient and the transitivity ratio involve the execution of a triangle counting algorithm. Furthermore, several interesting graph mining applications rely on computing the number of triangles in the graph of interest. In this paper, we focus on the problem of counting triangles in a graph. We propose a practical method, out of which all triangle counting algorithms can potentially benefit. Using a straight-forward triangle counting algorithm as a black box, we performed 166 experiments on real-world networks and on synthetic datasets as well, where we show that our method works with high accuracy, typically more than 99\% and gives significant speedups, resulting in even $\approx$ 130 times faster performance. |
| 关 键 词: | 聚类系数; 传递性比; 图形挖掘应用程序 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-11-22：cwx |
| 阅读次数: | 30 |