Incorporating compactness to generate term-association view snippets for ontology search

作者:

Highlights:

摘要

A query-relevant snippet for ontology search is useful for deciding if an ontology fits users’ needs. In this paper, we illustrate a good snippet in a keyword-based ontology search engine should be with term-association view and compact, and propose an approach to generate it. To obtain term-association view snippets, a model of term association graph for ontology is proposed, and a concept of maximal r-radius subgraph is introduced to decompose the term association graph into connected subgraphs, which preserve close relations between terms. To achieve compactness, in a query-relevant maximal r-radius subgraph, a connected subgraph thereof with a small graph weight is extracted as a sub-snippet. Finally, a greedy method is used to select sub-snippets to form a snippet in consideration of query relevance and compactness without violating the length constraint. An empirical study on our implementation shows that our approach is feasible. An evaluation on effectiveness shows that the term-association view snippet is favored by users, and the compactness helps reading and judgment.

论文关键词:Snippet generation,Ontology search,Term association graph,Maximal r-radius subgraph,Group Steiner

论文评审过程:Received 16 September 2011, Revised 28 June 2012, Accepted 18 July 2012, Available online 1 November 2012.

论文官网地址:https://doi.org/10.1016/j.ipm.2012.07.011