Retrieving keyworded subgraphs with graph ranking score

  • Authors:

  • Seung Kim;Wookey Lee;Nidhi R. Arora;Tae-Chang Jo;Suk-Ho Kang

  • Affiliations:

  • Dept. of Industrial Engineering, Seoul National University, 599 Gwanak-ro, Gwanak-gu, Seoul 151-744, Republic of Korea;Dept. of Industrial Engineering, INHA University, 253 Yonghyun-dong, Nam-gu, Incheon 402-751, Republic of Korea;Dept. of Industrial Engineering, INHA University, 253 Yonghyun-dong, Nam-gu, Incheon 402-751, Republic of Korea;Dept. of Mathematics, INHA University, 253 Yonghyun-dong, Nam-gu, Incheon 402-751, Republic of Korea;Dept. of Industrial Engineering, Seoul National University, 599 Gwanak-ro, Gwanak-gu, Seoul 151-744, Republic of Korea

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 12.05

Visualization

Abstract

Keyword queries have long been popular to search engines and to the information retrieval community and have recently gained momentum for its usage in the expert systems community. The conventional semantics for processing a user query is to find a set of top-k web pages such that each page contains all user keywords. Recently, this semantics has been extended to find a set of cohesively interconnected pages, each of which contains one of the query keywords scattered across these pages. The keyword query having the extended semantics (i.e., more than a list of keywords hyperlinked with each other) is referred to the graph query. In case of the graph query, all the query keywords may not be present on a single Web page. Thus, a set of Web pages with the corresponding hyperlinks need to be presented as the search result. The existing search systems reveal serious performance problem due to their failure to integrate information from multiple connected resources so that an efficient algorithm for keyword query over graph-structured data is proposed. It integrates information from multiple connected nodes of the graph and generates result trees with the occurrence of all the query keywords. We also investigate a ranking measure called graph ranking score (GRS) to evaluate the relevant graph results so that the score can generate a scalar value for keywords as well as for the topology.