Relational thesauri in information retrieval
Journal of the American Society for Information Science
Another look at automatic text-retrieval systems
Communications of the ACM
Introduction to information storage and retrieval systems
Information retrieval
A cooccurrence-based thesaurus and two applications to information retrieval
Information Processing and Management: an International Journal
Fast and effective query refinement
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Self-organizing maps
Pattern Recognition Letters
Using Iterative Refinement to Find Reusable Software
IEEE Software
Automatic Information Organization and Retrieval.
Automatic Information Organization and Retrieval.
Hi-index | 0.00 |
In this study, a query refinement mechanism based on the Self-Organising Map (SOM) is proposed. SOM has been extensively in document classification. Based on the classification result, a fuzzy-related thesaurus can be derived for query refinement. In contrast with general relational thesanrus, the fuzzy-related thesaurus is more effective and efficient. The relationships between the terms are based on the classification of the document collection, and thus, the generated relationships among the terms have more power to enhance retrieval quality. The recognition of the relationships can be done automatically without human involvement. This will significantly reduces the cost associated with the effort devoted to manually identifying the relationships. An evaluation on the query refinement mechanism based on the fuzzy-related thesaurus has conducted and the preliminary result is promising. A significant improvement on retrieval performance was observed when a fuzzy-related thesaurus was used for query refinement for a software document collection.