A New Modified Collection Selection Algorithm using Optimal Term Weight for Web based Applications
Keywords:
singular value matrix(s), term matrix (u), collection matrix (v)
Abstract
As the number of electronic data collections available on the internet increases so does the difficulty of finding the right collection for a given query Often the first time user will be overwhelmed by the array of options available and will waste time hunting through pages of collection names followed by time reading results pages after doing an adhoc search Collection selection using optimal weight methods try to solve this problem by suggesting the best subset of collections to search based on a query This is of importance to fields containing large number of electronic collections which undergo frequent change and collections that cannot be fully indexed using traditional methods such as spiders This paper presents a solution to these problems of selecting the best collections and reducing the number of collections needing to be searched
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2016-01-15
Issue
Section
License
Copyright (c) 2016 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.