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

The EmpkinS-EKSpression Reappraisal Training Augmented With Kinesthesia in Depression: One-Armed Feasibility Study

JMIR Formative Research 2025年 9卷 e65357页

作者： Keinert, Marie Schindler-Gmelch, Lena Rupp, Lydia Helene Sadeghi, Misha Richer, Robert Capito, Klara Eskofier, Bjoern M. Berking, Matthias Department of Clinical Psychology and Psychotherapy Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) Erlangen Germany Machine Learning and Data Analytics Lab Department of Artificial Intelligence in Biomedical Engineering (AIBE) Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) Erlangen Germany Translational Digital Health Group Institute of AI for Health Helmholtz Zentrum Muenchen Neuherberg Germany

Background: Harboring dysfunctional depressogenic cognitions contributes to the development and maintenance of depression. A central goal of cognitive behavioral therapy (CBT) for depression is to invalidate such cognitions via cognitive reappraisal (CR). However, relatively low remission rates and high dropout rates in CBT demonstrate the need for further improvement. Potentially, the effects of CBT could be enhanced by addressing not only dysfunctional depressogenic cognitions but also body states associated with depression. This may be done, for example, by systematically pairing the invalidation of depressogenic cognitions with the performance of antidepressive kinesthesia. Objective: This study aimed to examine the feasibility and clinical potential of a smartphone-based cognitive restructuring task that required users to deliberately perform antidepressive kinesthesia in conjunction with the rejection of depressogenic statements and the affirmation of antidepressive statements. This feasibility study was conducted as a precursor to a large-scale randomized controlled trial. Methods: In total, 10 healthy participants engaged in a single 90-120-minute session of smartphone-based CR training. During the training, they completed 2 phases in which they were required to reject 20 depressogenic and affirm 20 antidepressive statements, respectively. Diagnostic assessments were conducted 1 week (T1) before and directly prior (T2) to the training, and again directly posttraining (T3) and at a 2-week follow-up posttraining (T4). Feasibility outcomes assessed at T3 included intervention safety recorded by study therapists, compliance, technical feasibility, usability assessed using the Short Version of the User Experience Questionnaire (UEQ-S), and acceptability assessed using the UEQ-S and self-developed items. Preliminary clinical potential was evaluated via single-item ratings of current depressed and positive mood assessed continuously during the training. Feasibility

关键词： cognitive reappraisal depression facial expression kinesthesia mobile phone smartphone-based intervention

来源：评论

学校读者我要写书评

暂无评论

Finding latent causes in causal networks: An efficient approach based on Markov blankets

Finding latent causes in causal networks: An efficient appro...

引用

22nd Annual Conference on Neural Information Processing Systems, NIPS 2008

作者： Pellet, Jean-Philippe Elisseeff, André Pattern Recognition and Machine Learning Group Swiss Federal Institute of Technology Zurich 8092 Zurich Switzerland Data Analytics Group IBM Research GmbH 8803 Ruschlikon Switzerland

ISBN: (纸本)9781605609492

Causal structure-discovery techniques usually assume that all causes of more than one variable are observed. This is the so-called causal sufficiency assumption. In practice, it is untestable, and often violated. In this paper, we present an efficient causal structure-learning algorithm, suited for causally insufficient data. Similar to algorithms such as IC* and FCI, the proposed approach drops the causal sufficiency assumption and learns a structure that indicates (potential) latent causes for pairs of observed variables. Assuming a constant local density of the data-generating graph, our algorithm makes a quadratic number of conditional-independence tests w.r.t. the number of variables. We show with experiments that our algorithm is comparable to the state-of-the-art FCI algorithm in accuracy, while being several orders of magnitude faster on large problems. We conclude that MBCS* makes a new range of causally insufficient problems computationally tractable.

关键词： learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Minimum Cost Multicut Approach to Self-supervised Multiple Person Tracking 15th

A Two-Stage Minimum Cost Multicut Approach to Self-supervise...

引用

15th Asian Conference on Computer Vision, ACCV 2020

作者： Ho, Kalun Kardoost, Amirhossein Pfreundt, Franz-Josef Keuper, Janis Keuper, Margret Fraunhofer Center Machine Learning Sankt Augustin Germany CC-HPC Fraunhofer ITWM Kaiserslautern Germany Data and Web Science Group University of Mannheim Mannheim Germany Institute for Machine Learning and Analytics Offenburg University Offenburg Germany

ISBN: (纸本)9783030695316

