Proceedings of the 13th international conference on World Wide Web
CNSR '04 Proceedings of the Second Annual Conference on Communication Networks and Services Research
Web page ranking using link attributes
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
SemRank: ranking complex relationship search results on the semantic web
WWW '05 Proceedings of the 14th international conference on World Wide Web
Object-level ranking: bringing order to Web objects
WWW '05 Proceedings of the 14th international conference on World Wide Web
Exploiting the hierarchical structure for link analysis
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient PageRank approximation via graph aggregation
Information Retrieval
AggregateRank: bringing order to web sites
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
On rank correlation in information retrieval evaluation
ACM SIGIR Forum
Hits on the web: how does it compare?
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Computing pagerank in a distributed internet search system
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Using Naming Authority to Rank Data and Ontologies for Web Search
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Finding and ranking knowledge on the semantic web
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Ontology similarity in the alignment space
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Hybrid search ranking for structured and unstructured data
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
RELIN: relatedness and informativeness-based centrality for entity summarization
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Linking semantic desktop data to the web of data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part II
Searching and browsing Linked Data with SWSE: The Semantic Web Search Engine
Web Semantics: Science, Services and Agents on the World Wide Web
Searching web data: An entity retrieval and high-performance indexing model
Web Semantics: Science, Services and Agents on the World Wide Web
An empirical survey of Linked Data conformance
Web Semantics: Science, Services and Agents on the World Wide Web
Query-Independent learning to rank for RDF entity search
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
SPRING: ranking the results of SPARQL queries on linked data
Proceedings of the 17th International Conference on Management of Data
Hi-index | 0.00 |
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.