상세 보기
초록
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 sets; graph rank; information retrieval (IR); keyword search
- 제목
- Efficient fuzzy ranking for keyword search on graphs
- 저자
- Arora, Nidhi R.; Lee, Wookey; Leung, Carson K.; Kim, Jinho; Kumar, Harshit
- 발행일
- 2012
- 유형
- Conference paper
- 권
- 7446 LNCS
- 호
- PART 1
- 페이지
- 502 ~ 510