Beyond Relevance Ranking: A General Graph Matching Framework for Utility-Oriented Learning to Rank

2022 ◽  
Vol 40 (2) ◽  
pp. 1-29
Author(s):  
Xinyi Dai ◽  
Yunjia Xi ◽  
Weinan Zhang ◽  
Qing Liu ◽  
Ruiming Tang ◽  
...  

Learning to rank from logged user feedback, such as clicks or purchases, is a central component of many real-world information systems. Different from human-annotated relevance labels, the user feedback is always noisy and biased. Many existing learning to rank methods infer the underlying relevance of query–item pairs based on different assumptions of examination, and still optimize a relevance based objective. Such methods rely heavily on the correct estimation of examination, which is often difficult to achieve in practice. In this work, we propose a general framework U-rank+ for learning to rank with logged user feedback from the perspective of graph matching. We systematically analyze the biases in user feedback, including examination bias and selection bias. Then, we take both biases into consideration for unbiased utility estimation that directly based on user feedback, instead of relevance. In order to maximize the estimated utility in an efficient manner, we design two different solvers based on Sinkhorn and LambdaLoss for U-rank+ . The former is based on a standard graph matching algorithm, and the latter is inspired by the traditional method of learning to rank. Both of the algorithms have good theoretical properties to optimize the unbiased utility objective while the latter is proved to be empirically more effective and efficient in practice. Our framework U-rank+ can deal with a general utility function and can be used in a widespread of applications including web search, recommendation, and online advertising. Semi-synthetic experiments on three benchmark learning to rank datasets demonstrate the effectiveness of U-rank+ . Furthermore, our proposed framework has been deployed on two different scenarios of a mainstream App store, where the online A/B testing shows that U-rank+ achieves an average improvement of 19.2% on click-through rate and 20.8% improvement on conversion rate in recommendation scenario, and 5.12% on platform revenue in online advertising scenario over the production baselines.

2020 ◽  
Vol 8 (2) ◽  
pp. 91-102
Author(s):  
Dragos Gheorghiu ◽  
Livia Stefan

The current IT and digital technologies such as Mobile Augmented Reality (MAR) enable the overlap of digital and real world information in relation with a topic, in an engaging and efficient manner, and therefore can be used to store intangible heritage and to study it in the context as well. The current paper refers to such an augmentation of cultural information, performed at the Kallatis site, whose ruins, at present mostly covered by the modern town, do not offer sufficient information on the complexity of the Greek civilization. The implementation of a MAR application consisted in defining several points of interest of the important local archaeologic discoveries, which can trigger, for the visitors using our application, an augmentation of the historical site with images and videos. With the current research work, the authors propose and demonstrate that a mobile MAR application can constitute a modern method for providing visitors with an immersive and holistic experience for understanding the local material and intangible heritage.


Author(s):  
Rashid Ali ◽  
M. M. Sufyan Beg

Rank aggregation is the process of generating a single aggregated ranking for a given set of rankings. In industrial environment, there are many applications where rank aggregation must be applied. Rough set based rank aggregation is a user feedback based technique which mines ranking rules for rank aggregation using rough set theory. In this chapter, the authors discuss rough set based rank aggregation technique in light of Web search evaluation. Since there are many search engines available, which can be used by used by industrial houses to advertise their products, Web search evaluation is essential to decide which search engines to rely on. Here, the authors discuss the limitations of rough set based rank aggregation and present an improved version of the same, which is more suitable for aggregation of different techniques for Web search evaluation. In the improved version, the authors incorporate the confidence of the rules in predicting a class for a given set of data. They validate the mined ranking rules by comparing the predicted user feedback based ranking with the actual user feedback based ranking. They show their experimental results pertaining to the evaluation of seven public search engines using improved version of rough set based aggregation for a set of 37 queries.


2015 ◽  
Vol 166 ◽  
pp. 309-318 ◽  
Author(s):  
Changsung Kang ◽  
Dawei Yin ◽  
Ruiqiang Zhang ◽  
Nicolas Torzec ◽  
Jianzhang He ◽  
...  
Keyword(s):  

2015 ◽  
Vol 7 (1) ◽  
Author(s):  
Wei Zhang ◽  
Lijuan Ji ◽  
Yanan Chen ◽  
Kailin Tang ◽  
Haiping Wang ◽  
...  

2010 ◽  
Vol 39 ◽  
pp. 633-662 ◽  
Author(s):  
A. Krause ◽  
E. Horvitz

Online offerings such as web search, news portals, and e-commerce applications face the challenge of providing high-quality service to a large, heterogeneous user base. Recent efforts have highlighted the potential to improve performance by introducing methods to personalize services based on special knowledge about users and their context. For example, a user's demographics, location, and past search and browsing may be useful in enhancing the results offered in response to web search queries. However, reasonable concerns about privacy by both users, providers, and government agencies acting on behalf of citizens, may limit access by services to such information. We introduce and explore an economics of privacy in personalization, where people can opt to share personal information, in a standing or on-demand manner, in return for expected enhancements in the quality of an online service. We focus on the example of web search and formulate realistic objective functions for search efficacy and privacy. We demonstrate how we can find a provably near-optimal optimization of the utility-privacy tradeoff in an efficient manner. We evaluate our methodology on data drawn from a log of the search activity of volunteer participants. We separately assess users’ preferences about privacy and utility via a large-scale survey, aimed at eliciting preferences about peoples’ willingness to trade the sharing of personal data in returns for gains in search efficiency. We show that a significant level of personalization can be achieved using a relatively small amount of information about users.


