scholarly journals Conversion of Website Users to Customers-The Black Hat SEO Technique

2018 ◽  
Vol 8 (6) ◽  
pp. 29 ◽  
Author(s):  
Rotimi-Williams Bello ◽  
Firstman Noah Otobo
Keyword(s):  
Search Engines ◽  
Return On Investment ◽  
Web Search ◽  
Brand Awareness ◽  
The Internet ◽  
Search Query ◽  
Web Based ◽  
Search Results ◽  
Rank One ◽  
The Right

Search Engine Optimization (SEO) is a technique which helps search engines to find and rank one site over another in response to a search query. SEO thus helps site owners to get traffic from search engines. Although the basic principle of operation of all search engines is the same, the minor differences between them lead to major changes in results relevancy. Choosing the right keywords to optimize for is thus the first and most crucial step to a successful SEO campaign. In the context of SEO, keyword density can be used as a factor in determining whether a webpage is relevant to a specified keyword or keyword phrase. SEO is known for its contribution as a process that affects the online visibility of a website or a webpage in a web search engine's results. In general, the earlier (or higher ranked on the search results page), and more frequently a website appears in the search results list, the more visitors it will receive from the search engine's users; these visitors can then be converted into customers. It is the objective of this paper to re-present black hat SEO technique as an unprofessional but profitable method of converting website users to customers. Having studied and understood white hat SEO, black hat SEO, gray hat SEO, crawling, indexing, processing and retrieving methods used by search engines as a web software program or web based script to search for documents and files for keywords over the internet to return the list of results containing those keywords; it would be seen that proper application of SEO gives website a better user experience, SEO helps build brand awareness through high rankings, SEO helps circumvent competition, and SEO gives room for high increased return on investment.

Searching web documents using a summarization approach

2016 ◽  
Vol 12 (1) ◽  
pp. 83-101 ◽  
Author(s):  
Rani Qumsiyeh ◽  
Yiu-Kai Ng
Keyword(s):  
Search Engines ◽  
Web Search ◽  
Specific Information ◽  
Information Need ◽  
Search Query ◽  
Content Type ◽  
Additional Information ◽  
Search Results ◽  
User Query ◽  
Web Search Engines

Purpose The purpose of this paper is to introduce a summarization method to enhance the current web-search approaches by offering a summary of each clustered set of web-search results with contents addressing the same topic, which should allow the user to quickly identify the information covered in the clustered search results. Web search engines, such as Google, Bing and Yahoo!, rank the set of documents S retrieved in response to a user query and represent each document D in S using a title and a snippet, which serves as an abstract of D. Snippets, however, are not as useful as they are designed for, i.e. assisting its users to quickly identify results of interest. These snippets are inadequate in providing distinct information and capture the main contents of the corresponding documents. Moreover, when the intended information need specified in a search query is ambiguous, it is very difficult, if not impossible, for a search engine to identify precisely the set of documents that satisfy the user’s intended request without requiring additional information. Furthermore, a document title is not always a good indicator of the content of the corresponding document either. Design/methodology/approach The authors propose to develop a query-based summarizer, called QSum, in solving the existing problems of Web search engines which use titles and abstracts in capturing the contents of retrieved documents. QSum generates a concise/comprehensive summary for each cluster of documents retrieved in response to a user query, which saves the user’s time and effort in searching for specific information of interest by skipping the step to browse through the retrieved documents one by one. Findings Experimental results show that QSum is effective and efficient in creating a high-quality summary for each cluster to enhance Web search. Originality/value The proposed query-based summarizer, QSum, is unique based on its searching approach. QSum is also a significant contribution to the Web search community, as it handles the ambiguous problem of a search query by creating summaries in response to different interpretations of the search which offer a “road map” to assist users to quickly identify information of interest.

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 A Survey on Blockchain-Based Search Engines

2021 ◽  
Vol 11 (15) ◽  
pp. 7063
Author(s):  
Esmaeel Rezaee ◽  
Ali Mohammad Saghiri ◽  
Agostino Forestiero
Keyword(s):  
Search Engines ◽  
Research Field ◽  
The Internet ◽  
Context Aware ◽  
Search System ◽  
Search Results ◽  
Related Information ◽  
Research Article ◽  
Different Types ◽  
Search History

