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

Studies in Big data 2022年 109卷 v-xi页

作者： Saba, Tanzila Rehman, Amjad Roy, Sudipta Artificial Intelligence and Data Analytics Lab College of Computer and Information Sciences Prince Sultan University Riyadh Saudi Arabia Artificial Intelligence and Data Science Jio Institute Ulwe Navi Mumbai India

来源：评论

学校读者我要写书评

暂无评论

Fetal Re-Identification in Multiple Pregnancy Ultrasound Images Using Deep Learning

Fetal Re-Identification in Multiple Pregnancy Ultrasound Ima...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Elisabeth Gabler Michael Nissen Thomas R. Altstidl Adriana Titzmann Kai Packhäuser Andreas Maier Peter A. Fasching Bjoern M. Eskofier Heike Leutheuser Department Artificial Intelligence in Biomedical Engineering Machine Learning and Data Analytics (MaD) Lab Friedrich-Alexander-Universität Erlangen-Nurnberg (FAU) Erlangen Germany Department of Gynecology and Obstetrics Erlangen University Hospital Friedrich-Alexander-Universität Erlangen-Nurnberg (FAU) Erlangen Germany Department of Computer Science Pattern Recognition Lab Friedrich-Alexander-Universität Erlangen-Nurnberg (FAU) Erlangen Germany

Ultrasound examinations during pregnancy can detect abnormal fetal development, which is a leading cause of perinatal mortality. In multiple pregnancies, the position of the fetuses may change between examinations. The individual fetus cannot be clearly identified. Fetal re-identification may improve diagnostic capabilities by tracing individual fetal changes. This work evaluates the feasibility of fetal re-identification on FETAL_PLANES_DB, a publicly available dataset of singleton pregnancy ultrasound images. Five dataset subsets with 6,491 images from 1,088 pregnant women and two re-identification frameworks (Torchreid, FastReID) are evaluated. FastReID achieves a mean average precision of 68.77% (68.42%) and mean precision at rank 10 score of 89.60% (95.55%) when trained on images showing the fetal brain (abdomen). Visualization with gradient-weighted class activation mapping shows that the classifiers appear to rely on anatomical features. We conclude that fetal re-identification in ultrasound images may be feasible. However, more work on additional datasets, including images from multiple pregnancies and several subsequent examinations, is required to ensure and investigate performance stability and *** relevance— To date, fetuses in multiple pregnancies cannot be distinguished between ultrasound examinations. This work provides the first evidence for feasibility of fetal re-identification in pregnancy ultrasound images. This may improve diagnostic capabilities in clinical practice in the future, such as longitudinal analysis of fetal changes or abnormalities.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploiting Neighbor Effect: Conv-Agnostic GNN Framework for Graphs with Heterophily

arXiv

引用

arXiv 2022年

作者： Chen, Jie Chen, Shouzhen Gao, Junbin Huang, Zengfeng Zhang, Junping Pu, Jian Shanghai Key Lab of Intelligent Information Processing The School of Computer Science Fudan University Shanghai200433 China Discipline of Business Analytics The University of Sydney Business School The University of Sydney CamperdownNSW2006 Australia The School of Data Science Fudan University Shanghai200433 China The Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai200433 China

Due to the homophily assumption in graph convolution networks (GNNs), a common consensus in the graph node classification task is that GNNs perform well on homophilic graphs but may fail on heterophilic graphs with many inter-class edges. However, the previous inter-class edges perspective and related homo-ratio metrics cannot well explain the GNNs performance under some heterophilic datasets, which implies that not all the inter-class edges are harmful to GNNs. In this work, we propose a new metric based on von Neumann entropy to re-examine the heterophily problem of GNNs and investigate the feature aggregation of inter-class edges from an entire neighbor identifiable perspective. Moreover, we propose a simple yet effective Conv-Agnostic GNN framework (CAGNNs) to enhance the performance of most GNNs on heterophily datasets by learning the neighbor effect for each node. Specifically, we first decouple the feature of each node into the discriminative feature for downstream tasks and the aggregation feature for graph convolution. Then, we propose a shared mixer module to adaptively evaluate the neighbor effect of each node to incorporate the neighbor information. The proposed framework can be regarded as a plug-in component and is compatible with most GNNs. The experimental results over nine well-known benchmark datasets indicate that our framework can significantly improve performance, especially for the heterophily graphs. The average performance gain is 9.81%, 25.81%, and 20.61% compared with GIN, GAT, and GCN, respectively. Extensive ablation studies and robustness analysis further verify the effectiveness, robustness, and interpretability of our framework. Code is available at https://***/JC-202/CAGNN. Copyright © 2022, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

