scholarly journals QoS Based Ranking For Web Search

2021 ◽  
Author(s):  
Xiangyi Chen
Keyword(s):  
Quality Of Service ◽  
Search Engine ◽  
Web Search ◽  
Web Pages ◽  
Ranking Algorithm ◽  
Internet Connection ◽  
Web Search Engine ◽  
The One ◽  
The Web

Text, link and usage information are the most commonly used sources in the ranking algorithm of a web search engine. In this thesis, we argue that the quality of the web pages such as the performance of the page delivery (e.g. reliability and response time) should also play an important role in ranking, especially for users with a slow Internet connection or mobile users. Based on this principle, if two pages have the same level of relevancy to a query, the one with a higher delivery quality (e.g. faster response) should be ranked higher. We define several important attributes for the Quality of Service (QoS) and explain how we rank the web pages based on these algorithms. In addition, while combining those QoS attributes, we have tested and compared different aggregation algorithms. The experiment results show that our proposed algorithms can promote the pages with a higher delivery quality to higher positions in the result list, which is beneficial to users to improve their overall experiences of using the search engine and QoS based re-ranking algorithm always gets the best performance.

scholarly journals QoS Based Ranking For Web Search

2021 ◽  
Author(s):  
Xiangyi Chen
Keyword(s):  
Quality Of Service ◽  
Search Engine ◽  
Web Search ◽  
Web Pages ◽  
Ranking Algorithm ◽  
Internet Connection ◽  
Web Search Engine ◽  
The One ◽  
The Web

Text, link and usage information are the most commonly used sources in the ranking algorithm of a web search engine. In this thesis, we argue that the quality of the web pages such as the performance of the page delivery (e.g. reliability and response time) should also play an important role in ranking, especially for users with a slow Internet connection or mobile users. Based on this principle, if two pages have the same level of relevancy to a query, the one with a higher delivery quality (e.g. faster response) should be ranked higher. We define several important attributes for the Quality of Service (QoS) and explain how we rank the web pages based on these algorithms. In addition, while combining those QoS attributes, we have tested and compared different aggregation algorithms. The experiment results show that our proposed algorithms can promote the pages with a higher delivery quality to higher positions in the result list, which is beneficial to users to improve their overall experiences of using the search engine and QoS based re-ranking algorithm always gets the best performance.

scholarly journals WEB GRAPH BASED SEARCH BY USING DENSITY OF KEYWORD AND AGE FACTOR

2013 ◽  
pp. 89-93
Author(s):  
GAURAV AGARWAL ◽  
SACHI GUPTA ◽  
SAURABH MUKHERJEE
Keyword(s):  
Search Engine ◽  
Web Search ◽  
Web Pages ◽  
Main Role ◽  
Ranking Algorithm ◽  
Web Page ◽  
Web Crawler ◽  
User Requirement ◽  
Priority Assignment ◽  
The Web

Today, web servers, are the key repositories of the information & internet is the source of getting this information. There is a mammoth data on the Internet. It becomes a difficult job to search out the accordant data. Search Engine plays a vital role in searching the accordant data. A search engine follows these steps: Web crawling by crawler, Indexing by Indexer and Searching by Searcher. Web crawler retrieves information of the web pages by following every link on the site. Which is stored by web search engine then the content of the web page is indexed by the indexer. The main role of indexer is how data can be catch soon as per user requirements. As the client gives a query, Search Engine searches the results corresponding to this query to provide excellent output. Here ambition is to enroot an algorithm for search engine which may response most desirable result as per user requirement. In this a ranking method is used by the search engine to rank the web pages. Various ranking approaches are discussed in literature but in this paper, ranking algorithm is proposed which is based on parent-child relationship. Proposed ranking algorithm is based on priority assignment phase of Heterogeneous Earliest Finish Time (HEFT) Algorithm which is designed for multiprocessor task scheduling. Proposed algorithm works on three on range variable its means the density of keywords, number of successors to the nodes and the age of the web page. Density shows the occurrence of the keyword on the particular web page. Numbers of successors represent the outgoing link to a single web page. Age is the freshness value of the web page. The page which is modified recently is the freshest page and having the smallest age or largest freshness value. Proposed Technique requires that the priorities of each page to be set with the downward rank values & pages are arranged in ascending/ Descending order of their rank values. Experiments show that our algorithm is valuable. After the comparison with Google we find that our Algorithm is performing better. For 70% problems our algorithm is working better than Google.

