Online Sponsored Search Budget Allocation across Search Engines: A Simulation Analysis

2014 ◽  
Vol 577 ◽  
pp. 926-930
Author(s):  
Bao Jian Zhou ◽  
Wei Qi ◽  
Li Gang Chen ◽  
Qiang Ye
Keyword(s):  
Decision Making ◽  
Search Engine ◽  
Search Engines ◽  
Simulation Analysis ◽  
Budget Allocation ◽  
Quality Score ◽  
Sponsored Search ◽  
Simulation Framework ◽  
Viable Option ◽  
Problem Model

Recently, sponsored search has been rapidly growing which increase tremendous interests in improving performance in search engine marketplace. The complexity of market dynamics makes it difficult for advertisers to maximizing the effect of advertising. Simulation analysis is a more viable option than real world testing especially in fast accomplishing different experiments and effectively prompting decision making supports. In this paper, the sponsored search budget allocation problem model integrated with quality score for single search engine has been explored and then extended to multiple quality-based search engines. Also, several advertising policies have been proposed and verified under the general simulation framework in both single and multiple search engine scenarios.

Critical Analysis of Major Search Engines

2019 ◽  
Vol 16 (9) ◽  
pp. 3712-3716
Author(s):  
Kailash Kumar ◽  
Abdulaziz Al-Besher
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Critical Analysis ◽  
Research Paper ◽  
Web Pages ◽  
Ranking Algorithm ◽  
Sponsored Search ◽  
Web Page ◽  
Rigorous Analysis ◽  
The Common

This paper examines the overlapping of the results retrieved between three major search engines namely Google, Yahoo and Bing. A rigorous analysis of overlap among these search engines was conducted on 100 random queries. The overlap of first ten web page results, i.e., hundred results from each search engine and only non-sponsored results from these above major search engines were taken into consideration. Search engines have their own frequency of updates and ranking of results based on their relevance. Moreover, sponsored search advertisers are different for different search engines. Single search engine cannot index all Web pages. In this research paper, the overlapping analysis of the results were carried out between October 1, 2018 to October 31, 2018 among these major search engines namely, Google, Yahoo and Bing. A framework is built in Java to analyze the overlap among these search engines. This framework eliminates the common results and merges them in a unified list. It also uses the ranking algorithm to re-rank the search engine results and displays it back to the user.

Retrieval of Personal Public Data on Social Networks

2013 ◽  
pp. 137-160
Author(s):  
Francesca Carmagnola ◽  
Francesco Osborne ◽  
Ilaria Torre
Keyword(s):  
Social Networks ◽  
Search Engine ◽  
Search Engines ◽  
Simulation Analysis ◽  
Software Agents ◽  
User Perception ◽  
Public Data ◽  
User Data ◽  
People Search ◽  
Different Sources

In this chapter, the authors analyze the risks for privacy coming from the distribution of user data over several social networks. Specifically, they focus on risks concerning the possibility to aggregate user data discovered on different sources into a single more complete profile, which makes possible to infer other data, likely set as private by the user. In order to show how it is possible to human users as well as to software agents crawling social networks, identifying users, linking their profiles and aggregating their data, the authors describe the prototype of a search engine they developed. The authors also present a simulation analysis to show the retrievability of user data by using a combination of people search engines and they provide statistics on the user perception on this issue.

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.

scholarly journals Examining and Fine-tuning the Selection of Glycan Compositions with GlyConnect Compozitor

2020 ◽  
Vol 19 (10) ◽  
pp. 1602-1618 ◽  
Author(s):  
Thibault Robin ◽  
Julien Mariethoz ◽  
Frédérique Lisacek
Keyword(s):  
Search Engine ◽  
Posttranslational Modifications ◽  
Search Engines ◽  
Web Application ◽  
Contextual Information ◽  
Fine Tuning ◽  
Data Sources ◽  
Web Interface ◽  
Definition Of ◽  
Selection Of

A key point in achieving accurate intact glycopeptide identification is the definition of the glycan composition file that is used to match experimental with theoretical masses by a glycoproteomics search engine. At present, these files are mainly built from searching the literature and/or querying data sources focused on posttranslational modifications. Most glycoproteomics search engines include a default composition file that is readily used when processing MS data. We introduce here a glycan composition visualizing and comparative tool associated with the GlyConnect database and called GlyConnect Compozitor. It offers a web interface through which the database can be queried to bring out contextual information relative to a set of glycan compositions. The tool takes advantage of compositions being related to one another through shared monosaccharide counts and outputs interactive graphs summarizing information searched in the database. These results provide a guide for selecting or deselecting compositions in a file in order to reflect the context of a study as closely as possible. They also confirm the consistency of a set of compositions based on the content of the GlyConnect database. As part of the tool collection of the Glycomics@ExPASy initiative, Compozitor is hosted at https://glyconnect.expasy.org/compozitor/ where it can be run as a web application. It is also directly accessible from the GlyConnect database.

Search Engine Update

2001 ◽  
Vol 1 (3) ◽  
pp. 28-31 ◽  
Author(s):  
Valerie Stevenson
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Search Strategy ◽  
Search Strategies ◽  
Boolean Logic ◽  
Web Searches ◽  
Search Techniques ◽  
Looking Back ◽  
The Web

