检索结果-内蒙古大学图书馆

Overview of the Tenth Dialog System Technology Challenge: DSTC10

IEEE/ACM Transactions on Audio Speech and Language Processing 2024年 32卷 765-778页

作者： Yoshino, Koichiro Chen, Yun-Nung Crook, Paul Kottur, Satwik Li, Jinchao Hedayatnia, Behnam Moon, Seungwhan Fei, Zhengcong Li, Zekang Zhang, Jinchao Feng, Yang Zhou, Jie Kim, Seokhwan Liu, Yang Jin, Di Papangelis, Alexandros Gopalakrishnan, Karthik Hakkani-Tur, Dilek Damavandi, Babak Geramifard, Alborz Hori, Chiori Shah, Ankit Zhang, Chen Li, Haizhou Sedoc, Joao D'haro, Luis F. Banchs, Rafael Rudnicky, Alexander Guardian Robot Project R-IH RIKEN 2-2-2 Hikaridai Seika Shoraku619-0288 Japan Information Science Nara Institute of Science and Technology Ikoma630-0101 Japan Computer Science and Information Engineering National Taiwan University Taipei10617 Taiwan Inc. Palo AltoCA95054 United States Alexa AI *** Inc. SunnyvaleCA94089 United States Meta Seattle RedmondWA98052 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Tencent AI Lab Beijing Beijing China Kexueyuan South Road Zhongguancun Beijing100190 China Beijing 100190 China Alexa AI *** Inc. SunnyvaleCA United States 1120 Enterprise way Sunnyvale94089 United States *** Inc. SeattleWA United States Menlo Park CA United States Audio and Speech Group Mitsubishi Electric Research Laboratories CambridgeMA02139-1955 United States Carnegie Mellon University Department of Language and Information Technologies or just Carnegie Mellon University Pittsburgh United States National University of Singapore Singapore Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore Shenzhen Research Institute of Big Data School of Data Science Chinese University of Hong Kong Shenzhen518172 China New York University New YorkNY United States ETSI de Telecomunicacion - Speech Technology and Machine Learning Group Universidad Politecnica de Madrid Ciudad Universitaria Madrid28040 Spain Nanyang Technological University Singapore Singapore Carnegie Mellon University PittsburghPA United States

This article introduces the Tenth Dialog System Technology Challenge (DSTC-10). This edition of the DSTC focuses on applying end-to-end dialog technologies for five distinct tasks in dialog systems, namely 1. Incorporation of Meme images into open domain dialogs, 2. Knowledge-grounded Task-oriented Dialogue Modeling on Spoken Conversations, 3. Situated Interactive Multimodal dialogs, 4. Reasoning for Audio Visual Scene-Aware Dialog, and 5. Automatic Evaluation and Moderation of Open-domainDialogue Systems. This article describes the task definition, provided datasets, baselines, and evaluation setup for each track. We also summarize the results of the submitted systems to highlight the general trends of the state-of-the-art technologies for the tasks. © 2023 The Authors.

关键词： Job analysis

来源：评论

学校读者我要写书评

暂无评论

Automated Diagnosis of Cardiovascular Diseases from Cardiac Magnetic Resonance Imaging Using Deep learning Models: A Review

arXiv

引用

arXiv 2022年

作者： Jafari, Mahboobeh Shoeibi, Afshin Khodatars, Marjane Ghassemi, Navid Moridian, Parisa Delfan, Niloufar Alizadehsani, Roohallah Khosravi, Abbas Ling, Sai Ho Zhang, Yu-Dong Wang, Shui-Hua Gorriz, Juan M. Rokny, Hamid Alinejad Acharya, U. Rajendra Internship in BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering UNSW Sydney SydneyNSW2052 Australia Data Science and Computational Intelligence Institute University of Granada Spain Department of Medical Engineering Mashhad Branch Islamic Azad University Mashhad Iran Faculty of Computer Engineering Dept. of Artificial Intelligence Engineering K. N. Toosi University of Technology Tehran Iran Deakin University VIC3217 Australia Australia School of Computing and Mathematical Sciences University of Leicester Leicester United Kingdom Department of Psychiatry University of Cambridge United Kingdom BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering UNSW Sydney SydneyNSW2052 Australia UNSW Data Science Hub The University of New South Wales SydneyNSW2052 Australia Research Centre Macquarie University Sydney2109 Australia Ngee Ann Polytechnic Singapore599489 Singapore Dept. of Biomedical Informatics and Medical Engineering Asia University Taichung Taiwan Dept. of Biomedical Engineering School of Science and Technology Singapore University of Social Sciences Singapore

