شبکه استنادی فیزیک انرژی بالا
فایل ها
عنوان | حجم |
cit-HepPh-dates.txt.gz | 94 KB |
cit-HepPh.txt.gz | 1.6 MB |
منبع (استناد)
- Leskovec, J. Kleinberg and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2005.
- Gehrke, P. Ginsparg, J. M. Kleinberg. Overview of the 2003 KDD Cup. SIGKDD Explorations 5(2): 149-151, 2003.
آمارهای دیتاست
Nodes |
34546 |
Edges |
421578 |
Nodes in largest WCC |
34401 (0.996) |
Edges in largest WCC |
421485 (1.000) |
Nodes in largest SCC |
12711 (0.368) |
Edges in largest SCC |
139981 (0.332) |
Average clustering coefficient |
0.2848 |
Number of triangles |
1276868 |
Fraction of closed triangles |
0.05377 |
Diameter (longest shortest path) |
12 |
90-percentile effective diameter |
5 |
شبکه استناد به نظریه فیزیک انرژی بالا
فایل ها
عنوان | حجم |
cit-HepTh-abstracts.tar.gz | 11 MB |
cit-HepTh-dates.txt.gz | 94 KB |
cit-HepTh.txt.gz | 1.3 MB |
منبع(استناد)
- Leskovec, J. Kleinberg and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2005.
- Gehrke, P. Ginsparg, J. M. Kleinberg. Overview of the 2003 KDD Cup. SIGKDD Explorations 5(2): 149-151, 2003.
آمارهای دیتاست
Nodes |
27770 |
Edges |
352807 |
Nodes in largest WCC |
27400 (0.987) |
Edges in largest WCC |
352542 (0.999) |
Nodes in largest SCC |
7464 (0.269) |
Edges in largest SCC |
116268 (0.330) |
Average clustering coefficient |
0.3120 |
Number of triangles |
1478735 |
Fraction of closed triangles |
0.04331 |
Diameter (longest shortest path) |
13 |
90-percentile effective diameter |
5.3 |
شبکه استنادی ثبت اختراع
فایل ها
عنوان | حجم |
cit-Patents.txt.gz | 81 MB |
patents.html | 35 KB |
منبع(استناد)
- Leskovec, J. Kleinberg and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2005.
آمارهای دیتاست
Nodes |
3774768 |
Edges |
16518948 |
Nodes in largest WCC |
3764117 (0.997) |
Edges in largest WCC |
16511741 (1.000) |
Nodes in largest SCC |
1 (0.000) |
Edges in largest SCC |
0 (0.000) |
Average clustering coefficient |
0.0757 |
Number of triangles |
7515023 |
Fraction of closed triangles |
0.02343 |
Diameter (longest shortest path) |
22 |
90-percentile effective diameter |
9.4 |