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 109
- Downloads 0
SPN-MATRIX COMPLETION PROBLEM FOR STAR BI-DIRECTED GRAPH
In this paper an SPN-Matrix is considered. A Vertex distance path matrix (VDp) representing theStar bi-directed graph Sn is said to have an SPN-completion if every partial SPN-matrix specifying VDp can be completed to an...
A BATCH ARRIVAL BULK SERVICE QUEUE WITH MULTIPLE VACATIONS, OPTIONAL RE-SERVICE, CLOSEDOWN TIME AND SETUP TIME UNDER RESTRICTED ADMISSIBILITY OF ARRIVING BATCHES
We consider an M^X/G(a,b)/1 with multiple vacations, optional re-service, closedown time, setup time under a restricted admissibility policy of arriving batches is considered. A batch of customers arrive according to Po...
Restricted Constraints in a Max-Flow and Min-Cost problem
The present paper defines a combination of two most important and old flow problems such as maximum flow and minimum cost flow. In the first one a flow with the maximum value from source node to sink node is sought. The...
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.
A STUDY ON THE EFFECTIVE EDGES IN THE CARTESIAN PRODUCT OF FUZZY GRAPHS
In this paper we discuss the number of effective edges in the Cartesian product of fuzzy graphs. Some basic theorems and results are obtained on effective edges. Based on the results we find the effective edge domination...