arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0203024cs.IRcs.DL
收藏

Web上广泛主题的结构

The structure of broad topics on the Web

Soumen Chakrabarti, Mukul M. Joshi, Kunal Punera, David M. Pennock

摘要:

Web图是一个巨大的社会网络,其属性已被广泛测量和建模,在最近几年。大多数这样的研究集中在图的结构,而不考虑节点的文本属性。因此,Web社区的特征纯粹在于图结构,而不是页面内容。我们建议,主题分类,如雅虎!或者开放目录提供了一个有用的框架,用于理解基于内容的集群和社区的结构。特别是,使用的主题分类和自动分类器,我们可以衡量广泛的主题在Web上的背景分布,并分析最近的随机游走算法的能力,以绘制样本,遵循这样的分布。此外,我们还可以测量一个关于一个广泛主题的页面链接到另一个广泛主题的概率。扩展这个实验,我们可以测量在Web图上随机行走时主题上下文丢失的速度。对这个主题混合距离的估计可以解释为什么全局PageRank在广泛查询的上下文中仍然有意义。在一般情况下,我们的测量可能会被证明是有价值的社区特定的爬虫和基于链接的排名系统的设计。

英文摘要:

The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, and do not consider textual properties of the nodes. Consequently, Web communities have been characterized purely in terms of graph structure and not on page content. We propose that a topic taxonomy such as Yahoo! or the Open Directory provides a useful framework for understanding the structure of content-based clusters and communities. In particular, using a topic taxonomy and an automatic classifier, we can measure the background distribution of broad topics on the Web, and analyze the capability of recent random walk algorithms to draw samples which follow such distributions. In addition, we can measure the probability that a page about one broad topic will link to another broad topic. Extending this experiment, we can measure how quickly topic context is lost while walking randomly on the Web graph. Estimates of this topic mixing distance may explain why a global PageRank is still meaningful in the context of broad queries. In general, our measurements may prove valuable in the design of community-specific crawlers and link-based ranking systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