Multiple Object Tracking (MOT) is a long-standing task in computer vision. Current approaches based on the tracking by detection paradigm either require some sort of domain knowledge or supervision to associate data correctly into tracks. In this work, we present a self-supervised multiple object tracking approach based on visual features and minimum cost lifted multicuts. Our method is based on straight-forward spatio-temporal cues that can be extracted from neighboring frames in an image sequences without supervision. Clustering based on these cues enables us to learn the required appearance invariances for the tracking task at hand and train an AutoEncoder to generate suitable latent representations. Thus, the resulting latent representations can serve as robust appearance cues for tracking even over large temporal distances where no reliable spatio-temporal features can be extracted. We show that, despite being trained without using the provided annotations, our model provides competitive results on the challenging MOT Benchmark for pedestrian tracking. © 2021, Springer Nature Switzerland AG.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks 38

The Map Equation Goes Neural: Mapping Network Flows with Gra...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Blöcker, Christopher Tan, Chester Scholtes, Ingo Data Analytics Group Department of Informatics University of Zurich Switzerland Machine Learning for Complex Networks Center for Artificial Intelligence and Data Science Julius-Maximilians-Universität Würzburg Germany

Community detection is an essential tool for unsupervised data exploration and revealing the organisational structure of networked systems. With a long history in network science, community detection typically relies on objective functions, optimised with custom-tailored search algorithms, but often without leveraging recent advances in deep learning. Recently, first works have started incorporating such objectives into loss functions for deep graph clustering and pooling. We consider the map equation, a popular information-theoretic objective function for unsupervised community detection, and express it in differentiable tensor form for optimisation through gradient descent. Our formulation turns the map equation compatible with any neural network architecture, enables end-to-end learning, incorporates node features, and chooses the optimal number of clusters automatically, all without requiring explicit regularisation. Applied to unsupervised graph clustering tasks, we achieve competitive performance against state-of-the-art deep graph clustering baselines in synthetic and real-world datasets. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting Influential Higher-Order Patterns in Temporal Network data 14

Predicting Influential Higher-Order Patterns in Temporal Net...

引用

14th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2022

作者： Gote, Christoph Perri, Vincenzo Scholtes, Ingo Data Analytics Group University of Zurich Zurich Switzerland Eth Zurich Systems Design Switzerland Julius-Maximilians-Universität Würzburg Chair of Machine Learning for Complex Networks Würzburg Germany

ISBN: (纸本)9781665456616

Networks are frequently used to model complex systems comprised of interacting elements. While edges capture the topology of direct interactions, the true complexity of many systems originates from higher-order patterns in paths by which nodes can indirectly influence each other. Path data, representing ordered sequences of consecutive direct interactions, can be used to model these patterns. On the one hand, to avoid overfitting, such models should only consider those higher-order patterns for which the data provide sufficient statistical evidence. On the other hand, we hypothesise that network models, which capture only direct interactions, underfit higher-order patterns present in data. Consequently, both approaches are likely to misidentify influential nodes in complex networks. We contribute to this issue by proposing five centrality measures based on MOGen, a multi-order generative model that accounts for all indirect influences up to a maximum distance but disregards influences at higher distances. We compare MOGen-based centralities to equivalent measures for network models and path data in a prediction experiment where we aim to identify influential nodes in out-of-sample data. Our results show strong evidence supporting our hypothesis. MOGen consistently outperforms both the network model and path-based prediction. We further show that the performance difference between MOGen and the path-based approach disappears if we have sufficient observations, confirming that the error is due to overfitting. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Unified Approach Towards Active learning and Out-of-Distribution Detection

arXiv

引用

arXiv 2024年

作者： Schmidt, Sebastian Schenk, Leonard Schwinn, Leo Günnemann, Stephan BMW Group Munich Germany Technical University of Munich Data Analytics and Machine Learning Group Munich Germany

When applying deep learning models in open-world scenarios, active learning (AL) strategies are crucial for identifying label candidates from a nearly infinite amount of unlabeled data. In this context, robust out-of-distribution (OOD) detection mechanisms are essential for handling data outside the target distribution of the application. However, current works investigate both problems separately. In this work, we introduce SISOM as the first unified solution for both AL and OOD detection. By leveraging feature space distance metrics SISOM combines the strengths of the currently independent tasks to solve both effectively. We conduct extensive experiments showing the problems arising when migrating between both tasks. In these evaluations SISOM underlined its effectiveness by achieving first place in two of the widely used OpenOOD benchmarks and second place in the remaining one. In AL, SISOM outperforms others and delivers top-1 performance in three benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

Stream-based Active learning by Exploiting Temporal Properties in Perception with Temporal Predicted Loss

arXiv

引用

arXiv 2023年

作者： Schmidt, Sebastian Günnemann, Stephan BMW Group Munich Germany Technical University of Munich Data Analytics and Machine Learning Group Munich Germany

