2011
DOI: 10.1007/978-3-642-25073-6_6
|View full text |Cite
|
Sign up to set email alerts
|

Effective and Efficient Entity Search in RDF Data

Abstract: Abstract. Triple stores have long provided RDF storage as well as data access using expressive, formal query languages such as SPARQL. The new end users of the Semantic Web, however, are mostly unaware of SPARQL and overwhelmingly prefer imprecise, informal keyword queries for searching over data. At the same time, the amount of data on the Semantic Web is approaching the limits of the architectures that provide support for the full expressivity of SPARQL. These factors combined have led to an increased intere… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
91
0
1

Year Published

2013
2013
2019
2019

Publication Types

Select...
8
2

Relationship

2
8

Authors

Journals

citations
Cited by 92 publications
(92 citation statements)
references
References 20 publications
0
91
0
1
Order By: Relevance
“…acting together in a movie). We believe that the fact that it's picked by the model for the first split also reflects the fact that different signals for ranking naturally differ in their importance across entity types, as noted in [1]. Signals computed from the entity graph also make a remarkable contribution to the final ranking model, as well as co-occurrence features, especially those computed over Flickr data and user query sessions.…”
Section: Relevance Assessmentmentioning
confidence: 88%
“…acting together in a movie). We believe that the fact that it's picked by the model for the first split also reflects the fact that different signals for ranking naturally differ in their importance across entity types, as noted in [1]. Signals computed from the entity graph also make a remarkable contribution to the final ranking model, as well as co-occurrence features, especially those computed over Flickr data and user query sessions.…”
Section: Relevance Assessmentmentioning
confidence: 88%
“…The content-based algorithms are based on matching words in documents. TF-IDF [7] and BM25F [8] are samples of these algorithms. Connectivity-based algorithms use links between pages on the web of documents.…”
Section: Ranking Algorithms Of Web Of Documentsmentioning
confidence: 99%
“…Entity search has been studied in many approaches [1,[27][28][29][30]. The aforementioned approaches assume a central index comprising the entire data collection.…”
Section: Related Workmentioning
confidence: 99%