Reprint of: The anatomy of a large-scale hypertextual web search engine

2012 ◽  
Vol 56 (18) ◽  
pp. 3825-3833 ◽  
Author(s):  
Sergey Brin ◽  
Lawrence Page
Keyword(s):  
Search Engine ◽  
Large Scale ◽  
Web Search ◽  
Web Search Engine

scholarly journals Learning to Explain Entity Relationships by Pairwise Ranking with Convolutional Neural Networks

2017 ◽  
Author(s):  
Jizhou Huang ◽  
Wei Zhang ◽  
Shiqi Zhao ◽  
Shiqiang Ding ◽  
Haifeng Wang
Keyword(s):  
Search Engine ◽  
Large Scale ◽  
Web Search ◽  
Training Data ◽  
Data Annotation ◽  
Web Search Engine ◽  
Clickthrough Data ◽  
Ranking Model ◽  
Knowledge Graphs ◽  
Entity Relationships

Providing a plausible explanation for the relationship between two related entities is an important task in some applications of knowledge graphs, such as in search engines. However, most existing methods require a large number of manually labeled training data, which cannot be applied in large-scale knowledge graphs due to the expensive data annotation. In addition, these methods typically rely on costly handcrafted features. In this paper, we propose an effective pairwise ranking model by leveraging clickthrough data of a Web search engine to address these two problems. We first construct large-scale training data by leveraging the query-title pairs derived from clickthrough data of a Web search engine. Then, we build a pairwise ranking model which employs a convolutional neural network to automatically learn relevant features. The proposed model can be easily trained with backpropagation to perform the ranking task. The experiments show that our method significantly outperforms several strong baselines.

scholarly journals Improving Entity Recommendation with Search Log and Multi-Task Learning

2018 ◽  
Author(s):  
Jizhou Huang ◽  
Wei Zhang ◽  
Yaming Sun ◽  
Haifeng Wang ◽  
Ting Liu
Keyword(s):  
Search Engine ◽  
Large Scale ◽  
Web Search ◽  
Context Information ◽  
Context Aware ◽  
Time Step ◽  
Current Time ◽  
Task Learning ◽  
Web Search Engine ◽  
Search Logs

Entity recommendation, providing search users with an improved experience by assisting them in finding related entities for a given query, has become an indispensable feature of today's Web search engine. Existing studies typically only consider the query issued at the current time step while ignoring the in-session preceding queries. Thus, they typically fail to handle the ambiguous queries such as "apple" because the model could not understand which apple (company or fruit) is talked about. In this work, we believe that the in-session contexts convey valuable evidences that could facilitate the semantic modeling of queries, and take that into consideration for entity recommendation. Furthermore, in order to better model the semantics of queries, we learn the model in a multi-task learning setting where the query representation is shared across entity recommendation and context-aware ranking. We evaluate our approach using large-scale, real-world search logs of a widely used commercial Web search engine. The experimental results show that incorporating context information significantly improves entity recommendation, and learning the model in a multi-task learning setting could bring further improvements.

scholarly journals The Matter of Chance: Auditing Web Search Results Related to the 2020 U.S. Presidential Primary Elections Across Six Search Engines

2021 ◽  
pp. 089443932110068
Author(s):  
Aleksandra Urman ◽  
Mykola Makhortykh ◽  
Roberto Ulloa
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Large Scale ◽  
Web Search ◽  
Primary Elections ◽  
Virtual Agents ◽  
Search Results ◽  
Presidential Primary ◽  
Large Scale Analysis ◽  
Algorithmic Information

We examine how six search engines filter and rank information in relation to the queries on the U.S. 2020 presidential primary elections under the default—that is nonpersonalized—conditions. For that, we utilize an algorithmic auditing methodology that uses virtual agents to conduct large-scale analysis of algorithmic information curation in a controlled environment. Specifically, we look at the text search results for “us elections,” “donald trump,” “joe biden,” “bernie sanders” queries on Google, Baidu, Bing, DuckDuckGo, Yahoo, and Yandex, during the 2020 primaries. Our findings indicate substantial differences in the search results between search engines and multiple discrepancies within the results generated for different agents using the same search engine. It highlights that whether users see certain information is decided by chance due to the inherent randomization of search results. We also find that some search engines prioritize different categories of information sources with respect to specific candidates. These observations demonstrate that algorithmic curation of political information can create information inequalities between the search engine users even under nonpersonalized conditions. Such inequalities are particularly troubling considering that search results are highly trusted by the public and can shift the opinions of undecided voters as demonstrated by previous research.

Sign in / Sign up

Export Citation Format

Share Document