Development of an instrument measuring user satisfaction of the human-computer interface
CHI '88 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Beyond Steiner's Problem: A VLSI Oriented Generalization
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Bounds on the quality of approximate solutions to the Group Steiner Problem
WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
OntoKhoj: a semantic web portal for ontology searching, ranking and classification
WIDM '03 Proceedings of the 5th ACM international workshop on Web information and data management
Computer
Ontology summarization based on rdf sentence graph
Proceedings of the 16th international conference on World Wide Web
Spark: top-k keyword query in relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast generation of result snippets in web search
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Automatic summarising: The state of the art
Information Processing and Management: an International Journal
Query biased snippet generation in XML search
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Pseudo-relevance feedback and statistical query expansion for web snippet generation
Information Processing Letters
Term Dependence on the Semantic Web
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
RDF Snippets for Semantic Web Search Engines
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Snippet Generation for Semantic Web Search Engines
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Practical and effective IR-style keyword search over semantic web
Information Processing and Management: an International Journal
STAR: Steiner-Tree Approximation in Relationship Graphs
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Keyword search on structured and semi-structured data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
SQORE: a framework for semantic query based ontology retrieval
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Sindice.com: weaving the open linked data
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Blog snippets: a comments-biased approach
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Generating summaries for ontology search
Proceedings of the 20th international conference companion on World wide web
The summary abox: cutting ontologies down to size
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Information Processing and Management: an International Journal
Hi-index | 0.00 |
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.