Back to Search
Start Over
Incorporating compactness to generate term-association view snippets for ontology search
- Source :
- Information Processing & Management. 49:513-528
- Publication Year :
- 2013
- Publisher :
- Elsevier BV, 2013.
-
Abstract
- 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.
- Subjects :
- Information retrieval
Computer Science::Information Retrieval
InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL
Vertex connectivity
Library and Information Sciences
Management Science and Operations Research
Snippet
Ontology search
Computer Science Applications
Compact space
Empirical research
Media Technology
Graph (abstract data type)
Greedy algorithm
Information Systems
Mathematics
Subjects
Details
- ISSN :
- 03064573
- Volume :
- 49
- Database :
- OpenAIRE
- Journal :
- Information Processing & Management
- Accession number :
- edsair.doi...........70483d77838c3d8d98c42f525321fe4f
- Full Text :
- https://doi.org/10.1016/j.ipm.2012.07.011