Sciweavers

Share
ESWS
2010
Springer

Hierarchical Link Analysis for Ranking Web Data

10 years 3 months ago
Hierarchical Link Analysis for Ranking Web Data
On the Web of Data, entities are often interconnected in a way similar to web documents. Previous works have shown how PageRank can be adapted to achieve entity ranking. In this paper, we propose to exploit locality on the Web of Data by taking a layered approach, similar to hierarchical PageRank approaches. We provide justifications for a two-layer model of the Web of Data, and introduce DING (Dataset Ranking) a novel ranking methodology based on this two-layer model. DING uses links between datasets to compute dataset ranks and combines the resulting values with semantic-dependent entity ranking strategies. We quantify the effectiveness of the approach with other link-based algorithms on large datasets coming from the Sindice search engine. The evaluation which includes a user study indicates that the resulting rank is better than the other approaches. Also, the resulting algorithm is shown to have desirable computational properties such as parallelisation.
Renaud Delbru, Nickolai Toupikov, Michele Catasta,
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where ESWS
Authors Renaud Delbru, Nickolai Toupikov, Michele Catasta, Giovanni Tummarello, Stefan Decker
Comments (0)
books