In recent years, cardiovascular diseases (CVDs) have become one of the leading causes of mortality globally. CVDs appear with minor symptoms and progressively get worse. The majority of people experience symptoms such as exhaustion, shortness of breath, ankle swelling, fluid retention, and other symptoms when starting CVD. Coronary artery disease (CAD), arrhythmia, cardiomyopathy, congenital heart defect (CHD), mitral regurgitation, and angina are the most common CVDs. Clinical methods such as blood tests, electrocardiography (ECG) signals, and medical imaging are the most effective methods used for the detection of CVDs. Among the diagnostic methods, cardiac magnetic resonance imaging (CMR) is increasingly used to diagnose, monitor the disease, plan treatment and predict CVDs. Coupled with all the advantages of CMR data, CVDs diagnosis is challenging for physicians due to many slices of data, low contrast, etc. To address these issues, deep learning (DL) techniques have been employed to the diagnosis of CVDs using CMR data, and much research is currently being conducted in this field. This review provides an overview of the studies performed in CVDs detection using CMR images and DL techniques. The introduction section examined CVDs types, diagnostic methods, and the most important medical imaging techniques. In the following, investigations to detect CVDs using CMR images and the most significant DL methods are presented. Another section discussed the challenges in diagnosing CVDs from CMR data. Next, the discussion section discusses the results of this review, and future work in CVDs diagnosis from CMR images and DL techniques are outlined. The most important findings of this study are presented in the conclusion section. © 2022, CC BY-NC-ND.

关键词： Electrocardiography

来源：评论

学校读者我要写书评

暂无评论

Transition State Search and Geometry Relaxation throughout Chemical Compound Space with Quantum machine learning

arXiv

引用

arXiv 2022年

作者： Heinen, Stefan Von Rudorff, Guido Falk Von Lilienfeld, O. Anatole University of Vienna Faculty of Physics Kolingasse 14-16 WienAT-1090 Austria Vector Institute for Artificial Intelligence ON TorontoM5S 1M1 Canada Departments of Chemistry Materials Science and Engineering and Physics University of Toronto St. George Campus ON Toronto Canada Machine Learning Group Technische Universität Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany

We use energies and forces predicted within response operator based quantum machine learning (OQML) to perform geometry optimization and transition state search calculations with legacy optimizers. For randomly sampled initial coordinates of small organic query molecules we report systematic improvement of equilibrium and transition state geometry output as training set sizes increase. Out-of-sample SN2 reactant complexes and transition state geometries have been predicted using the LBFGS and the QST2 algorithm with an RMSD of 0.16 and 0.4 Å - after training on up to 200 reactant complexes relaxations and transition state search trajectories from the QMrxn20 data-set, respectively. For geometry optimizations, we have also considered relaxation paths up to 5'500 constitutional isomers with sum formula C7H10O2from the QM9-database. Using the resulting OQML models with an LBFGS optimizer reproduces the minimum geometry with an RMSD of 0.14 Å. For converged equilibrium and transition state geometries subsequent vibrational normal mode frequency analysis indicates deviation from MP2 reference results by on average 14 and 26 cm-1, respectively. While the numerical cost for OQML predictions is negligible in comparison to DFT or MP2, the number of steps until convergence is typically larger in either case. The success rate for reaching convergence, however, improves systematically with training set size, underscoring OQML's potential for universal applicability. © 2022, CC BY.

关键词： machine learning

来源：评论

学校读者我要写书评

暂无评论

Software for dataset-wide XAI: From Local Explanations to Global Insights with Zennit, CoRelAy, and ViRelAy

arXiv

引用

arXiv 2021年

作者： Anders, Christopher J. Neumann, David Samek, Wojciech Müller, Klaus-Robert Lapuschkin, Sebastian Machine Learning Group Department of Electrical Engineering and Computer Science Technische Universität Berlin Germany BIFOLD – Berlin Institute for the Foundations of Learning and Data Berlin Germany Department of Artificial Intelligence Fraunhofer Heinrich Hertz Institute Berlin Germany Machine Learning and Communications Group Department of Electrical Engineering and Computer Science Technische Universität Berlin Germany Department of Artificial Intelligence Korea University Seoul Korea Republic of Max Planck Institut für Informatik Saarbrücken Germany

