Ontology driven Pre and Post Ranking based Information Retrieval in Web Search Engines
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 6
Abstract
With the tremendous growth of World Wide Web, it has become necessary to organize the information in such a way that it will make easier for the end users to find the information they want efficiently and accurately. This requires a pre-ranking of the underlying similar documents after the formation of the index. Thereafter the ranking of the search results in response to a query takes place which provides relevant results to user. This paper proposes an ontology driven pre ranking of the documents with identical context and hence post ranking of the search results using keyword matching of the expanded query terms and document keywords in the pre-ranked search results.
Authors and Affiliations
Parul Gupta , Dr. A. K. Sharma
Keywords
Related Articles
- EP ID EP119668
- DOI -
- Views 130
- Downloads 0
A Study on the Performance of Android Platform
As the Android platform is widely used for embedded systems including smart mobile devices, the needs for systematic performance analysis have significantly increased. System performance is usually measured by benchmarks...
Preprocessing and Screen-Cursor Mapping for a Virtual TouchScreen on a Projected Area
Virtual Touch Screen, on a projected area, is a system in which the projection on any ordinary flat surface provides us a graphical work-field for controlling specific kind of operations without any sophisticated touch s...
Role of IPv6 over Fibre (FIPv6): Issues and Challenges.
Deploying the next generation Internet protocol (IPv6) over Fibre is facing an important challenge as the Fibre standard is failing to support IPv6 functionalities. In fact unlike the other tandards Fibre optic links is...
Impact Analysis of Recent DDoS Attacks
In the present era Internet has changed the way of traditional essential services such as banking, transportation, power, health, and defence being operated. These operations are being replaced by cheaper, more efficient...
Entropy Based Lossless Fractal Image Compression using Irregular Rectangular Partitions
Entropy of an image can be taken as a parameter of variation among pixel values. Equal value for all pixels in an image results in zero entropy. This idea is incorporated at the time of partitioning the image. Partitions...