: Quantum Artificial intelligence for the Automotive Industry

引用

KI - Künstliche Intelligenz 2024年第4期38卷 351-359页

作者： Stollenwerk, Tobias Bhattacharya, Somtapa Cattelan, Michele Ciani, Alessandro Compostella, Gabriele Headley, David Klepsch, Johannes Klusch, Matthias Leder, Markus Macaluso, Antonio Michielsen, Kristel Nabok, Dmytro Papanikolaou, Anestis Rausch, Alexander Schumann, Marco Skolik, Andrea Yarkoni, Sheir Wilhelm, Frank K. Institute for Quantum Computing Analytics (PGI-12) Forschungszentrum Jülich Jülich Germany Volkswagen Data:Lab Volkswagen Group Munich Germany Machine Learning Research Lab Volkswagen Group Munich Germany Mercedes-Benz AG Stuttgart Germany BMW AG München Germany German Research Center for Artificial Intelligence (DFKI) Saarbrüecken Germany Jülich Supercomputing Centre (JSC) Forschungszentrum Jülich Jülich Germany Robert Bosch GmbH Corporate Research Renningen Germany

来源：评论

学校读者我要写书评

暂无评论

Community Detection with the Map Equation and Infomap: Theory and Applications

arXiv

引用

arXiv 2023年

作者： Smiljanić, Jelena Blöcker, Christopher Holmgren, Anton Edler, Daniel Neuman, Magnus Rosvall, Martin Integrated Science Lab Department of Physics Umeå University UmeåSE-901 87 Sweden Scientific Computing Laboratory Center for the Study of Complex Systems Institute of Physics Belgrade University of Belgrade Pregrevica 118 Belgrade11080 Serbia Center for Artificial Intelligence and Data Science University of Würzburg WürzburgDE-97070 Germany Data Analytics Group Department of Informatics University of Zürich ZürichCH-8006 Switzerland Gothenburg Global Biodiversity Centre University of Gothenburg Gothenburg Sweden

Real-world networks have a complex topology comprising many elements often structured into communities. Revealing these communities helps researchers uncover the organizational and functional structure of the system that the network represents. However, detecting community structures in complex networks requires selecting a community detection method among a multitude of alternatives with different network representations, community interpretations, and underlying mechanisms. This review and tutorial focuses on a popular community detection method called the map equation and its search algorithm Infomap. The map equation framework for community detection describes communities by analyzing dynamic processes on the network. Thanks to its flexibility, the map equation provides extensions that can incorporate various assumptions about network structure and dynamics. To help decide if the map equation is a suitable community detection method for a given complex system and problem at hand - and which variant to choose - we review the map equation's theoretical framework and guide users in applying the map equation to various research problems. © 2023, CC BY-NC-ND.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised learning for textbook question answering

TechRxiv

引用

TechRxiv 2021年

作者： Ma, Jie Chai, Qi Huang, Jingyue Liu, Jun You, Yang Zheng, Qinghua National Engineering Lab for Big Data Analytics School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The High Performance Computing for Artificial intelligence Lab Department of Computer Science National University of Singapore 117417 Singapore