With the increasing growth of different types of data, search engines have become an essential tool on the Internet. Every day, billions of queries are run through few search engines with several privacy violations and monopoly problems. The blockchain, as a trending technology applied in various fields, including banking, IoT, education, etc., can be a beneficial alternative. Blockchain-based search engines, unlike monopolistic ones, do not have centralized controls. With a blockchain-based search system, no company can lay claims to user’s data or access search history and other related information. All these data will be encrypted and stored on a blockchain. Valuing users’ searches and paying them in return is another advantage of a blockchain-based search engine. Additionally, in smart environments, as a trending research field, blockchain-based search engines can provide context-aware and privacy-preserved search results. According to our research, few efforts have been made to develop blockchain use, which include studies generally in the early stages and few white papers. To the best of our knowledge, no research article has been published in this regard thus far. In this paper, a survey on blockchain-based search engines is provided. Additionally, we state that the blockchain is an essential paradigm for the search ecosystem by describing the advantages.

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 Techniques for Improving Web Search by  Understanding Queries

2021 ◽  
Author(s):  
◽  
Daniel Wayne Crabtree
Keyword(s):  
Search Engines ◽  
Best Practice ◽  
Web Search ◽  
Special Focus ◽  
Clustering Methods ◽  
Web Page ◽  
Clustering Method ◽  
Evaluation Measures ◽  
Search Results ◽  
Web Page Clustering

<p>This thesis investigates the refinement of web search results with a special focus on the use of clustering and the role of queries. It presents a collection of new methods for evaluating clustering methods, performing clustering effectively, and for performing query refinement. The thesis identifies different types of query, the situations where refinement is necessary, and the factors affecting search difficulty. It then analyses hard searches and argues that many of them fail because users and search engines have different query models. The thesis identifies best practice for evaluating web search results and search refinement methods. It finds that none of the commonly used evaluation measures for clustering meet all of the properties of good evaluation measures. It then presents new quality and coverage measures that satisfy all the desired properties and that rank clusterings correctly in all web page clustering situations. The thesis argues that current web page clustering methods work well when different interpretations of the query have distinct vocabulary, but still have several limitations and often produce incomprehensible clusters. It then presents a new clustering method that uses the query to guide the construction of semantically meaningful clusters. The new clustering method significantly improves performance. Finally, the thesis explores how searches and queries are composed of different aspects and shows how to use aspects to reduce the distance between the query models of search engines and users. It then presents fully automatic methods that identify query aspects, identify underrepresented aspects, and predict query difficulty. Used in combination, these methods have many applications — the thesis describes methods for two of them. The first method improves the search results for hard queries with underrepresented aspects by automatically expanding the query using semantically orthogonal keywords related to the underrepresented aspects. The second method helps users refine hard ambiguous queries by identifying the different query interpretations using a clustering of a diverse set of refinements. Both methods significantly outperform existing methods.</p>

scholarly journals Techniques for Improving Web Search by  Understanding Queries

2021 ◽  
Author(s):  
◽  
Daniel Wayne Crabtree
Keyword(s):  
Search Engines ◽  
Best Practice ◽  
Web Search ◽  
Special Focus ◽  
Clustering Methods ◽  
Web Page ◽  
Clustering Method ◽  
Evaluation Measures ◽  
Search Results ◽  
Web Page Clustering

<p>This thesis investigates the refinement of web search results with a special focus on the use of clustering and the role of queries. It presents a collection of new methods for evaluating clustering methods, performing clustering effectively, and for performing query refinement. The thesis identifies different types of query, the situations where refinement is necessary, and the factors affecting search difficulty. It then analyses hard searches and argues that many of them fail because users and search engines have different query models. The thesis identifies best practice for evaluating web search results and search refinement methods. It finds that none of the commonly used evaluation measures for clustering meet all of the properties of good evaluation measures. It then presents new quality and coverage measures that satisfy all the desired properties and that rank clusterings correctly in all web page clustering situations. The thesis argues that current web page clustering methods work well when different interpretations of the query have distinct vocabulary, but still have several limitations and often produce incomprehensible clusters. It then presents a new clustering method that uses the query to guide the construction of semantically meaningful clusters. The new clustering method significantly improves performance. Finally, the thesis explores how searches and queries are composed of different aspects and shows how to use aspects to reduce the distance between the query models of search engines and users. It then presents fully automatic methods that identify query aspects, identify underrepresented aspects, and predict query difficulty. Used in combination, these methods have many applications — the thesis describes methods for two of them. The first method improves the search results for hard queries with underrepresented aspects by automatically expanding the query using semantically orthogonal keywords related to the underrepresented aspects. The second method helps users refine hard ambiguous queries by identifying the different query interpretations using a clustering of a diverse set of refinements. Both methods significantly outperform existing methods.</p>