Based on DNS of a Layered Web Search Engine Study

2014 ◽  
Vol 971-973 ◽  
pp. 1870-1873
Author(s):  
Xiao Gang Dong
Keyword(s):  
Search Engine ◽  
Web Search ◽  
Web Pages ◽  
Distributed Architecture ◽  
Search System ◽  
Web Search Engine ◽  
Original Idea ◽  
Commercial Search Engine ◽  
New System ◽  
The Web

Web search engine based on DNS, the standard proposed solution of IETF for public web search system, is introduced in this paper. Now no web search engine can cover more than 60 percent of all the pages on Internet. The update interval of most pages database is almost one month. This condition hasn't changed for many years. Converge and recency problems have become the bottleneck problem of current web search engine. To solve these problems, a new system, search engine based on DNS is proposed in this paper. This system adopts the hierarchical distributed architecture like DNS, which is different from any current commercial search engine. In theory, this system can cover all the web pages on Internet. Its update interval could even be one day. The original idea, detailed content and implementation of this system all are introduced in this paper.

scholarly journals STRUCTURAL WEB SEARCH ENGINE

2004 ◽  
Vol 13 (01) ◽  
pp. 27-44 ◽  
Author(s):  
ARASH RAKHSHAN ◽  
LAWRENCE B. HOLDER ◽  
DIANE J. COOK
Keyword(s):  
Search Engine ◽  
Web Search ◽  
Keyword Search ◽  
Information Access ◽  
Web Pages ◽  
Web Page ◽  
New Approach ◽  
Web Search Engine ◽  
New Challenges ◽  
The Web

We present a new approach in web search engines. The web creates new challenges for information retrieval. The vast improvement in information access is not the only advantage resulting from the keyword search. Additionally, much potential exists for analyzing interests and relationships within the structure of the web. The creation of a hyperlink by the author of a web page explicitly represents a relationship between the source and destination pages which demonstrates the hyperlink structure between web pages. Our web search engine searches not only for the keywords in the web pages, but also for the hyperlink structure between them. Comparing the results of structural web search versus keyword-based search indicates an improved ability to access desired information. We also discuss steps toward mining the queries input to the structural web search engine.

An Intelligent Web Search Using Multi-Document Summarization

2016 ◽  
Vol 6 (2) ◽  
pp. 41-65 ◽  
Author(s):  
Sheetal A. Takale ◽  
Prakash J. Kulkarni ◽  
Sahil K. Shah
Keyword(s):  
Search Engine ◽  
Web Search ◽  
Document Clustering ◽  
The Internet ◽  
Web Pages ◽  
Extractive Summarization ◽  
Text Understanding ◽  
User Query ◽  
Sentence Clustering

Information available on the internet is huge, diverse and dynamic. Current Search Engine is doing the task of intelligent help to the users of the internet. For a query, it provides a listing of best matching or relevant web pages. However, information for the query is often spread across multiple pages which are returned by the search engine. This degrades the quality of search results. So, the search engines are drowning in information, but starving for knowledge. Here, we present a query focused extractive summarization of search engine results. We propose a two level summarization process: identification of relevant theme clusters, and selection of top ranking sentences to form summarized result for user query. A new approach to semantic similarity computation using semantic roles and semantic meaning is proposed. Document clustering is effectively achieved by application of MDL principle and sentence clustering and ranking is done by using SNMF. Experiments conducted demonstrate the effectiveness of system in semantic text understanding, document clustering and summarization.