Deep Neural Networks (DNNs) are known to be strong predictors, but their prediction strategies can rarely be understood. With recent advances in Explainable Artificial Intelligence (XAI), approaches are available to explore the reasoning behind those complex models’ predictions. Among post-hoc attribution methods, Layer-wise Relevance Propagation (LRP) shows high performance. For deeper quantitative analysis, manual approaches exist, but without the right tools they are unnecessarily labor intensive. In this software paper, we introduce three software packages targeted at scientists to explore model reasoning using attribution approaches and beyond: (1) Zennit – a highly customizable and intuitive attribution framework implementing LRP and related approaches in PyTorch, (2) CoRelAy – a framework to easily and quickly construct quantitative analysis pipelines for dataset-wide analyses of explanations, and (3) ViRelAy – a web-application to interactively explore data, attributions, and analysis results. With this, we provide a standardized implementation solution for XAI, to contribute towards more reproducibility in our field. © 2021, CC BY-SA.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Understanding telecom customer churn with machine learning: From prediction to causal inference 31st

Understanding telecom customer churn with machine learning: ...

引用

31st Benelux Conference on Artificial Intelligence and the 28th Belgian Dutch Conference on machine learning, BNAIC/BENELEARN 2019

作者： Verhelst, Théo Caelen, Olivier Dewitte, Jean-Christophe Lebichot, Bertrand Bontempi, Gianluca Machine Learning Group Computer Science Department Université Libre de Bruxelles Brussels Belgium Data Science Team Orange Belgium

ISBN: (纸本)9783030651534

Telecommunication companies are evolving in a highly competitive market where attracting new customers is much more expensive than retaining existing ones. Though retention campaigns may be used to prevent customer churn, their success depends on the availability of accurate prediction models. Churn prediction is notoriously a difficult problem because of the large amount of data, non-linearity, imbalance and low separability between the classes of churners and non-churners. In this paper, we discuss a real case of churn prediction based on Orange Belgium customer data. In the first part of the paper we focus on the design of an accurate prediction model. The large class imbalance between the two classes is handled with the EasyEnsemble algorithm using a random forest classifier. We assess also the impact of different data preprocessing techniques including feature selection and engineering. Results show that feature selection can be used to reduce computation time and memory requirements, though engineering variables does not necessarily improve performance. In the second part of the paper we explore the application of data-driven causal inference, which aims to infer causal relationships between variables from observational data. We conclude that the bill shock and the wrong tariff plan positioning are putative causes of churn. This is supported by the prior knowledge of experts at Orange Belgium. Finally, we present a novel method to evaluate, in terms of the direction and magnitude, the impact of causally relevant variables on churn, making the assumption of no confounding factors. © 2020, Springer Nature Switzerland AG.

关键词： Big data Causal inference Churn prediction machine learning

来源：评论

学校读者我要写书评

暂无评论

Improving Generative Model-based Unfolding with Schrödinger Bridges

arXiv

引用

arXiv 2023年

作者： Diefenbacher, Sascha Liu, Guan-Horng Mikuni, Vinicius Nachman, Benjamin Nie, Weili Physics Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Autonomous Control and Decision Systems Laboratory Georgia Institute of Technology AtlantaGA30332 United States National Energy Research Scientific Computing Center Berkeley Lab BerkeleyCA94720 United States Berkeley Institute for Data Science University of California BerkeleyCA94720 United States Machine Learning Research Group NVIDIA Research United States

machine learning-based unfolding has enabled unbinned and high-dimensional differential cross section measurements. Two main approaches have emerged in this research area: one based on discriminative models and one based on generative models. The main advantage of discriminative models is that they learn a small correction to a starting simulation while generative models scale better to regions of phase space with little data. We propose to use Schrödinger Bridges and diffusion models to create SBUnfold, an unfolding approach that combines the strengths of both discriminative and generative models. The key feature of SBUnfold is that its generative model maps one set of events into another without having to go through a known probability density as is the case for normalizing flows and standard diffusion models. We show that SBUnfold achieves excellent performance compared to state of the art methods on a synthetic Z+jets dataset. © 2023, CC BY.

关键词： Phase space methods

来源：评论

学校读者我要写书评

暂无评论

Computationally Efficient Approximations for Matrix-based Rényi's Entropy

arXiv

引用

arXiv 2021年

