数据挖掘_Autonomous systems - Oregon-1(俄勒冈州自治系统数据集1)要领.pdf

数据挖掘_Autonomous systems - Oregon-1(俄勒冈州自治系统数据集1)要领.pdf

  1. 1、本文档共5页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Autonomous systems - Oregon-1(俄勒冈州自治系统 数据集1) 数据摘要: 9 graphs of Autonomous Systems (AS) peering information inferred from Oregon route-views between March 31 2001 and May 26 2001. Dataset statistics are calculated for the graph with the lowest (March 31 2001) and highest (from May 26 2001) number of nodes 中文关键词: 路由器, 自治,系统,网关,网络, 英文关键词: router,autonomous,gateway,system,network, 数据格式: TEXT 数据用途: 研究一个大型网络内的自治系统组织状况 数据详细介绍: Autonomous systems - Oregon-1 Dataset information 9 graphs of Autonomous Systems (AS) peering information inferred from Oregon route-views between March 31 2001 and May 26 2001. Dataset statistics are calculated for the graph with the lowest (March 31 2001) and highest (from May 26 2001) number of nodes: Dataset statistics for graph witdh lowest number of nodes - 3 31 2001) Nodes 10670 Edges 22002 Nodes in largest WCC 10670 (1.000) Edges in largest WCC 22002 (1.000) Nodes in largest SCC 10670 (1.000) Edges in largest SCC 22002 (1.000) Average clustering coefficient 0.4559 Number of triangles 17144 Fraction of closed triangles 0.009306 Diameter (longest shortest path) 9 90-percentile effective diameter 4.5 Dataset statistics for graph with highest number of nodes - 5 26 2001 Nodes 11174 Edges 23409 Nodes in largest WCC 11174 (1.000) Edges in largest WCC 23409 (1.000) Nodes in largest SCC

文档评论(0)

xiaofei2001128 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档