A New Modified Collection Selection Algorithm using Optimal Term Weight for Web based Applications

α
K. S. Niraja
K. S. Niraja
σ
B. Ramana Reddy
B. Ramana Reddy
ρ
K. B. K. S. Durga
K. B. K. S. Durga
α Osmania University Osmania University

Send Message

To: Author

A New Modified Collection Selection Algorithm using Optimal Term Weight for Web based Applications

Article Fingerprint

ReserarchID

CSTNWS5A413

A New Modified Collection Selection Algorithm using Optimal Term Weight for Web based Applications Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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.

References

5 Cites in Article
  1. Michael Berry,Zlatko Drmac,Elizabeth Jessup (1999). Matrices, Vector Spaces, and Information Retrieval.
  2. J Callan,A Powell,J French,M Connell (2000). The effects of query-based sampling on automatic database selection algorithms.
  3. Nick Craswell,Peter Bailey,David Hawking (2000). Server selection on the World Wide Web.
  4. John King,Yuefeng Li Web Based Collection Selection Using Singular Value Decomposition School of Software Engineering and Data Communications Queensland University of Technology QLD 4001.
  5. N Zhong,J Liu,Y Yao (2002). In Search of the Wisdom Web.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

K. S. Niraja. 2016. \u201cA New Modified Collection Selection Algorithm using Optimal Term Weight for Web based Applications\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 16 (GJCST Volume 16 Issue E2): .

Download Citation

Issue Cover
GJCST Volume 16 Issue E2
Pg. 33- 34
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-E Classification: H.3.5 I.1.2
Version of record

v1.2

Issue date

April 18, 2016

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 7338
Total Downloads: 1947
2026 Trends
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A New Modified Collection Selection Algorithm using Optimal Term Weight for Web based Applications

K. S. Niraja
K. S. Niraja Osmania University
B. Ramana Reddy
B. Ramana Reddy
K. B. K. S. Durga
K. B. K. S. Durga

Research Journals