Welcome to the InfoSci Platform
Reference Hub11
Learning to Rank Complex Semantic Relationships

Learning to Rank Complex Semantic Relationships

Na Chen, Viktor K. Prasanna
Copyright: © 2012 |Volume: 8 |Issue: 4 |Pages: 19
ISSN: 1552-6283|EISSN: 1552-6291|EISBN13: 9781466614888|DOI: 10.4018/jswis.2012100101
Cite Article Cite Article

MLA

Chen, Na, and Viktor K. Prasanna. "Learning to Rank Complex Semantic Relationships." IJSWIS vol.8, no.4 2012: pp.1-19. http://doi.org/10.4018/jswis.2012100101

APA

Chen, N. & Prasanna, V. K. (2012). Learning to Rank Complex Semantic Relationships. International Journal on Semantic Web and Information Systems (IJSWIS), 8(4), 1-19. http://doi.org/10.4018/jswis.2012100101

Chicago

Chen, Na, and Viktor K. Prasanna. "Learning to Rank Complex Semantic Relationships," International Journal on Semantic Web and Information Systems (IJSWIS) 8, no.4: 1-19. http://doi.org/10.4018/jswis.2012100101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.