作者： Gong, Tieliang Dong, Yuxin Yu, Shujian Dong, Bo The School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an710049 China The Machine Learning Group UiT - The Arctic University of Norway Department of Computer Science Vrije University Amsterdam Amsterdam Netherlands

The recently developed matrix-based Rényi's αorder entropy enables measurement of information in data simply using the eigenspectrum of symmetric positive semi-definite (PSD) matrices in reproducing kernel Hilbert space, without estimation of the underlying data distribution. This intriguing property makes this new information measurement widely adopted in multiple statistical inference and learning tasks. However, the computation of such quantity involves the trace operator on a PSD matrix G to power α (i.e., tr(Gα)), with a normal complexity of nearly O(n3), which severely hampers its practical usage when the number of samples (i.e., n) is large. In this work, we present computationally efficient approximations to this new entropy functional that can reduce its complexity to even significantly less than O(n2). To this end, we leverage the recent progress on Randomized Numerical Linear Algebra, developing Taylor, Chebyshev and Lanczos approximations to tr(Gα) for arbitrary values of α by converting it into a matrix-vector multiplication problem. We also establish the connection between the matrix-based Rényi's entropy and PSD matrix approximation, which enables exploiting both clustering and block low-rank structure of G to further reduce the computational cost. We theoretically provide approximation accuracy guarantees and illustrate the properties for different approximations. Large-scale experimental evaluations on both synthetic and real-world data corroborate our theoretical findings, showing promising speedup with negligible loss in accuracy. Copyright © 2021, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Big data = Big Insights? Operationalising Brooks’ Law in a Massive GitHub data Set

arXiv

引用

arXiv 2022年

作者： Gote, Christoph Schweitzer, Frank Mavrodiev, Pavlin Scholtes, Ingo Department of Systems Design ETH Zurich Weinbergstrasse 56/58 Zurich8092 Switzerland Department of Computer Science XV - Machine Learning for Complex Networks Julius-Maximilians-Universität Würzburg Friedrich-Bergius-Ring 30 Würzburg97076 Germany Data Analytics Group University of Zurich Binzmühlestrasse 14 Zurich8050 Switzerland

Massive data from software repositories and collaboration tools are widely used to study social aspects in software development. One question that several recent works have addressed is how a software project’s size and structure influence team productivity, a question famously considered in Brooks’ law. Recent studies using massive repository data suggest that developers in larger teams tend to be less productive than smaller teams. Despite using similar methods and data, other studies argue for a positive linear or even super-linear relationship between team size and productivity, thus contesting the view of software economics that software projects are diseconomies of scale. In our work, we study challenges that can explain the disagreement between recent studies of developer productivity in massive repository data. We further provide, to the best of our knowledge, the largest, curated corpus of GitHub projects tailored to investigate the influence of team size and collaboration patterns on individual and collective productivity. Our work contributes to the ongoing discussion on the choice of productivity metrics in the operationalisation of hypotheses about determinants of successful software projects. It further highlights general pitfalls in big data analysis and shows that the use of bigger data sets does not automatically lead to more reliable insights. Copyright © 2022, The Authors. All rights reserved.

关键词： Productivity

来源：评论

学校读者我要写书评

暂无评论

SpectralDefense: Detecting Adversarial Attacks on CNNs in the Fourier Domain

arXiv

引用

arXiv 2021年

作者： Harder, Paula Pfreundt, Franz-Josef Keuper, Margret Keuper, Janis Competence Center High Performance Computing Fraunhofer ITWM Kaiserslautern Germany Scientic Computing University of Kaiserslautern Kaiserlautern Germany Fraunhofer Center Machine Learning Germany Data and Web Science Group University of Mannheim Germany Offenburg University Germany

—Despite the success of convolutional neural networks (CNNs) in many computer vision and image analysis tasks, they remain vulnerable against so-called adversarial attacks: Small, crafted perturbations in the input images can lead to false predictions. A possible defense is to detect adversarial examples. In this work, we show how analysis in the Fourier domain of input images and feature maps can be used to distinguish benign test samples from adversarial images. We propose two novel detection methods: Our first method employs the magnitude spectrum of the input images to detect an adversarial attack. This simple and robust classifier can successfully detect adversarial perturbations of three commonly used attack methods. The second method builds upon the first and additionally extracts the phase of Fourier coefficients of feature-maps at different layers of the network. With this extension, we are able to improve adversarial detection rates compared to state-of-the-art detectors on five different attack methods. © 2021, CC BY.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：