【24h】

Self-similarity in the web

机译:网络中的自相似性

获取原文
获取原文并翻译 | 示例

摘要

Algorithmic tools for searching and mining the web are becoming increasingly sophisticated and vital. In this context, algorithms which use and exploit structural information about the web perform better than generic methods in both efficiency and reliability. We present an extensive characterization of the graph structure of the web, with a view to enabling high-performance applications that make use of this structure. In particular, we show that the web emerges as the outcome of a number of essentially independent stochastic processes that evolve at various scales. A striking consequence of this scale invariance is that the structure of the web is "fractal" ?cohesive sub-regions display the same characteristics as the web at large. An understanding of this underlying fractal nature is therefore applicable to designing data services across multiple domains and scales. We describe potential applications of this line of research to optimized algorithm design for web-scale data analysis.
机译:用于搜索和挖掘Web的算法工具正变得越来越复杂和重要。在这种情况下,使用和利用有关Web的结构信息的算法在效率和可靠性方面都比常规方法更好。我们将对Web的图形结构进行广泛的描述,以期使利用该结构的高性能应用程序成为可能。特别是,我们表明,网络的出现是各种规模不同的,本质上独立的随机过程的产物。这种尺度不变性的一个显着结果是纤维网的结构是“分形的”-内聚的子区域显示出与整个纤维网相同的特性。因此,对这种基本的分形性质的理解适用于跨多个域和规模设计数据服务。我们描述了这一研究领域在网络规模数据分析的优化算法设计中的潜在应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号