A Roadmap to Integrate Document Clustering in Information Retrieval

2013 ◽  
pp. 31-45
Author(s):  
R. Subhashini ◽  
V.Jawahar Senthil Kumar
Keyword(s):  
Information Retrieval ◽  
Search Engines ◽  
World Wide ◽  
Clustering Algorithm ◽  
Web Search ◽  
Full Potential ◽  
Digital Information ◽  
Search Results ◽  
The World ◽  
The Web

The World Wide Web is a large distributed digital information space. The ability to search and retrieve information from the Web efficiently and effectively is an enabling technology for realizing its full potential. Information Retrieval (IR) plays an important role in search engines. Today’s most advanced engines use the keyword-based (“bag of words”) paradigm, which has inherent disadvantages. Organizing web search results into clusters facilitates the user’s quick browsing of search results. Traditional clustering techniques are inadequate because they do not generate clusters with highly readable names. This paper proposes an approach for web search results in clustering based on a phrase based clustering algorithm. It is an alternative to a single ordered result of search engines. This approach presents a list of clusters to the user. Experimental results verify the method’s feasibility and effectiveness.

A Guide to Assistive Technology for Teachers in Special Education

2012 ◽  
pp. 105-118 ◽  
Author(s):  
Harris Wang
Keyword(s):  
Special Education ◽  
Distance Learning ◽  
Assistive Technology ◽  
Learning Disability ◽  
Visually Impaired ◽  
Assistive Technologies ◽  
The Internet ◽  
Web Based ◽  
The Right ◽  
Hearing Difficulties

Everyone has the right to learn and to succeed in education. For people with certain disabilities, learning can be a challenging task, and proper use of certain assistive technologies can significantly ease the challenge, and help the learners to succeed. For teachers in special education, knowing existing assistive technology is an important step towards the proper use of those technologies and success in special education. This chapter provides a guide for teachers about assistive technology and its uses in special education. Assistive technology for people with learning difficulties, assistive technology for the visually impaired, and assistive technology for people with hearing difficulties will be discussed. Since online learning and the Internet are becoming trends in distance education, this chapter will focus on assistive technologies for Web-based distance learning, including assistive technologies for better human-computer interaction. Selecting more appropriate assistive technology for a given learner with a certain learning disability, among many choices, will be discussed.

WEBCONTENT VISUALIZER: A VISUALIZATION SYSTEM FOR SEARCH ENGINES IN SEMATIC WEB

2011 ◽  
Vol 10 (05) ◽  
pp. 913-931 ◽  
Author(s):  
XIANYONG FANG ◽  
CHRISTIAN JACQUEMIN ◽  
FRÉDÉRIC VERNIER
Keyword(s):  
Semantic Web ◽  
Search Engine ◽  
Search Engines ◽  
Web Search ◽  
Search Query ◽  
Visualization System ◽  
Xml Documents ◽  
Web Search Engines ◽  
New Generation

Since the results from Semantic Web search engines are highly structured XML documents, they cannot be efficiently visualized with traditional explorers. Therefore, the Semantic Web calls for a new generation of search query visualizers that can rely on document metadata. This paper introduces such a visualization system called WebContent Visualizer that is used to display and browse search engine results. The visualization is organized into three levels: (1) Carousels contain documents with the same ranking, (2) carousels are piled into stacks, one for each date, and (3) these stacks are organized along a meta-carousel to display the results for several dates. Carousel stacks are piles of local carousels with increasing radii to visualize the ranks of classes. For document comparison, colored links connect documents between neighboring classes on the basis of shared entities. Based on these techniques, the interface is made of three collaborative components: an inspector window, a visualization panel, and a detailed dialog component. With this architecture, the system is intended to offer an efficient way to explore the results returned by Semantic Web search engines.

Sign in / Sign up

Export Citation Format

Share Document