Users’ Click and Bookmark Based Personalization Using Modified Agglomerative Clustering for Web Search Engine

2017 ◽  
Vol 26 (06) ◽  
pp. 1730002 ◽  
Author(s):  
T. Dhiliphan Rajkumar ◽  
S. P. Raja ◽  
A. Suruliandi
Keyword(s):  
Information Retrieval ◽  
Search Engine ◽  
Search Engines ◽  
Web Search ◽  
Irrelevant Information ◽  
Experimental Results ◽  
Agglomerative Clustering ◽  
Semantic Level ◽  
Web Search Engine ◽  
The Web

Short and ambiguous queries are the major problems in search engines which lead to irrelevant information retrieval for the users’ input. The increasing nature of the information on the web also makes various difficulties for the search engine to provide the users needed results. The web search engine experience the ill effects of ambiguity, since the queries are looked at on a rational level rather than the semantic level. In this paper, for improving the performance of search engine as of the users’ interest, personalization is based on the users’ clicks and bookmarking is proposed. Modified agglomerative clustering is used in this work for clustering the results. The experimental results prove that the proposed work scores better precision, recall and F-score.

scholarly journals Extended model for Privacy Enhanced Personalized Web Search Ranking System

2019 ◽  
Vol 8 (10) ◽  
pp. 3271-3275
Keyword(s):  
Search Engine ◽  
User Satisfaction ◽  
Web Search ◽  
Web Pages ◽  
Extended Model ◽  
Privacy Concern ◽  
Web Environment ◽  
Web Search Engine ◽  
Proposed Model ◽  
User Friendly

Our existing society is totally dependent on web search to fulfill our daily requirements. Therefore millions of web pages are accessed every day. To fulfill user need number of websites and webpages are added .The growing size of web data results to the difficulty in attaining useful information with a minimum clicks. This results to the acquisition of personalization a major place in Web search. But the use of personalization breaches privacy in searching. Personalization with privacy is leading issue in current web environment. This paper aims at user satisfaction by using user identification based personalization approach in web search engine. Beside personalization the proposed model creates privacy during personalization. The proposed system will prove to be user friendly with less efforts and privacy concern.

Research and Improvement on Content-Based Web Search Engine

2012 ◽  
Vol 532-533 ◽  
pp. 1282-1286
Author(s):  
Zhi Chao Lin ◽  
Lei Sun ◽  
Xiao Liu
Keyword(s):  
Information Retrieval ◽  
Search Engine ◽  
Full Text ◽  
Search Engines ◽  
Query Expansion ◽  
Web Search ◽  
Text Search ◽  
Web Search Engine ◽  
Query Word ◽  
The Web

There is a lot of information contained in the World Wide Web. It has become a research focus to obtain the required related resources quickly and accurately from the web through the content-based search engines. Most current tools of full text web search engine, such as Lucene which is a widely used open source retrieval library in information retrieval field, are purely keyword based. This may not sufficient for users to retrieve in the web. In this paper, we employ a method to overcome the limitations of current full text search engines in represent of Lucene. We propose a Query Expansion and Information Retrieval approach which can help users to acquire more accurate contents from the web. The Query Expansion component finds expanded candidate words of the query word through WordNet which contains synonyms in several different senses; In the Information Retrieval component, the query word and its candidate words are used together as the input of the search module to get the result items. Furthermore, we can put the result items into different classes based on the expansion. Some experiments and the results are described in the late part of this paper.

Working at the web search engine side to generate privacy-preserving user profiles

2016 ◽  
Vol 64 ◽  
pp. 523-535 ◽  
Author(s):  
David Pàmies-Estrems ◽  
Jordi Castellà-Roca ◽  
Alexandre Viejo
Keyword(s):  
Search Engine ◽  
Web Search ◽  
Privacy Preserving ◽  
User Profiles ◽  
Web Search Engine ◽  
The Web
Sign in / Sign up

Export Citation Format

Share Document