Active learning (AL) reduces the amount of labeled data needed to train a machine learning model by intelligently choosing which instances to label. Classic pool-based AL requires all data to be present in a datacenter, which can be challenging with the increasing amounts of data needed in deep learning. However, AL on mobile devices and robots, like autonomous cars, can filter the data from perception sensor streams before reaching the datacenter. We exploited the temporal properties for such image streams in our work and proposed the novel temporal predicted loss (TPL)1 method. To evaluate the stream-based setting properly, we introduced the GTA V streets and the A2D2 streets dataset and made both publicly available. Our experiments showed that our approach significantly improves the diversity of the selection while being an uncertainty-based method. As pool-based approaches are more common in perception applications, we derived a concept for comparing pool-based and stream-based AL, where TPL outperformed state-of-the-art pool- or stream-based approaches for different models. TPL demonstrated a gain of 2.5 precept points (pp) less required data while being significantly faster than pool-based methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Deep reinforcement learning for motion planning of mobile robots

arXiv

引用

arXiv 2019年

作者： Butyrev, Leonid Edelhäußer, Thorsten Mutschler, Christopher Fraunhofer Institute for Integrated Circuits Iis Precise Positioning and Analytics Department Machine Learning and Information Fusion Group Nuremberg Germany Computer Science Department Machine Learning and Data Analytics Lab Erlangen Germany

This paper presents a novel motion and trajectory planning algorithm for nonholonomic mobile robots that uses recent advances in deep reinforcement learning. Starting from a random initial state, i.e., position, velocity and orientation, the robot reaches an arbitrary target state while taking both kinematic and dynamic constraints into account. Our deep reinforcement learning agent not only processes a continuous state space it also executes continuous actions, i.e., the acceleration of wheels and the adaptation of the steering angle. We evaluate our motion and trajectory planning on a mobile robot with a differential drive in a simulation environment. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

167-PFlops deep learning for electron microscopy: From learning physics to atomic manipulation

167-PFlops deep learning for electron microscopy: From learn...

引用

2018 International Conference for High Performance Computing, Networking, Storage, and Analysis, SC 2018

作者： Patton, Robert M. Travis Johnston, J. Young, Steven R. Schuman, Catherine D. March, Don D. Potok, Thomas E. Rose, Derek C. Lim, Seung-Hwan Karnowski, Thomas P. Ziatdinov, Maxim A. Kalinin, Sergei V. Oak Ridge National Laboratory Oak RidgeTN37831-6085 United States Computational Data Analytics Group United States Geographic Information Science and Technology Group United States Imaging Signals and Machine Learning Group United States Institute for Functional Imaging of Materials United States Center for Nanophase Materials Sciences United States

ISBN: (纸本)9781538683842

An artificial intelligence system called MENNDL, which used 25,200 NVIDIA Volta GPUs on Oak Ridge National Laboratory's Summit machine, automatically designed an optimal deep learning network in order to extract structural information from raw atomic-resolution microscopy data. In a few hours, MENNDL creates and evaluates millions of networks using a scalable, parallel, asynchronous genetic algorithm augmented with a support vector machine to automatically find a superior deep learning network topology and hyper-parameter set than a human expert can find in months. For the application of electron microscopy, the system furthers the goal of improving our understanding of the electron-beam-matter interactions and real-time image-based feedback, which enables a huge step beyond human capacity towards nanofabricating materials automatically. MENNDL has been scaled to the 4,200 available nodes of Summit achieving a measured 152.5 PFlops, with an estimated sustained performance of 167 PFlops when the entire machine is available. © 2018 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a data Governance Framework and Platform: A Case Study of a National Research Organization of Thailand 20

Design and Implementation of a Data Governance Framework and...

引用

20th International Joint Conference on Computer Science and Software Engineering, JCSSE 2023

作者： Chanyachatchawan, Sapa Nasingkun, Krich Tumsangthong, Patipat Chata, Porntiwa Buranarach, Marut Socharoentum, Monsak National Electronics and Computer Technology Center Leveraging Technology Solutions Section Bangkok Thailand National Electronics and Computer Technology Center Strategic Analytics Networks with Machine Learning and Ai Research Bangkok Thailand National Electronics and Computer Technology Center Data Science and Analytics Research Group Bangkok Thailand Digital Government Development Agency Bangkok Thailand

ISBN: (纸本)9798350300505

In the current era of extensive data usage across industries, data collection, preservation, utilization, and organization has become more challenging and nuanced because it is necessary to consider critical concerns such as data security, privacy, and legal issues, apart from efficiency issues. As a result, Thai government initiated the idea and effort to implement data governance throughout the government agency. This paper showcases the implementation of data governance in a governmental research organization with highly diverse structured and unstructured data. The implementation follows international standards and the guidelines of the Digital Government Development Agency (DGA). The executives set up the working body, including the data Governance Council and data Stewards, responsible for setting up and deploying policies and regulations. Creating awareness and the necessary infrastructure are the main focuses in the first-year phase. The metadata was designed to extend DGA's version and match the organization's unique requirements. A data catalog platform was developed accordingly. We organized activities to boost employee awareness and participation, including advertising and data catalog platform training. By the end of the first year of implementation, every organization unit had registered at least one data record into the data catalog. © 2023 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：