Efficient fuzzy ranking for keyword search on graphs

  • Arora, Nidhi R.
  • Lee, Wookey
  • Leung, Carson K.
  • Kim, Jinho
  • Kumar, Harshit
Citations

SCOPUS

13

초록

When compared with the traditional single-node results returned by search engines, keyword search over graphs is a new answering paradigm that brings new challenges to ranking. In this paper, we propose an efficient fuzzy-set theory based ranking measure called FRank. This measure captures the presence and relevance of query keywords and their query-dependent edge weights. It evaluates the query answer based on the distribution of keywords in the query and the structural connectivity between these keywords. Experimental results show that our proposed FRank measure led to superior performance when compared with traditional ranking measures. © 2012 Springer-Verlag.

키워드

Fuzzy setsgraph rankinformation retrieval (IR)keyword search
제목
Efficient fuzzy ranking for keyword search on graphs
저자
Arora, Nidhi R.Lee, WookeyLeung, Carson K.Kim, JinhoKumar, Harshit
DOI
10.1007/978-3-642-32600-4_38
발행일
2012
유형
Conference paper
저널명
Lecture Notes in Computer Science
7446 LNCS
PART 1
페이지
502 ~ 510