Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1557670.1557686acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Language-model-based ranking in entity-relation graphs

Published: 28 June 2009 Publication History

Abstract

We propose a language-model-based ranking approach for SPARQL-like queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching, and approximate matching with text predicates. We show the effectiveness of our model through examples.

References

[1]
S. Auer, et. al. Dbpedia: A nucleus for a web of open data. ISWC/ASWC 2007
[2]
H. Fang, C. Zhai. Probabilistic models for expert finding. ECIR 2007
[3]
V. Hristidis, H. Hwang, Y. Papakonstantinou. Authority-based keyword search in databases. TODS, 33(1), 2008
[4]
G. Kasneci, et. al. Naga: Searching and ranking knowledge. ICDE 2008
[5]
Z. Nie, et. al. Web object retrieval. WWW 2007
[6]
D. Petkova, W. Croft. Hierarchical language models for expert finding in enterprise corpora. Int. J. on Al Tools, 17(1), 2008
[7]
P. Serdyukov, D. Hiemstra. Modeling documents as mixtures of persons for expert finding. ECIR 2008
[8]
F. M. Suchanek, G. Kasneci, G. Weikum. Yago: A core of semantic knowledge. WWW 2007
[9]
D. Vallet, H. Zaragoza. Inferring the most important types of a query: a semantic approach. SIGIR 2008

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KEYS '09: Proceedings of the First International Workshop on Keyword Search on Structured Data
June 2009
54 pages
ISBN:9781605585703
DOI:10.1145/1557670
  • General Chair:
  • M. Tamer Özsu,
  • Program Chairs:
  • Yi Chen,
  • Lei Chen
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 June 2009

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '09

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 145
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media