首页 > 最新文献

Foundations and Trends in Information Retrieval最新文献

英文 中文
Fairness in Information Access Systems 信息获取系统的公平性
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2021-05-12 DOI: 10.1561/1500000079
Michael D. Ekstrand, Anubrata Das, R. Burke, Fernando Diaz
Recommendation, information retrieval, and other information access systems pose unique challenges for investigating and applying the fairness and non-discrimination concepts that have been developed for studying other machine learning systems. While fair information access shares many commonalities with fair classification, the multistakeholder nature of information access applications, the rank-based problem setting, the centrality of personalization in many cases, and the role of user response complicate the problem of identifying precisely what types and operationalizations of fairness may be relevant, let alone measuring or promoting them. In this monograph, we present a taxonomy of the various dimensions of fair information access and survey the literature to date on this new and rapidly-growing topic. We preface this with brief introductions to information access and algorithmic fairness, to facilitate use of this work by scholars with experience in one (or neither) of these fields who wish to learn about their intersection. We conclude with several open problems in fair information access, along with some suggestions for how to approach research in this space.
推荐、信息检索和其他信息访问系统对调查和应用公平和非歧视概念提出了独特的挑战,这些概念已经为研究其他机器学习系统而开发。虽然公平的信息访问与公平分类有许多共同点,但信息访问应用的多利益相关者性质、基于排名的问题设置、在许多情况下个性化的中心地位以及用户响应的作用使准确识别公平的类型和操作可能相关的问题复杂化,更不用说衡量或促进它们了。在这本专著中,我们提出了公平信息获取的各个维度的分类,并调查了迄今为止关于这个新的和快速增长的主题的文献。在此之前,我们简要介绍了信息获取和算法公平,以方便在这些领域中有一个(或两个)经验的学者使用这项工作,他们希望了解他们的交集。最后,我们提出了公平信息获取中存在的几个问题,并就如何开展这方面的研究提出了一些建议。
{"title":"Fairness in Information Access Systems","authors":"Michael D. Ekstrand, Anubrata Das, R. Burke, Fernando Diaz","doi":"10.1561/1500000079","DOIUrl":"https://doi.org/10.1561/1500000079","url":null,"abstract":"Recommendation, information retrieval, and other information access systems pose unique challenges for investigating and applying the fairness and non-discrimination concepts that have been developed for studying other machine learning systems. While fair information access shares many commonalities with fair classification, the multistakeholder nature of information access applications, the rank-based problem setting, the centrality of personalization in many cases, and the role of user response complicate the problem of identifying precisely what types and operationalizations of fairness may be relevant, let alone measuring or promoting them. In this monograph, we present a taxonomy of the various dimensions of fair information access and survey the literature to date on this new and rapidly-growing topic. We preface this with brief introductions to information access and algorithmic fairness, to facilitate use of this work by scholars with experience in one (or neither) of these fields who wish to learn about their intersection. We conclude with several open problems in fair information access, along with some suggestions for how to approach research in this space.","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"1 1","pages":"1-177"},"PeriodicalIF":10.4,"publicationDate":"2021-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89800926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
Search Interface Design and Evaluation 搜索界面设计与评价
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2021-01-01 DOI: 10.1561/1500000073
Chang Liu, Ying-Hsang Liu, Jingjing Liu, R. Bierig
{"title":"Search Interface Design and Evaluation","authors":"Chang Liu, Ying-Hsang Liu, Jingjing Liu, R. Bierig","doi":"10.1561/1500000073","DOIUrl":"https://doi.org/10.1561/1500000073","url":null,"abstract":"","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"77 1","pages":"243-416"},"PeriodicalIF":10.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87093182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Extracting, Mining and Predicting Users' Interests from Social Media 从社交媒体中提取、挖掘和预测用户兴趣
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2020-11-04 DOI: 10.1561/1500000078
F. Zarrinkalam, Stefano Faralli, Guangyuan Piao, E. Bagheri
The abundance of user generated content on social media provides the opportunity to build models that are able to accurately and effectively extract, mine and predict users’ interests with the hopes of enabling more effective user engagement, better quality delivery of appropriate services and higher user satisfaction. While traditional methods for building user profiles relied on AI-based preference elicitation techniques that could have been considered to be intrusive and undesirable by the users, more recent advances are focused on a non-intrusive yet accurate way of determining users’ interests and preferences. In this monograph, we will cover five important subjects related to the mining of user interests from social media: (1) the foundations of social user interest modeling, such as information sources, various types of representation models and temporal features, (2) techniques that have been adopted or proposed for Fattane Zarrinkalam, Stefano Faralli, Guangyuan Piao and Ebrahim Bagheri (2020), “Extracting, Mining and Predicting Users’ Interests from Social Media”, Foundations and Trends © in Information Retrieval: Vol. 14, No. 5, pp 445–617. DOI: 10.1561/1500000078. Full text available at: http://dx.doi.org/10.1561/1500000078
社交媒体上丰富的用户生成内容为建立能够准确有效地提取、挖掘和预测用户兴趣的模型提供了机会,以期实现更有效的用户参与,更好地提供适当的服务质量和更高的用户满意度。虽然建立用户档案的传统方法依赖于基于人工智能的偏好提取技术,这可能被用户认为是侵入性的和不受欢迎的,但最近的进展集中在一种非侵入性但准确的方式来确定用户的兴趣和偏好。在这本专著中,我们将涵盖与从社交媒体中挖掘用户兴趣相关的五个重要主题:(1)社会用户兴趣建模的基础,如信息源、各种类型的表示模型和时间特征;(2)Fattane Zarrinkalam、Stefano Faralli、Guangyuan Piao和Ebrahim Bagheri(2020)采用或提出的技术,“从社交媒体中提取、挖掘和预测用户兴趣”,《信息检索的基础与趋势©》,第14卷,第5期,445-617页。DOI: 10.1561 / 1500000078。全文可在:http://dx.doi.org/10.1561/1500000078
{"title":"Extracting, Mining and Predicting Users' Interests from Social Media","authors":"F. Zarrinkalam, Stefano Faralli, Guangyuan Piao, E. Bagheri","doi":"10.1561/1500000078","DOIUrl":"https://doi.org/10.1561/1500000078","url":null,"abstract":"The abundance of user generated content on social media provides the opportunity to build models that are able to accurately and effectively extract, mine and predict users’ interests with the hopes of enabling more effective user engagement, better quality delivery of appropriate services and higher user satisfaction. While traditional methods for building user profiles relied on AI-based preference elicitation techniques that could have been considered to be intrusive and undesirable by the users, more recent advances are focused on a non-intrusive yet accurate way of determining users’ interests and preferences. In this monograph, we will cover five important subjects related to the mining of user interests from social media: (1) the foundations of social user interest modeling, such as information sources, various types of representation models and temporal features, (2) techniques that have been adopted or proposed for Fattane Zarrinkalam, Stefano Faralli, Guangyuan Piao and Ebrahim Bagheri (2020), “Extracting, Mining and Predicting Users’ Interests from Social Media”, Foundations and Trends © in Information Retrieval: Vol. 14, No. 5, pp 445–617. DOI: 10.1561/1500000078. Full text available at: http://dx.doi.org/10.1561/1500000078","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"724 1","pages":"445-617"},"PeriodicalIF":10.4,"publicationDate":"2020-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78742778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Knowledge Graphs: An Information Retrieval Perspective 知识图谱:信息检索的视角
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2020-10-14 DOI: 10.1561/1500000063
Ridho Reinanda, E. Meij, M. de Rijke
In this survey, we provide an overview of the literature on knowledge graphs (KGs) in the context of information retrieval (IR). Modern IR systems can benefit from information available in KGs in multiple ways, independent of whether the KGs are publicly available or proprietary ones. We provide an overview of the components required when building IR systems that leverage KGs and use a task-oriented organization of the material that we discuss. As an understanding of the intersection of IR and KGs is beneficial to many researchers and practitioners, we consider prior work from two complementary angles: leveraging KGs for information retrieval and enriching KGs using IR techniques. We start by discussing how KGs can be employed to support IR tasks, including document and entity retrieval. We then proceed by describing how IR—and language technology in general—can be utilized for the construction and completion of KGs. This includes tasks such as entity recognition, typing, and relation extraction. We discuss common issues that appear across the tasks that we consider and identify future directions for addressing them. We also provide pointers to datasets and other resources that should be useful for both newcomers and experienced researchers in the area. Ridho Reinanda, Edgar Meij and Maarten de Rijke (2020), “Knowledge Graphs: An Information Retrieval Perspective”, Foundations and Trends® in Information Retrieval: Vol. 14, No. 4, pp 289–444. DOI: 10.1561/1500000063. Full text available at: http://dx.doi.org/10.1561/1500000063
在本调查中,我们概述了知识图在信息检索(IR)背景下的文献。现代红外系统可以以多种方式受益于kg中提供的信息,而不依赖于kg是公开可用的还是专有的。我们提供了构建利用kg的IR系统所需组件的概述,并使用我们讨论的材料的面向任务的组织。由于理解IR和KGs的交集对许多研究人员和从业者都是有益的,我们从两个互补的角度来考虑之前的工作:利用KGs进行信息检索和使用IR技术丰富KGs。我们首先讨论如何使用kg来支持IR任务,包括文档和实体检索。然后,我们继续描述ir和一般语言技术如何用于构建和完成kg,这包括实体识别、输入和关系提取等任务。我们讨论在我们考虑的任务中出现的常见问题,并确定解决这些问题的未来方向。我们还提供了指向数据集和其他资源的指针,这些资源对该领域的新手和经验丰富的研究人员都很有用。Ridho Reinanda, Edgar Meij和Maarten de Rijke(2020),“知识图谱:信息检索视角”,信息检索的基础和趋势®:第14卷,第4期,第289-444页。DOI: 10.1561 / 1500000063。全文可在:http://dx.doi.org/10.1561/1500000063
{"title":"Knowledge Graphs: An Information Retrieval Perspective","authors":"Ridho Reinanda, E. Meij, M. de Rijke","doi":"10.1561/1500000063","DOIUrl":"https://doi.org/10.1561/1500000063","url":null,"abstract":"In this survey, we provide an overview of the literature on knowledge graphs (KGs) in the context of information retrieval (IR). Modern IR systems can benefit from information available in KGs in multiple ways, independent of whether the KGs are publicly available or proprietary ones. We provide an overview of the components required when building IR systems that leverage KGs and use a task-oriented organization of the material that we discuss. As an understanding of the intersection of IR and KGs is beneficial to many researchers and practitioners, we consider prior work from two complementary angles: leveraging KGs for information retrieval and enriching KGs using IR techniques. We start by discussing how KGs can be employed to support IR tasks, including document and entity retrieval. We then proceed by describing how IR—and language technology in general—can be utilized for the construction and completion of KGs. This includes tasks such as entity recognition, typing, and relation extraction. We discuss common issues that appear across the tasks that we consider and identify future directions for addressing them. We also provide pointers to datasets and other resources that should be useful for both newcomers and experienced researchers in the area. Ridho Reinanda, Edgar Meij and Maarten de Rijke (2020), “Knowledge Graphs: An Information Retrieval Perspective”, Foundations and Trends® in Information Retrieval: Vol. 14, No. 4, pp 289–444. DOI: 10.1561/1500000063. Full text available at: http://dx.doi.org/10.1561/1500000063","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"3 1","pages":"289-444"},"PeriodicalIF":10.4,"publicationDate":"2020-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77053977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 49
Deep Learning for Matching in Search and Recommendation 深度学习在搜索和推荐中的匹配
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2020-07-13 DOI: 10.1561/1500000076
Jun Xu, Xiangnan He, Hang Li

Matching is a key problem in both search and recommendation, which is to measure the relevance of a document to a query or the interest of a user to an item. Machine learning has been exploited to address the problem, which learns a matching function based on input representations and from labeled data, also referred to as “learning to match”. In recent years, efforts have been made to develop deep learning techniques for matching tasks in search and recommendation. With the availability of a large amount of data, powerful computational resources, and advanced deep learning techniques, deep learning for matching now becomes the state-of-the-art technology for search and recommendation. The key to the success of the deep learning approach is its strong ability in learning of representations and generalization of matching patterns from data (e.g., queries, documents, users, items, and contexts, particularly in their raw forms).

This survey gives a systematic and comprehensive introduction to the deep matching models for search and recommendation developed recently. It first gives a unified view of matching in search and recommendation. In this way, the solutions from the two fields can be compared under one framework. Then, the survey categorizes the current deep learning solutions into two types: methods of representation learning and methods of matching function learning. The fundamental problems, as well as the state-of-the-art solutions of query-document matching in search and user-item matching in recommendation, are described. The survey aims to help researchers from both search and recommendation communities to get in-depth understanding and insight into the spaces, stimulate more ideas and discussions, and promote developments of new technologies.

Matching is not limited to search and recommendation. Similar problems can be found in paraphrasing, question answering, image annotation, and many other applications. In general, the technologies introduced in the survey can be generalized into a more general task of matching between objects from two spaces.

匹配是搜索和推荐中的一个关键问题,它是衡量文档与查询的相关性或用户对项目的兴趣。机器学习已经被用来解决这个问题,它根据输入表示和标记数据学习匹配函数,也被称为“学习匹配”。近年来,人们一直在努力开发用于搜索和推荐匹配任务的深度学习技术。随着大量数据的可用性,强大的计算资源和先进的深度学习技术,深度学习匹配现在成为最先进的搜索和推荐技术。深度学习方法成功的关键在于其从数据(例如,查询、文档、用户、项目和上下文,特别是其原始形式)中学习表示和概括匹配模式的强大能力。本文系统、全面地介绍了近年来发展起来的搜索和推荐深度匹配模型。它首先给出了搜索和推荐匹配的统一视图。这样,两个领域的解决方案可以在一个框架下进行比较。然后,调查将当前的深度学习解决方案分为两类:表示学习方法和匹配函数学习方法。描述了搜索中的查询文档匹配和推荐中的用户条目匹配的基本问题,以及最先进的解决方案。该调查旨在帮助搜索和推荐社区的研究人员深入了解和洞察该领域,激发更多的想法和讨论,促进新技术的发展。匹配并不局限于搜索和推荐。在释义、问答、图像注释和许多其他应用程序中也可以发现类似的问题。总的来说,调查中引入的技术可以概括为一个更一般的任务,即在两个空间的物体之间进行匹配。
{"title":"Deep Learning for Matching in Search and Recommendation","authors":"Jun Xu, Xiangnan He, Hang Li","doi":"10.1561/1500000076","DOIUrl":"https://doi.org/10.1561/1500000076","url":null,"abstract":"<p>Matching is a key problem in both search and recommendation, which is to measure the relevance of a document to a query or the interest of a user to an item. Machine learning has been exploited to address the problem, which learns a matching function based on input representations and from labeled data, also referred to as “learning to match”. In recent years, efforts have been made to develop deep learning techniques for matching tasks in search and recommendation. With the availability of a large amount of data, powerful computational resources, and advanced deep learning techniques, deep learning for matching now becomes the state-of-the-art technology for search and recommendation. The key to the success of the deep learning approach is its strong ability in learning of representations and generalization of matching patterns from data (e.g., queries, documents, users, items, and contexts, particularly in their raw forms).<p>This survey gives a systematic and comprehensive introduction to the deep matching models for search and recommendation developed recently. It first gives a unified view of matching in search and recommendation. In this way, the solutions from the two fields can be compared under one framework. Then, the survey categorizes the current deep learning solutions into two types: methods of representation learning and methods of matching function learning. The fundamental problems, as well as the state-of-the-art solutions of query-document matching in search and user-item matching in recommendation, are described. The survey aims to help researchers from both search and recommendation communities to get in-depth understanding and insight into the spaces, stimulate more ideas and discussions, and promote developments of new technologies.</p><p>Matching is not limited to search and recommendation. Similar problems can be found in paraphrasing, question answering, image annotation, and many other applications. In general, the technologies introduced in the survey can be generalized into a more general task of matching between objects from two spaces.</p></p>","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"12 1","pages":""},"PeriodicalIF":10.4,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138542972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Information Retrieval: The Early Years 信息检索:早年
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2019-07-08 DOI: 10.1561/1500000065
D. Harman
Information retrieval, the science behind search engines, had its birth in the late 1950s. Its forbearers came from library science, mathematics and linguistics, with later input from computer science. The early work dealt with finding better ways to index text, and then using new algorithms to search these (mostly) automatically built indexes. Like all computer applications, however, the theory and ideas were limited by lack of computer power, and additionally by lack of machine-readable text. But each decade saw progress, and by the 1990s, it had flowered. This monograph tells the story of the early history of information retrieval (up until 2000) in a manner that presents the technical context, the research and the early commercialization efforts. Donna Harman (2019), “Information Retrieval: The Early Years”, Foundations and Trends © in Information Retrieval: Vol. 13, No. 5, pp 425–577. DOI: 10.1561/1500000065. Full text available at: http://dx.doi.org/10.1561/1500000065
{"title":"Information Retrieval: The Early Years","authors":"D. Harman","doi":"10.1561/1500000065","DOIUrl":"https://doi.org/10.1561/1500000065","url":null,"abstract":"Information retrieval, the science behind search engines, had its birth in the late 1950s. Its forbearers came from library science, mathematics and linguistics, with later input from computer science. The early work dealt with finding better ways to index text, and then using new algorithms to search these (mostly) automatically built indexes. Like all computer applications, however, the theory and ideas were limited by lack of computer power, and additionally by lack of machine-readable text. But each decade saw progress, and by the 1990s, it had flowered. This monograph tells the story of the early history of information retrieval (up until 2000) in a manner that presents the technical context, the research and the early commercialization efforts. Donna Harman (2019), “Information Retrieval: The Early Years”, Foundations and Trends © in Information Retrieval: Vol. 13, No. 5, pp 425–577. DOI: 10.1561/1500000065. Full text available at: http://dx.doi.org/10.1561/1500000065","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"114 1","pages":"425-577"},"PeriodicalIF":10.4,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87980781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
Bandit Algorithms in Information Retrieval 信息检索中的强盗算法
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2019-05-22 DOI: 10.1561/1500000067
D. Glowacka
{"title":"Bandit Algorithms in Information Retrieval","authors":"D. Glowacka","doi":"10.1561/1500000067","DOIUrl":"https://doi.org/10.1561/1500000067","url":null,"abstract":"","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"95 1","pages":"299-424"},"PeriodicalIF":10.4,"publicationDate":"2019-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85376119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 68
Neural Approaches to Conversational AI 会话AI的神经方法
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2019-02-20 DOI: 10.1561/1500000074
Jianfeng Gao, Michel Galley, Lihong Li

The present paper surveys neural approaches to conversational AI that have been developed in the last few years. We group conversational systems into three categories: (1) question answering agents, (2) task-oriented dialogue agents, and (3) chatbots. For each category, we present a review of state-of-the-art neural approaches, draw the connection between them and traditional approaches, and discuss the progress that has been made and challenges still being faced, using specific systems and models as case studies.

本文概述了在过去几年中发展起来的会话人工智能的神经方法。我们将会话系统分为三类:(1)问答代理,(2)面向任务的对话代理,(3)聊天机器人。对于每个类别,我们都介绍了最新的神经方法,绘制了它们与传统方法之间的联系,并讨论了已经取得的进展和仍然面临的挑战,使用特定的系统和模型作为案例研究。
{"title":"Neural Approaches to Conversational AI","authors":"Jianfeng Gao, Michel Galley, Lihong Li","doi":"10.1561/1500000074","DOIUrl":"https://doi.org/10.1561/1500000074","url":null,"abstract":"<p>The present paper surveys neural approaches to conversational AI that have been developed in the last few years. We group conversational systems into three categories: (1) question answering agents, (2) task-oriented dialogue agents, and (3) chatbots. For each category, we present a review of state-of-the-art neural approaches, draw the connection between them and traditional approaches, and discuss the progress that has been made and challenges still being faced, using specific systems and models as case studies.\u0000</p>","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"54 1","pages":""},"PeriodicalIF":10.4,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138526301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Query Processing for Scalable Web Search 可扩展Web搜索的高效查询处理
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2018-12-23 DOI: 10.1561/1500000057
N. Tonellotto, C. Macdonald, I. Ounis
Search engines are exceptionally important tools for accessing information in today’s world. In satisfying the information needs of millions of users, the effectiveness (the quality of the search results) and the efficiency (the speed at which the results are returned to the users) of a search engine are two goals that form a natural trade-off, as techniques that improve the effectiveness of the search engine can also make it less efficient. Meanwhile, search engines continue to rapidly evolve, with larger indexes, more complex retrieval strategies and growing query volumes. Hence, there is a need for the development of efficient query processing infrastructures that make appropriate sacrifices in effectiveness in order to make gains in efficiency. This survey comprehensively reviews the foundations of search engines, from index layouts to basic term-at-a-time (TAAT) and document-at-a-time (DAAT) query processing strategies, while also providing the latest trends in the literature in efficient query processing, including the coherent and systematic reviews of techniques such as dynamic pruning and impact-sorted posting lists as well as their variants and optimisations. Our explanations of query processing strategies, for instance the WAND and BMW dynamic pruning algorithms, are presented with illustrative figures showing how the processing state changes as the algorithms progress. Moreover, acknowledging the recent trends in applying a cascading infrastructure within search systems, this survey describes techniques for efficiently integrating effective learned models, such as those obtained from learning-torank techniques. The survey also covers the selective application of query processing techniques, often achieved by predicting the response times of the search engine (known as query efficiency prediction), and making per-query tradeoffs between efficiency and effectiveness to ensure that the required retrieval speed targets can be met. Finally, the survey concludes with a summary of open directions in efficient search infrastructures, namely the use of signatures, real-time, energy-efficient and modern hardware & software architectures.
搜索引擎是当今世界获取信息的特别重要的工具。在满足数百万用户的信息需求时,搜索引擎的有效性(搜索结果的质量)和效率(将结果返回给用户的速度)是自然形成权衡的两个目标,因为提高搜索引擎有效性的技术也可能使其效率降低。与此同时,搜索引擎继续快速发展,索引更大,检索策略更复杂,查询量不断增长。因此,需要开发高效的查询处理基础设施,以适当牺牲有效性来获得效率方面的收益。本调查全面回顾了搜索引擎的基础,从索引布局到基本的一次术语(TAAT)和一次文档(DAAT)查询处理策略,同时也提供了有效查询处理方面的最新趋势,包括对动态修剪和影响排序发布列表等技术的连贯和系统的回顾,以及它们的变体和优化。我们对查询处理策略(例如WAND和BMW动态剪枝算法)的解释用插图说明了处理状态如何随着算法的进展而变化。此外,考虑到在搜索系统中应用级联基础设施的最新趋势,本调查描述了有效集成有效学习模型的技术,例如从学习-秩技术中获得的技术。该调查还涵盖了查询处理技术的选择性应用,通常通过预测搜索引擎的响应时间(称为查询效率预测)来实现,并在效率和有效性之间进行每个查询的权衡,以确保能够满足所需的检索速度目标。最后,调查总结了高效搜索基础设施的开放方向,即签名、实时、节能和现代硬件和软件架构的使用。
{"title":"Efficient Query Processing for Scalable Web Search","authors":"N. Tonellotto, C. Macdonald, I. Ounis","doi":"10.1561/1500000057","DOIUrl":"https://doi.org/10.1561/1500000057","url":null,"abstract":"Search engines are exceptionally important tools for accessing information in today’s world. In satisfying the information needs of millions of users, the effectiveness (the quality of the search results) and the efficiency (the speed at which the results are returned to the users) of a search engine are two goals that form a natural trade-off, as techniques that improve the effectiveness of the search engine can also make it less efficient. Meanwhile, search engines continue to rapidly evolve, with larger indexes, more complex retrieval strategies and growing query volumes. Hence, there is a need for the development of efficient query processing infrastructures that make appropriate sacrifices in effectiveness in order to make gains in efficiency. This survey comprehensively reviews the foundations of search engines, from index layouts to basic term-at-a-time (TAAT) and document-at-a-time (DAAT) query processing strategies, while also providing the latest trends in the literature in efficient query processing, including the coherent and systematic reviews of techniques such as dynamic pruning and impact-sorted posting lists as well as their variants and optimisations. Our explanations of query processing strategies, for instance the WAND and BMW dynamic pruning algorithms, are presented with illustrative figures showing how the processing state changes as the algorithms progress. Moreover, acknowledging the recent trends in applying a cascading infrastructure within search systems, this survey describes techniques for efficiently integrating effective learned models, such as those obtained from learning-torank techniques. The survey also covers the selective application of query processing techniques, often achieved by predicting the response times of the search engine (known as query efficiency prediction), and making per-query tradeoffs between efficiency and effectiveness to ensure that the required retrieval speed targets can be met. Finally, the survey concludes with a summary of open directions in efficient search infrastructures, namely the use of signatures, real-time, energy-efficient and modern hardware & software architectures.","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"40 1","pages":"319-500"},"PeriodicalIF":10.4,"publicationDate":"2018-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84551326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 40
An Introduction to Neural Information Retrieval 神经信息检索导论
IF 10.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2018-12-23 DOI: 10.1561/1500000061
Bhaskar Mitra, Nick Craswell
Neural models have been employed in many Information Retrieval scenarios, including ad-hoc retrieval, recommender systems, multi-media search, and even conversational systems that generate answers in response to natural language questions. An Introduction to Neural Information Retrieval provides a tutorial introduction to neural methods for ranking documents in response to a query, an important IR task. The monograph provides a complete picture of neural information retrieval techniques that culminate in supervised neural learning to rank models including deep neural network architectures that are trained end-to-end for ranking tasks. In reaching this point, the authors cover all the important topics, including the learning to rank framework and an overview of deep neural networks. This monograph provides an accessible, yet comprehensive, overview of the state-of-the-art of Neural Information Retrieval.
神经模型已经应用于许多信息检索场景,包括特别检索、推荐系统、多媒体搜索,甚至是对自然语言问题生成答案的会话系统。神经信息检索导论提供了一个教程,介绍了在响应查询时对文档进行排序的神经方法,这是一项重要的IR任务。该专著提供了神经信息检索技术的完整图片,最终在监督神经学习中对模型进行排名,包括对端到端进行排名任务训练的深度神经网络架构。在这一点上,作者涵盖了所有重要的主题,包括学习排名框架和深度神经网络的概述。这本专著提供了一个可访问的,但全面的,最先进的神经信息检索的概述。
{"title":"An Introduction to Neural Information Retrieval","authors":"Bhaskar Mitra, Nick Craswell","doi":"10.1561/1500000061","DOIUrl":"https://doi.org/10.1561/1500000061","url":null,"abstract":"Neural models have been employed in many Information Retrieval scenarios, including ad-hoc retrieval, recommender systems, multi-media search, and even conversational systems that generate answers in response to natural language questions. An Introduction to Neural Information Retrieval provides a tutorial introduction to neural methods for ranking documents in response to a query, an important IR task. The monograph provides a complete picture of neural information retrieval techniques that culminate in supervised neural learning to rank models including deep neural network architectures that are trained end-to-end for ranking tasks. In reaching this point, the authors cover all the important topics, including the learning to rank framework and an overview of deep neural networks. This monograph provides an accessible, yet comprehensive, overview of the state-of-the-art of Neural Information Retrieval.","PeriodicalId":48829,"journal":{"name":"Foundations and Trends in Information Retrieval","volume":"32 1","pages":"1-126"},"PeriodicalIF":10.4,"publicationDate":"2018-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86139477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 300
期刊
Foundations and Trends in Information Retrieval
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1