Looking back to 1999, there were a number of search engines which performed equally well. I recommended defining the search strategy very carefully, using Boolean logic and field search techniques, and always running the search in more than one search engine. Numerous articles and Web columns comparing the performance of different search engines came to different conclusions on the ‘best’ search engines. Over the last year, however, all the speakers at conferences and seminars I have attended have recommended Google as their preferred tool for locating all kinds of information on the Web. I confess that I have now abandoned most of my carefully worked out search strategies and comparison tests, and use Google for most of my own Web searches.

Automatic Keyword Extraction Algorithm and Implementation

2010 ◽  
Vol 44-47 ◽  
pp. 4041-4049 ◽  
Author(s):  
Hong Zhao ◽  
Chen Sheng Bai ◽  
Song Zhu
Keyword(s):  
Search Engine ◽  
Word Frequency ◽  
Search Engines ◽  
Keyword Extraction ◽  
Web Page ◽  
C Language ◽  
Search Engine Optimization ◽  
Page Ranking ◽  
Extraction Algorithm ◽  
A Site

Search engines can bring a lot of benefit to the website. For a site, each page’s search engine ranking is very important. To make web page ranking in search engine ahead, Search engine optimization (SEO) make effect on the ranking. Web page needs to set the keywords as “keywords" to use SEO. The paper focuses on the content of a given word, and extracts the keywords of each page by calculating the word frequency. The algorithm is implemented by C # language. Keywords setting of webpage are of great importance on the information and products

Website removal from search engines due to copyright violation

2019 ◽  
Vol 71 (1) ◽  
pp. 54-71 ◽  
Author(s):  
Artur Strzelecki
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Design Methodology ◽  
Global Analysis ◽  
Domain Name ◽  
Content Type ◽  
Search Results ◽  
Internet Users ◽  
Copyright Violation

Purpose The purpose of this paper is to clarify how many removal requests are made, how often, and who makes these requests, as well as which websites are reported to search engines so they can be removed from the search results. Design/methodology/approach Undertakes a deep analysis of more than 3.2bn removed pages from Google’s search results requested by reporting organizations from 2011 to 2018 and over 460m removed pages from Bing’s search results requested by reporting organizations from 2015 to 2017. The paper focuses on pages that belong to the .pl country coded top-level domain (ccTLD). Findings Although the number of requests to remove data from search results has been growing year on year, fewer URLs have been reported in recent years. Some of the requests are, however, unjustified and are rejected by teams representing the search engines. In terms of reporting copyright violations, one company in particular stands out (AudioLock.Net), accounting for 28.1 percent of all reports sent to Google (the top ten companies combined were responsible for 61.3 percent of the total number of reports). Research limitations/implications As not every request can be published, the study is based only what is publicly available. Also, the data assigned to Poland is only based on the ccTLD domain name (.pl); other domain extensions for Polish internet users were not considered. Originality/value This is first global analysis of data from transparency reports published by search engine companies as prior research has been based on specific notices.

scholarly journals IMPLEMENTASI ALGORITMA GOOGLE LATENT SEMANTIC DISTANCE UNTUK EKSTRAKSI RANGKAIAN KATA KUNCI ARTIKEL JURNAL ILMIAH

2018 ◽  
Vol 2 (2) ◽  
pp. 186
Author(s):  
Novario Jaya Perdana
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Semantic Distance ◽  
Relevant Information ◽  
High Accuracy ◽  
Hard Work ◽  
The Internet ◽  
Search Results ◽  
Search Result

The accuracy of search result using search engine depends on the keywords that are used. Lack of the information provided on the keywords can lead to reduced accuracy of the search result. This means searching information on the internet is a hard work. In this research, a software has been built to create document keywords sequences. The software uses Google Latent Semantic Distance which can extract relevant information from the document. The information is expressed in the form of specific words sequences which could be used as keyword recommendations in search engines. The result shows that the implementation of the method for creating document keyword recommendation achieved high accuracy and could finds the most relevant information in the top search results.

scholarly journals Constructing a Sustainable and Dynamic Promotion Model for Fresh Foods Based on a Digital Transformation Framework

2021 ◽  
Vol 13 (19) ◽  
pp. 10687
Author(s):  
Tsung-Yin Ou ◽  
Guan-Yu Lin ◽  
Chin-Ying Liu ◽  
Wen-Lung Tsai
Keyword(s):  
Decision Making ◽  
Business Models ◽  
Simulation Analysis ◽  
Real Data ◽  
Digital Transformation ◽  
Retail Industry ◽  
Management Decision ◽  
Sustainable Business ◽  
Use Of Resources ◽  
Convenience Stores

The emergence of digital technology has compelled the retail industry to develop innovative and sustainable business models to predict and respond to consumer behavior. However, most enterprises are crippled with doubt, lacking frameworks and methods for moving forward. This study establishes a five-step decision-making framework for digital transformation in the retail industry and verifies it using real data from convenience stores in Taiwan. Data from residential type and cultural and educational type convenience stores, which together account for 75% of all stores, underwent a one-year simulation analysis according to the following three decision models for promotions: the shelf-life extended scrap model (SES), the fixed remaining duration model (FRD), and the dynamic promotion decision model (DPD). The results indicated that the DPD model reduced scrap in residential type stores by 12.88% and increased profit by 15.43%. In cultural and educational stores, the DPD model reduced scrap by 10.78% and increased profit by 7.63%. The implementation of the DPD model in convenience stores can bring additional revenue to operators, and at the same time address the problem of food waste. With the full use of resources, sustainable operation can be turned into a concrete and feasible management decision-making plan.

Sign in / Sign up

Export Citation Format

Share Document