Abstract
In this paper, we outline our ongoing work on diversifying keyword search results on RDF data. Given a keyword query over an RDF graph, we define the problem of diversifying the search results and we present diversification criteria that take into consideration both the content and the structure of the results, as well as the underlying RDF/S-OWL schema. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Bikakis, N., Giannopoulos, G., Liagouris, J., Skoutas, D., Dalamagas, T., & Sellis, T. (2013). RDivF: Diversifying keyword search on RDF graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8092 LNCS, pp. 413–416). https://doi.org/10.1007/978-3-642-40501-3_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