Author(s):  
Weinan Zhang ◽  
Jiarui Qin ◽  
Wei Guo ◽  
Ruiming Tang ◽  
Xiuqiang He

Click-through rate (CTR) estimation plays as a core function module in various personalized online services, including online advertising, recommender systems, and web search etc. From 2015, the success of deep learning started to benefit CTR estimation performance and now deep CTR models have been widely applied in many industrial platforms. In this survey, we provide a comprehensive review of deep learning models for CTR estimation tasks. First, we take a review of the transfer from shallow to deep CTR models and explain why going deep is a necessary trend of development. Second, we concentrate on explicit feature interaction learning modules of deep CTR models. Then, as an important perspective on large platforms with abundant user histories, deep behavior models are discussed. Moreover, the recently emerged automated methods for deep CTR architecture design are presented. Finally, we summarize the survey and discuss the future prospects of this field.


Author(s):  
Clay Goudy ◽  
Alex Gutiérrez

Mexico’s Energy Reform has opened up various interesting and unique opportunities for energy infrastructure. A CO2 pipeline project that was recently completed in southern Mexico provides a perfect example of how to breathe new life to deteriorated pipeline infrastructure — infrastructure that would have typically been written off. By coupling a unique pipeline inspection method with a novel lining system, two 28-kilometer (17 mile) pipelines were rehabilitated in record time and in a cost-effective manner. The project consisted of two 12 and 18-inch (300 and 450 millimeters) CO2 transport pipelines that had been out of service for 22 years and that are a central component for a high-profile fertilizer project. Replacing these deteriorated assets with a new transport pipeline was not an option due to time, environmental, permitting and budgetary constraints. The rehabilitated system had to offer a minimum 25-year service life required by the owner. To put this aging infrastructure back into service, it was essential to assess the condition of the pipelines with a high level of accuracy and precision which would allow for the rehabilitation of the pipeline and installation of an interactive liner to extend the system’s serviceable life for a minimum of 25 years. The challenge, however, was that these pipelines were non-piggable by traditional methods. By using a tethered MFL and Caliper ILI solution, the pipelines were each inspected in 13 separate sections with the level of detail necessary to assess the condition and suitability of the rehabilitation strategy selected for the project. Fast-track scheduling constraints required 24-hour data analysis turnaround of reports identifying and discriminating areas of modest and significant corrosion as well as deformations including areas of significant weld slag which could complicate the installation of the liners. Once high-quality data was available, pinpoint repairs were possible with a combination of carbon fiber reinforcement and steel pipe replacement. Afterwards, the pipelines were internally lined with a patented process that effectively provides a double containment system. A grooved liner and the host steel pipe create an annular space that is pressurized with air and remotely monitored. The system is able to detect even a small pressure drop in the annulus that would occur in case the integrity is breached, or a pinhole develops in the steel pipe. With the grooved liner, external repairs can be conducted while the line continues to operate without interrupting CO2 service to the plant. By applying these novel solutions, the rehabilitated pipelines will transport carbon dioxide to a revitalized fertilizer plant in a safe and efficient manner for the next 25 years.


Author(s):  
Weider D. Yu ◽  
Seshadri K. Yilayavilli

In the current technology driven world, information retrieval activities are in almost every aspect of daily, as society uses popular web search engines like Google, Yahoo!, Live Search, Ask, and so forth to obtain helpful information. Often, these popular search engines look for and obtain key information; however, not all of the retrieved items are relevant in context to the search target a. Thus, it is left for the user to filter out unwanted information, using only a few information items left from the search results. These popular web search engines use a first generation search service based on “static keywords”, which require the users to know exactly what they want to search and enter the right keywords. This approach puts the user at a disadvantage. In this paper, the authors investigate and design a dynamic, question-answer search engine that enables searching by attributes for more precise and relevant information in Electronic Medical Record (EMR) field.


Author(s):  
Yasufumi Takama ◽  
Takuya Tezuka ◽  
Hiroki Shibata ◽  
Lieu-Hen Chen ◽  
◽  
...  

This paper estimates users’ search intents when using the context search engine (CSE) by analyzing submitted queries. Recently, due to the increase in the amount of information on the Web and the diversification of information needs, the gap between user’s information needs and a basic search function provided by existing web search engines becomes larger. As a solution to this problem, the CSE that limits its tasks to answer questions about temporal trends has been proposed. It provides three primitive search functions, which users can use in accordance with their purposes. Furthermore, if the system can estimate users’ search intents, it can provide more user-friendly services that contribute the improvement of search efficiency. Aiming at estimating users’ search intents only from submitted queries, this paper analyzes the characteristics of queries in terms of typical search intents when using CSE, and defines classification rules. To show the potential use of the estimated search intents, this paper introduces a learning to rank into CSE. Experimental results show that MAP (mean average precision) is improved by learning rank models separately for different search intents.


Sign in / Sign up

Export Citation Format

Share Document