Textbook Question Answering (TQA) is the task of answering diagram and non-diagram questions given large multimodal contexts consisting of abundant text and diagrams. Deep text understandings and effective learning of diagram semantics are important for this task due to its specificity. In this paper, we propose a Weakly Supervised learning method for TQA (WSTQ), which regards the incompletely accurate results of essential intermediate procedures for this task as supervision to develop Text Matching (TM) and Relation Detection (RD) tasks and then employs the tasks to motivate itself to learn strong text comprehension and excellent diagram semantics respectively. Specifically, we apply the result of text retrieval to build positive as well as negative text pairs. In order to learn deep text understandings, we first pre-train the text understanding module of WSTQ on TM and then fine-tune it on TQA. We build positive as well as negative relation pairs by checking whether there is any overlap between the items/regions detected from diagrams using object detection. The RD task forces our method to learn the relationships between regions, which are crucial to express the diagram semantics. We train WSTQ on RD and TQA simultaneously, i.e., multitask learning, to obtain effective diagram semantics and then improve the TQA performance. Extensive experiments are carried out on CK12-QA and AI2D to verify the effectiveness of WSTQ. Experimental results show that our method achieves significant accuracy improvements of 5.02% and 4.12% on test splits of the above datasets respectively than the current state-of-the-art baseline. We have released our code on https://***/dr-majie/WSTQ. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Learning with Group Noise

arXiv

引用

arXiv 2021年

作者： Wang, Qizhou Yao, Jiangchao Gong, Chen Liu, Tongliang Gong, Mingming Yang, Hongxia Han, Bo Department of Computer Science Hong Kong Baptist University Hong Kong Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of MoE School of Computer Science and Engineering Nanjing University of Science and Technology China Data Analytics and Intelligence Lab Alibaba Group China Department of Computing Hong Kong Polytechnic University Hong Kong Trustworthy Machine Learning Lab School of Computer Science University of Sydney Australia School of Mathematics and Statistics University of Melbourne Australia

Machine learning in the context of noise is a challenging but practical setting to plenty of real-world applications. Most of the previous approaches in this area focus on the pairwise relation (casual or correlational relationship) with noise, such as learning with noisy labels. However, the group noise, which is parasitic on the coarse-grained accurate relation with the fine-grained uncertainty, is also universal and has not been well investigated. The challenge under this setting is how to discover true pairwise connections concealed by the group relation with its fine-grained noise. To overcome this issue, we propose a novel Max-Matching method for learning with group noise. Specifically, it utilizes a matching mechanism to evaluate the relation confidence of each object (cf. Figure 1) w.r.t. the target, meanwhile considering the Non-IID characteristics among objects in the group. Only the most confident object is considered to learn the model, so that the fine-grained noise is mostly dropped. The performance on a range of real-world datasets in the area of several learning paradigms demonstrates the effectiveness of Max-Matching. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Ensuring the robustness and reliability of data-driven knowledge discovery models in production and manufacturing

arXiv

引用

arXiv 2020年

作者： Tripathi, Shailesh Muhr, David Manuel, Brunner Emmert-Streib, Frank Jodlbauer, Herbert Dehmer, Matthias Production and Operations Management University of Applied Sciences Upper Austria Austria Predictive Society and Data Analytics Lab Faculty of Information Technolgy and Communication Sciences Tampere University TampereFI-33101 Finland Institute of Biosciences and Medical Technology TampereFI-33101 Finland Department of Biomedical Computer Science and Mechatronics UMIT-The Health and Life Science University Tyrol6060 Hall Austria College of Artificial Intelligence Nankai University Tianjin300350 China

The implementation of robust, stable, and user-centered data analytics and machine learning models is confronted by numerous challenges in production and manufacturing. Therefore, a systematic approach is required to develop, evaluate, and deploy such models. The data-driven knowledge discovery framework provides an orderly partition of the data-mining processes to ensure the practical implementation of data analytics and machine learning models. However, the practical application of robust industry-specific data-driven knowledge discovery models faces multiple data– and model-development–related issues. These issues should be carefully addressed by allowing a flexible, customized, and industry-specific knowledge discovery framework;in our case, this takes the form of the cross-industry standard process for data mining (CRISP-DM). This framework is designed to ensure active cooperation between different phases to adequately address data- and model-related issues. In this paper, we review several extensions of CRISP-DM models and various data-robustness– and model-robustness–related problems in machine learning, which currently lacks proper cooperation between data experts and business experts because of the limitations of data-driven knowledge discovery models. Copyright © 2020, The Authors. All rights reserved.

