IDEAS home Printed from https://ideas.repec.org/a/igg/jswis0/v8y2012i4p1-19.html
   My bibliography  Save this article

Learning to Rank Complex Semantic Relationships

Author

Listed:
  • Na Chen

    (Department of Computer Science, University of Southern California, Los Angeles, CA, USA)

  • Viktor K. Prasanna

    (Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA)

Abstract

This paper presents a novel ranking method for complex semantic relationship (semantic association) search based on user preferences. The authors’ method employs a learning-to-rank algorithm to capture each user’s preferences. Using this, it automatically constructs a personalized ranking function for the user. The ranking function is then used to sort the results of each subsequent query by the user. Query results that more closely match the user’s preferences gain higher ranks. Their method is evaluated using a real-world RDF knowledge base created from Freebase linked-open-data. The experimental results show that the authors’ method significantly improves the ranking quality in terms of capturing user preferences, compared with the state-of-the-art.

Suggested Citation

  • Na Chen & Viktor K. Prasanna, 2012. "Learning to Rank Complex Semantic Relationships," International Journal on Semantic Web and Information Systems (IJSWIS), IGI Global, vol. 8(4), pages 1-19, October.
    • Handle: RePEc:igg:jswis0:v:8:y:2012:i:4:p:1-19
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jswis.2012100101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jswis0:v:8:y:2012:i:4:p:1-19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.