REMOVING NON-RELEVANT LINKS FROM TOP SEARCH RESULTS USING FEATURE SCORE COMPUTATION
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 2
Abstract
To promote website in search engine rankings in order to get better visibility and more traffic, search engine optimizers have to follow legal ways but some search engine optimizers manipulate the web pages and boost the irrelevant pages in search results and this leads to practice the problem of web spam. These malicious pages reduce the performance of the search engine. We innovates a method to override the irrelevant search results. In this paper a new approach is designed and developed to move non-deserving pages downward from list of results returned by search engine. The first step was to determine the importance of different page features used for the ranking of a page in search results. Based on this information the devised system identified the features in a page and assigned some weight to each feature. The user query i.e. search keyword, precision and ranking factor are used to calculate precision score of a page. This score is used to predict ranking position for each page. A comparison was made between original ranking positions and predicted ranking position of irrelevant web pages. From analysis of results of Google, accuracy of search results improved from 88% to 99% for the corpus compiled now.
Authors and Affiliations
Swati P. Patil
Keywords
Related Articles
- EP ID EP531744
- DOI 10.5958/2320-3226.2018.00034.6
- Views 119
- Downloads 0
VARIANCE BALANCED INCOMPLETE BLOCK DESIGNS
This paper provides two new series for the construction for General Efficiency Balanced Incomplete Block Design using the combinatorial arrangement of Efficiency Balanced Incomplete Block Designs.
ON DIVISOR CORDIAL GRAPH
In this paper we prove that some known graphs such as the Herschel graph and some graphs constructed in this paper are divisor cordial graphs.
Common Fixed Point for Compatible Mappings of Type () Satisfying an Implicit Relation
Here we prove a common fixed point theorem for compatible mappings of type () satisfying an implicit relation. We extend results of Popa [9] for five mappings.
ON THE DEGENERATE LAPLACE TRANSFORM - I
We make an attempt in this paper to extend the very recent work of Kim and Kim [24] on degenerate Laplace transform. Using the definition of the degenerate Laplace transform as given by Kim and Kim [24] and some of the...
DETERMINATION OF OPTIMAL RESERVE BETWEEN TWO MACHINES IN SERIES WITH THE REPAIR TIME HAS CHANGE OF PARAMETER AFTER THE TRUNCATION POINT
In inventory control, suitable models for various real life systems are constructed with the objective of determining the optimal inventory level. A new type of inventory model using the so-called Setting the Clock Back...