关键词： Industry 4.0

来源：评论

学校读者我要写书评

暂无评论

Exploring the Capabilities of a Language Model-Only Approach for Depression Detection in Text data

Exploring the Capabilities of a Language Model-Only Approach...

引用

IEEE EMBS International Conference on Information Technology Applications in Biomedicine (ITAB)

作者： Misha Sadeghi Bernhard Egger Reza Agahi Robert Richer Klara Capito Lydia Helene Rupp Lena Schindler-Gmelch Matthias Berking Bjoern M. Eskofier Department Artificial Intelligence in Biomedical Engineering Machine Learning and Data Analytics Lab Friedrich-Alexander-Universität Erlangen- Nürnberg (FAU) Erlangen Germany Department of Computer Science Chair of Visual Computing Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) Erlangen Germany Syenah GMBH Eschborn Germany Chair of Clinical Psychology and Psychotherapy Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) Erlangen Germany

Depression is a prevalent and debilitating mental health condition that requires accurate and efficient detection for timely and effective treatment. In this study, we utilized the E-DAIC (Extended Distress Analysis Interview Corpus-Wizard-of-Oz) dataset, an extended version of the DAIC-WOZ dataset, which consists of semi-clinical interviews conducted by an animated virtual interviewer called Ellie, controlled by a human interviewer in another room. With 275 participants, the E-DAIC dataset represents a valuable resource for investigating depression detection methods. Our aim is to predict PHQ-8 scores through text analysis. Leveraging state-of-the-art speech processing, LLM-based text summarization, and a specialized depression detection module, we demonstrate the transformative potential of language data analysis in enhancing depression screening. By overcoming the limitations of manual feature extraction methods, our automated techniques provide a more efficient and effective means of evaluating depression. In our evaluation, we achieve robust accuracy on the development set of the E-DAIC dataset, with a Mean Absolute Error (MAE) of 3.65 in estimating PHQ-8 scores from recorded interviews. This remarkable performance highlights the efficacy of our approach in automatically predicting depression severity. Our research contributes to the growing evidence supporting the use of LLMs in mental health assessment, showcasing the role of innovative technologies in advancing patient care for depression.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Monitoring medication optimization in patients with Parkinson’s disease

Monitoring medication optimization in patients with Parkinso...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Hamid Moradi Julius Hannink Sabine Stallforth Till Gladow Stefan Ringbauer Martin Mayr Jürgen Winkler Jochen Klucken Bjoern M. Eskofier Department of Artificial Intelligence in Biomedical Engineering Machine Learning and Data Analytics Laboratory (MaD Lab) Friedrich Alexander University Erlangen Nuremberg Erlangen-Nuremberg Germany Portabiles HealthCare Technologies GmbH Erlangen Germany Department of Molecular-Neurology University Hospital Erlangen Erlangen Germany Medical Valley Digital Health Application Center Bamberg Germany NeuroSys GmbH Ulm Germany Luxembourg Institute of Health Centre Hospitalier du Luxembourg University of Luxembourg

Medication optimization is a common component of the treatment strategy in patients with Parkinson’s disease. As the disease progresses, it is essential to compensate for the movement deterioration in patients. Conventionally, examining motor deterioration and prescribing medication requires the patient’s onsite presence in hospitals or practices. Home-monitoring technologies can remotely deliver essential information to physicians and help them devise a treatment decision according to the patient’s need. Additionally, they help to observe the patient’s response to these changes. In this regard, we conducted a longitudinal study to collect gait data of patients with Parkinson’s disease while they received medication changes. Using logistic regression classifier, we could detect the annotated motor deterioration during medication optimization with an accuracy of 92%. Moreover, an in-depth examination of the best features illustrated a decline in gait speed and swing phase duration in the deterioration phases due to suboptimal *** relevance— Our proposed gait analysis method in this study provides objective, detailed, and punctual information to physicians. Revealing clinically relevant time points related to the patient’s need for medical adaption alleviates therapy optimization for physicians and reduces the duration of suboptimal treatment for patients. As the home-monitoring system acts remotely, embedding it in the medical care pathways could improve patients’ quality of life.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：