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 119
- Downloads 0
A Survey on Optimistic Fair Digital Signature Exchange Protocols
Security services become crucial to many applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery, with the phenomenal growth of the Internet and open networks. For th...
Software efforts estimation using Use Case Point approach by increasing Technical Complexity and Experience Factors
An IT industry wants a simple and accurate method of efforts estimation. Estimation of efforts before starting of work is a prediction and prediction always not accurate. Intermediate COCOMO considered 17 factor that aff...
APPLYING DYNAMIC DEPENDENCY INJECTION TOWARDS TEST CASE REDUCTION ON DISTRUBUTED SPATIAL DATA MANAGEMENT
The transfer and retrieval of spatial data is often looked as a laborious and time consuming one, especially if the participating entities are geographically separated. With the advent of modern cutting edge technologies...
MICROCONTROLLER PIN CONFIGURATION TOOL
Configuring the micro controller with large number of pins is tedious. Latest Infine on microcontroller contains more than 200 pins and each pin has classes of signals. Therefore the complexity of the microcontroller is...
An Integer Programming-based Local Search for Large-Scale Multidimensional Knapsack Problems
Integer programming-based local search (IPbLS) is a metaheuristic recently proposed for solving linear combinatorial optimization problems. IPbLS is basically the same as the first-choice hillclimbing except for using in...