Author:
Kayest Mamta,Jain Sanjay Kumar
Abstract
Purpose
Document retrieval has become a hot research topic over the past few years, and has been paid more attention in browsing and synthesizing information from different documents. The purpose of this paper is to develop an effective document retrieval method, which focuses on reducing the time needed for the navigator to evoke the whole document based on contents, themes and concepts of documents.
Design/methodology/approach
This paper introduces an incremental learning approach for text categorization using Monarch Butterfly optimization–FireFly optimization based Neural Network (MB–FF based NN). Initially, the feature extraction is carried out on the pre-processed data using Term Frequency–Inverse Document Frequency (TF–IDF) and holoentropy to find the keywords of the document. Then, cluster-based indexing is performed using MB–FF algorithm, and finally, by matching process with the modified Bhattacharya distance measure, the document retrieval is done. In MB–FF based NN, the weights in the NN are chosen using MB–FF algorithm.
Findings
The effectiveness of the proposed MB–FF based NN is proven with an improved precision value of 0.8769, recall value of 0.7957, F-measure of 0.8143 and accuracy of 0.7815, respectively.
Originality/value
The experimental results show that the proposed MB–FF based NN is useful to companies, which have a large workforce across the country.
Reference32 articles.
1. Incremental relevance feedback for information filtering,1996
2. Bigi, B. (2003), “Using Kullback–Leibler distance for text categorization”, in Sabastini, F. (Ed.), Advances in Information Retrieval, Vol. 2633, Springer, Berlin, pp. 305-319.
3. Fast incremental indexing for full-text information retrieval,1994
4. Hierarchical document classification with support vector machines,2004
5. Incremental clustering and dynamic information retrieval;SIAM Journal on Computing,2004
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献