Welcome to the InfoSci Platform
Domain Specific Custom Search for Quicker Information Retrieval

Domain Specific Custom Search for Quicker Information Retrieval

Tushar Kanti Saha, A. B. M. Shawkat Ali
Copyright: © 2013 |Volume: 3 |Issue: 3 |Pages: 14
ISSN: 2155-6377|EISSN: 2155-6385|EISBN13: 9781466633384|DOI: 10.4018/ijirr.2013070102
Cite Article Cite Article

MLA

Saha, Tushar Kanti, and A. B. M. Shawkat Ali. "Domain Specific Custom Search for Quicker Information Retrieval." IJIRR vol.3, no.3 2013: pp.26-39. http://doi.org/10.4018/ijirr.2013070102

APA

Saha, T. K. & Ali, A. B. (2013). Domain Specific Custom Search for Quicker Information Retrieval. International Journal of Information Retrieval Research (IJIRR), 3(3), 26-39. http://doi.org/10.4018/ijirr.2013070102

Chicago

Saha, Tushar Kanti, and A. B. M. Shawkat Ali. "Domain Specific Custom Search for Quicker Information Retrieval," International Journal of Information Retrieval Research (IJIRR) 3, no.3: 26-39. http://doi.org/10.4018/ijirr.2013070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Recently researchers are using Google scholar widely to find out the research articles and the relevant experts in their domain. But it is unable to find out all experts in a relevant research area from a specific country by a quick search. Basically the custom search technique is not available in the current Google scholar’s setup. The authors have combined custom search with domain-specific search and named as domain specific custom search in this research. First time this research introduces a domain specific custom search technique using new search methodology called n-paged-m-items partial crawling algorithm. This algorithm is a real-time faster crawling algorithm due to the partial crawling technique. It does not store anything in the database, which can be shown later on to the user. The proposed algorithm is implemented on a new domain scholar.google.com to find out the scholars or experts quickly. Finally the authors observe the better performance of the proposed algorithm comparing with Google scholar.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.