摘要
链状解析算法已经被广泛应用于网络信息检索。然而,当前的链状解析算法通常用于平面链状图,忽略了网络的分层结构。这会导致两个问题的出现:链状结构越来越少和比较偏向于上层网页。文中提出了一个能够解决这两个问题的新排序算法,叫做分层排序,这种算法可以用于网络中的分层结构和链状结构。在实验结果中显示分层排序算法持续超过了其它知名排序算法,其中包括网页排序算法、块排序算法和层次排序算法。
Link analysis algorithms have been extensively used in Web inforroation retrieval. However, current link analysis algorithms generally work on a fiat link graph, ignoring the hierarchical structure of the Web graph. They often suffer from two problems: the sparsity of link graph and biased ranking of newly- emerging pages. In this paper, propose a novel ranking algorithm called hierarchical rank as a solution to these two problems, which considers both the hierarchical structure and the link structure of the Weh. Experimental results show that hierarchical ranking algorithm consistently outperforms other well - known ranking algorithms, including the PageRank, BlockRank and LayerRank.
出处
《计算机技术与发展》
2009年第9期35-37,共3页
Computer Technology and Development
基金
湖北省中青年人才计划项目(Q20074006)
关键词
链状解析
分层网络图
分层自由遍历模式
link analysis
hierarchical web graph
hierarchical random walk model