Tabu annealing: an efficient and scalable strategy for document retrieval
by K. Latha, R. Rajaram
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 3, No. 3, 2009

Abstract: This paper implements clustering algorithm to the convergence of solution space for large sets of text documents and applies retrieval methodologies to find the information of interest. We propose tabu annealing, a heuristic approach which is a combination of tabu search and simulated annealing with clustering approach. The results of the proposed approach are superior to simulated annealing and tabu search in terms of precision, recall, F-measure, mean fitness, search space and time complexity.

Online publication date: Fri, 07-Aug-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com