Relational thesauri in information retrieval
Journal of the American Society for Information Science
The use of term position devices in ranked output experiments
Journal of Documentation
Inference networks for document retrieval
Inference networks for document retrieval
Using statistical testing in the evaluation of retrieval experiments
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Query expansion using lexical-semantic relations
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Combining the evidence of multiple query representations for information retrieval
TREC-2 Proceedings of the second conference on Text retrieval conference
Terminological knowledge structure for intermediary expert systems
Information Processing and Management: an International Journal
Combining automatic and manual index representations in probabilistic retrieval
Journal of the American Society for Information Science
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
A deductive data model for query expansion
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The impact of query structure and query expansion on retrieval performance
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Using clustering and SuperConcepts within SMART: TREC 6
Information Processing and Management: an International Journal - The sixth text REtrieval conference (TREC-6)
IR evaluation methods for retrieving highly relevant documents
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
ExpansionTool: Concept-Based Query Expansion and Construction
Information Retrieval
Using graded relevance assessments in IR evaluation
Journal of the American Society for Information Science and Technology
Exploring artificial intelligence in the new millennium
Applying query structuring in cross-language retrieval
Information Processing and Management: an International Journal
The polyrepresentation continuum in IR
IIiX Proceedings of the 1st international conference on Information interaction in context
Inter and intra-document contexts applied in polyrepresentation for best match IR
Information Processing and Management: an International Journal
A model for generating related weighted Boolean queries
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
How doctors search: A study of query behaviour and the impact on search results
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
The effects of query structures and query expansion (QE) onretrieval performance were tested with a best match retrieval system(InQuery^1). Query structure means the use ofoperators to express the relations between search keys. Six differentstructures were tested, representing strong structures (e.g., querieswith facets or concepts identified) and weak structures (no conceptsidentified, a query is ‘a bag of search keys’). QE was based onconcepts, which were first selected from a searching thesaurus, andthen expanded by semantic relationships given in the thesaurus. Theexpansion levels were (a) no expansion, (b) a synonym expansion, (c)a narrower concept expansion, (d) an associative concept expansion,and (e) a cumulative expansion of all other expansions. With weakstructures and Boolean structured queries, QE was not veryeffective. The best performance was achieved with a combination of afacet structure, where search keys within a facet were treated asinstances of one search key (the SYN operator), and the largestexpansion.