Stratified hypermedia structures for information disclosure
The Computer Journal - Special issue on information retrieval
Proceedings of the first ACM international conference on Digital libraries
Query expansion using local and global document analysis
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Improving the effectiveness of information retrieval with local context analysis
ACM Transactions on Information Systems (TOIS)
Interactive query expansion: a user-based evaluation in a relevance feedback environment
Journal of the American Society for Information Science
Probabilistic query expansion using query logs
Proceedings of the 11th international conference on World Wide Web
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Modern Information Retrieval
OntoSeek: Content-Based Access to the Web
IEEE Intelligent Systems
Effective Reformulation of Boolean Queries with Concept Lattices
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Usage-Oriented Evolution of Ontology-Based Knowledge Management Systems
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
A Contextual-Logic Extension of TOSCANA
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Mining world knowledge for analysis of search engine content
Web Intelligence and Agent Systems
VisiQ: Supporting visual and interactive query refinement
Web Intelligence and Agent Systems
Query Suggestion by Query Search: A New Approach to User Support in Web Search
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Neighborhood systems and approximate retrieval
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper we presented a framework for query refinement which is driven by user's information needs. Based on the analyses of the real web IR case studies we model the query refinement process as the process of decreasing query ambiguity with respect to the user's need. In the refinement process a user is provided with the query's neighborhood and the guidelines for changing the ambiguities of the query. The approach assumes the existence of a controlled vocabulary, which is used for describing the content of information resources. We model the queries (query-answering pairs), ambiguities and refinements formally. The partial ordering of the query-answering pairs in the searching space represents the mathematical lattice structure, so that formal concept analysis is used as the mathematical backbone of the query refinement process. We present a case study related to the searching in MEDLINE, which shows the benefits of using our approach.