Yi Chang - Böcker

In plain, uncomplicated language, and using detailed examples to explain the key concepts, models, and algorithms in vertical search ranking, Relevance Ranking for Vertical Search Engines teaches readers how to manipulate ranking algorithms to achieve better results in real-world applications.

This reference book for professionals covers concepts and theories from the fundamental to the advanced, such as relevance, query intention, location-based relevance ranking, and cross-property ranking. It covers the most recent developments in vertical search ranking applications, such as freshness-based relevance theory for new search applications, location-based relevance theory for local search applications, and cross-property ranking theory for applications involving multiple verticals.

Foreword by Ron Brachman, Chief Scientist and Head, Yahoo! Labs Introduces ranking algorithms and teaches readers how to manipulate ranking algorithms for the best results Covers concepts and theories from the fundamental to the advanced Discusses the state of the art: development of theories and practices in vertical search ranking applications Includes detailed examples, case studies and real-world situations

This book presents a systematic study of practices and theories for query understanding of search engines. These studies can be categorized into three major classes. The first class is to figure out what the searcher wants by extracting semantic meaning from the searcher’s keywords, such as query classification, query tagging, and query intent understanding. The second class is to analyze search queries and then translate them into an enhanced query that can produce better search results, such as query spelling correction or query rewriting. The third class is to assist users in refining or suggesting queries in order to reduce users’ search effort and satisfy their information needs, such as query auto-completion and query suggestion.Query understanding is a fundamental part of search engines. It is responsible to precisely infer the intent of the query formulated by the search user, to correct spelling errors in his/her query, to reformulate the query to capture its intent more accurately, and to guide the user in formulating a query with precise intent.The book will be invaluable to researchers and graduate students in computer or information science and specializing in information retrieval or web-based systems, as well as to researchers and programmers working on the development or improvement of products related to search engines.

This book presents a systematic study of practices and theories for query understanding of search engines. These studies can be categorized into three major classes. The first class is to figure out what the searcher wants by extracting semantic meaning from the searcher’s keywords, such as query classification, query tagging, and query intent understanding. The second class is to analyze search queries and then translate them into an enhanced query that can produce better search results, such as query spelling correction or query rewriting. The third class is to assist users in refining or suggesting queries in order to reduce users’ search effort and satisfy their information needs, such as query auto-completion and query suggestion.Query understanding is a fundamental part of search engines. It is responsible to precisely infer the intent of the query formulated by the search user, to correct spelling errors in his/her query, to reformulate the query to capture its intent more accurately, and to guide the user in formulating a query with precise intent.The book will be invaluable to researchers and graduate students in computer or information science and specializing in information retrieval or web-based systems, as well as to researchers and programmers working on the development or improvement of products related to search engines.

This book constitutes the refereed proceedings of the 28th China Conference on Information Retrieval, CCIR 2022, held in Chongqing, China, in September 2022.