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

HARDC : A novel ECG-based heartbeat classification method to detect arrhythmia using hierarchical attention based dual structured RNN with dilated CNN

arXiv

引用

arXiv 2023年

作者： Islam, Md Shofiqul Hasan, Khondokar Fida Sultana, Sunjida Uddin, Shahadat Lio', Pietro Quinn, Julian M.W. Moni, Mohammad Ali Faculty of Computing Universiti Malaysia Pahang Gambang Pahang Kuantan26300 Malaysia Lebuhraya Tun Razak Gambang Pahang Kuantan26300 Malaysia 2 George Street Brisbane4000 Australia Department of Computer Science and Engineering Islamic University Kushtia7600 Bangladesh School of Project Management Faculty of Engineering The University of Sydney Sydney Australia Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom Bone Research Group The Garvan Institute of Medical Research DarlinghurstNSW Australia Artificial Intelligence & Data Science School of Health and Rehabilitation Sciences Faculty of Health and Behavioural Sciences The University of Queensland St LuciaQLD4072 Australia

Deep learning-based models have achieved significant success in detecting cardiac arrhythmia by analyzing ECG signals to categorize patient heartbeats. To improve the performance of such models, we have developed a novel hybrid hierarchical attention-based bidirectional recurrent neural network with dilated CNN (HARDC) method for arrhythmia classification. This solves problems that arise when traditional dilated convolutional neural network (CNN) models disregard the correlation between contexts and gradient dispersion. The proposed HARDC fully exploits the dilated CNN and bidirectional recurrent neural network unit (BiGRU-BiLSTM) architecture to generate fusion features. As a result of incorporating both local and global feature information and an attention mechanism, the model's performance for prediction is improved. By combining the fusion features with a dilated CNN and a hierarchical attention mechanism, the trained HARDC model showed significantly improved classification results and interpretability of feature extraction on the PhysioNet 2017 challenge dataset. Sequential Z-Score normalization, filtering, denoising, and segmentation are used to prepare the raw data for analysis. CGAN (Conditional Generative Adversarial Network) is then used to generate synthetic signals from the processed data. The experimental results demonstrate that the proposed HARDC model significantly outperforms other existing models, achieving an accuracy of 99.60%, F1 score of 98.21%, a precision of 97.66%, and recall of 99.60% using MIT-BIH generated ECG. In addition, this approach substantially reduces run time when using dilated CNN compared to normal convolution. Overall, this hybrid model demonstrates an innovative and cost-effective strategy for ECG signal compression and high-performance ECG recognition. Our results indicate that an automated and highly computed method to classify multiple types of arrhythmia signals holds considerable promise. © 2023, CC BY.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

Applying the FAIR Principles to computational workflows

arXiv

引用

arXiv 2024年

作者： Wilkinson, Sean R. Aloqalaa, Meznah Belhajjame, Khalid Crusoe, Michael R. de Paula Kinoshita, Bruno Gadelha, Luiz Garijo, Daniel Ragnar Gustafsson, Ove Johan Juty, Nick Kanwal, Sehrish Khan, Farah Zaib Köster, Johannes Gehlen, Karsten Petersvon Pouchard, Line Rannow, Randy K. Soiland-Reyes, Stian Soranzo, Nicola Sufi, Shoaib Sun, Ziheng Vilne, Baiba Wouters, Merridee A. Yuen, Denis Goble, Carole Oak Ridge Leadership Computing Facility Oak Ridge National Laboratory Oak RidgeTN United States Department of Computer Science University of Manchester Manchester United Kingdom LAMSADE PSL Paris Dauphine University Paris France Berlin Germany Earth Sciences Barcelona Supercomputing Center Barcelona Spain Heidelberg Germany Ontology Engineering Group Universidad Politécnica de Madrid Madrid Spain Australian BioCommons University of Melbourne MelbourneVIC Australia ParkvilleVIC Australia University Medicine Essen University of Duisburg-Essen Essen Germany Data Management Department Deutsches Klimarechenzentrum GmbH Hamburg Germany Center for Computing Research Sandia National Laboratories AlbuquerqueNM United States Silverdraft Supercomputing BoiseID United States Informatics Institute University of Amsterdam Amsterdam Netherlands Earlham Institute Norwich United Kingdom Center for Spatial Information Science and Systems Department of Geography and Geoinformation Science George Mason University FairfaxVA United States Bioinformatics Group Riga Stradins University Riga Latvia School of Clinical Medicine University of New South Wales KensingtonNSW Australia Ontario Institute for Cancer Research TorontoON Canada

Recent trends within computational and data sciences show an increasing recognition and adoption of computational workflows as tools for productivity and reproducibility that also democratize access to platforms and processing know-how. As digital objects to be shared, discovered, and reused, computational workflows benefit from the FAIR principles, which stand for Findable, Accessible, Interoperable, and Reusable. The Workflows Community Initiative’s FAIR Workflows Working group (WCI-FW), a global and open community of researchers and developers working with computational workflows across disciplines and domains, has systematically addressed the application of both FAIR data and software principles to computational workflows. We present recommendations with commentary that reflects our discussions and justifies our choices and adaptations. These are offered to workflow users and authors, workflow management system developers, and providers of workflow services as guidelines for adoption and fodder for discussion. The FAIR recommendations for workflows that we propose in this paper will maximize their value as research assets and facilitate their adoption by the wider community. © 2024, CC BY.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

MINI-Net: Multiple Instance Ranking Network for Video Highlight Detection 16th

MINI-Net: Multiple Instance Ranking Network for Video Highli...

引用

16th European Conference on Computer Vision, ECCV 2020

作者： Hong, Fa-Ting Huang, Xuanteng Li, Wei-Hong Zheng, Wei-Shi School of Data and Computer Science Sun Yat-sen University Guangzhou China Peng Cheng Laboratory Shenzhen518005 China VICO Group University of Edinburgh Edinburgh United Kingdom Pazhou Lab Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

ISBN: (纸本)9783030586003

We address the weakly supervised video highlight detection problem for learning to detect segments that are more attractive in training videos given their video event label but without expensive supervision of manually annotating highlight segments. While manually averting localizing highlight segments, weakly supervised modeling is challenging, as a video in our daily life could contain highlight segments with multiple event types, e.g., skiing and surfing. In this work, we propose casting weakly supervised video highlight detection modeling for a given specific event as a multiple instance ranking network (MINI-Net) learning. We consider each video as a bag of segments, and therefore, the proposed MINI-Net learns to enforce a higher highlight score for a positive bag that contains highlight segments of a specific event than those for negative bags that are irrelevant. In particular, we form a max-max ranking loss to acquire a reliable relative comparison between the most likely positive segment instance and the hardest negative segment instance. With this max-max ranking loss, our MINI-Net effectively leverages all segment information to acquire a more distinct video feature representation for localizing the highlight segments of a specific event in a video. The extensive experimental results on three challenging public benchmarks clearly validate the efficacy of our multiple instance ranking approach for solving the problem. © 2020, Springer Nature Switzerland AG.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

Longitudinal Segmentation of MS Lesions via Temporal Difference Weighting

arXiv

引用

arXiv 2024年

作者： Rokuss, Maximilian R. Kirchhoff, Yannick Roy, Saikat Kovacs, Balint Ulrich, Constantin Wald, Tassilo Zenk, Maximilian Denner, Stefan Isensee, Fabian Vollmuth, Philipp Kleesiek, Jens Maier-Hein, Klaus Heidelberg Division of Medical Image Computing Germany Faculty of Mathematics and Computer Science Heidelberg University Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Karlsruhe Heidelberg Germany Medical Faculty Heidelberg Heidelberg University Heidelberg Germany Helmholtz Imaging German Cancer Research Center Heidelberg Germany Department of Neuroradiology Heidelberg University Hospital Heidelberg Germany Division for Computational Neuroimaging Department of Neuroradiology Heidelberg University Hospital Heidelberg Germany University Hospital Essen Essen Germany West German Cancer Center Essen University Hospital Essen Essen Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Germany

Accurate segmentation of Multiple Sclerosis (MS) lesions in longitudinal MRI scans is crucial for monitoring disease progression and treatment efficacy. Although changes across time are taken into account when assessing images in clinical practice, most existing deep learning methods treat scans from different timepoints separately. Among studies utilizing longitudinal images, a simple channel-wise concatenation is the primary albeit suboptimal method employed to integrate timepoints. We introduce a novel approach that explicitly incorporates temporal differences between baseline and follow-up scans through a unique architectural inductive bias called Difference Weighting Block. It merges features from two timepoints, emphasizing changes between scans. We achieve superior scores in lesion segmentation (Dice Score, Hausdorff distance) as well as lesion detection (lesion-level F1 score) as compared to state-of-the-art longitudinal and single timepoint models across two datasets. Our code is made publicly available at: ***/MIC-DKFZ/ Longitudinal-Difference-Weighting. © 2024, CC BY.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Risk-based decision making: estimands for sequential prediction under interventions

arXiv

引用

arXiv 2023年

作者： Luijken, Kim Morzywolek, Pawel van Amsterdam, Wouter Cinà, Giovanni Hoogland, Jeroen Keogh, Ruth Krijthe, Jesse Magliacane, Sara van Ommen, Thijs Peek, Niels Putter, Hein van Smeden, Maarten Sperrin, Matthew Wang, Junfeng Weir, Daniala Didelez, Vanessa van Geloven, Nan Department of Epidemiology Julius Center for Health Sciences and Primary Care University Medical Center Utrecht Utrecht Netherlands Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent Belgium Department of Statistics University of Washington Seattle United States Department of Medical Informatics Amsterdam University Medical Centers Amsterdam Netherlands Institute for Logic Language and Computation University of Amsterdam Amsterdam Netherlands Pacmed Amsterdam Netherlands Department of Epidemiology and Data Science Amsterdam University Medical Centers Amsterdam Netherlands Department of Medical Statistics London School of Hygiene & Tropical Medicine Keppel Street London United Kingdom Pattern Recognition and Bio-Informatics Group EEMCS Delft University of Technology Delft Netherlands Amsterdam Machine Learning Lab University of Amsterdam Amsterdam Netherlands Department of Information and Computing Sciences Utrecht University Utrecht Netherlands Division of Informatics Imaging and Data Science Faculty of Biology Medicine and Health University of Manchester Manchester Academic Health Science Centre Manchester United Kingdom Department of Biomedical Data Sciences Leiden University Medical Center Leiden Netherlands Division of Pharmacoepidemiology and Clinical Pharmacology Department of Pharmaceutical Sciences Utrecht University Utrecht Netherlands Department of Biometry and Data Management Leibniz Institute for Prevention Research Epidemiology - BIPS Bremen Germany Faculty of Mathematics/Computer Science University of Bremen Bremen Germany

Prediction models are used amongst others to inform medical decisions on interventions. Typically, individuals with high risks of adverse outcomes are advised to undergo an intervention while those at low risk are advised to refrain from it. Standard prediction models do not always provide risks that are relevant to inform such decisions: e.g., an individual may be estimated to be at low risk because similar individuals in the past received an intervention which lowered their risk. Therefore, prediction models supporting decisions should target risks belonging to defined intervention strategies. Previous works on prediction under interventions assumed that the prediction model was used only at one time point to make an intervention decision. In clinical practice, intervention decisions are rarely made only once: they might be repeated, deferred and re-evaluated. This requires estimated risks under interventions that can be reconsidered at several potential decision moments. In the current work, we highlight key considerations for formulating estimands in sequential prediction under interventions that can inform such intervention decisions. We illustrate these considerations by giving examples of estimands for a case study about choosing between vaginal delivery and cesarean section for women giving birth. Our formalization of prediction tasks in a sequential, causal, and estimand context provides guidance for future studies to ensure that the right question is answered and appropriate causal estimation approaches are chosen to develop sequential prediction models that can inform intervention decisions. © 2023, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Entanglement-enabled quantum kernels for enhanced feature mapping

APL Quantum

引用

APL Quantum 2025年第1期2卷

作者： Anand Babu Saurabh G. Ghatnekar Amit Saxena Dipankar Mandal Quantum Materials and Devices Unit Institute of Nano Science and Technology Knowledge City Sector 81 Mohali 140306 India School of Artificial Intelligence and Data Science Indian Institute of Technology Karwar Jodhpur 342030 India Artificial Intelligence and Quantum Technology Group Centre for Development of Advanced Computing (C-DAC) Pune India

Classical machine learning, extensively utilized across diverse domains, faces limitations in speed, efficiency, parallelism, and processing of complex datasets. In contrast, quantum machine learning algorithms offer significant advantages, including exponentially faster computations, enhanced data handling capabilities, inherent parallelism, and improved optimization for complex problems. In this study, we used the entanglement enhanced quantum kernel in a quantum support vector machine to train complex respiratory datasets. Compared to classical algorithms, our findings reveal that quantum support vector machine (QSVM) performs better with higher accuracy (45%) for complex respiratory datasets while maintaining comparable performance with linear datasets in contrast to their classical counterparts executed on a 2-qubit system. Through our study, we investigate the efficacy of the QSVM-Kernel algorithm in harnessing the enhanced dimensionality of the quantum Hilbert space for effectively training complex datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning Embeddings for Image Clustering: An Empirical Study of Triplet Loss Approaches

arXiv

引用

arXiv 2020年

作者： Ho, Kalun Keuper, Janis Pfreundt, Franz-Josef Keuper, Margret Competence Center High Performance Computing Fraunhofer ITWM Kaiserslautern Germany Offenburg University Germany Data and Web Science Group University of Mannheim Germany

—In this work, we evaluate two different image clustering objectives, k-means clustering and correlation clustering, in the context of Triplet Loss induced feature space embeddings. Specifically, we train a convolutional neural network to learn discriminative features by optimizing two popular versions of the Triplet Loss in order to study their clustering properties under the assumption of noisy labels. Additionally, we propose a new, simple Triplet Loss formulation, which shows desirable properties with respect to formal clustering objectives and outperforms the existing methods. We evaluate all three Triplet loss formulations for K-means and correlation clustering on the CIFAR-10 image classification dataset. Copyright © 2020, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

SIDE-real: Supernova Ia Dust Extinction with truncated marginal neural ratio estimation applied to real data

arXiv

引用

arXiv 2024年

作者： Karchev, Konstantin Grayling, Matthew Boyd, Benjamin M. Trotta, Roberto Mandel, Kaisey S. Weniger, Christoph Via Bonomea 265 TriesteI-34136 Italy Institute of Astronomy Kavli Institute for Cosmology Madingley Road CambridgeCB3 0HA United Kingdom Astrophysics Group Physics Department Blackett Lab Imperial College London Prince Consort Road LondonSW7 2AZ United Kingdom INFN - National Institute for Nuclear Physics Via Valerio 2 TriesteI-34127 Italy Italian Research Center on High-Performance Computing Big Data and Quantum Computing Via Magnanelli 2 BO Casalecchio di RenoI-40033 Italy Statistical Laboratory DPMMS University of Cambridge Wilberforce Road CambridgeCB3 0WB United Kingdom University of Amsterdam Science Park 904 AmsterdamNL-1098 XH Netherlands

We present the first fully simulation-based hierarchical analysis of the light curves of a population of low-redshift type Ia supernovæ (SNæ Ia). Our hardware-accelerated forward model, released in the Python package slicsim, includes stochastic variations of each SN's spectral flux distribution (based on the pre-trained BayeSN model), extinction from dust in the host and in the Milky Way, redshift, and realistic instrumental noise. By utilizing truncated marginal neural ratio estimation (TMNRE), a neural network-enabled simulation-based inference technique, we implicitly marginalize over 4000 latent variables (for a set of ≈100 SNæ Ia) to efficiently infer SN Ia absolute magnitudes and host-galaxy dust properties at the population level while also constraining the parameters of individual objects. Amortization of the inference procedure allows us to obtain coverage guarantees for our results through Bayesian validation and frequentist calibration. Furthermore, we show a detailed comparison to full likelihood-based inference, implemented through Hamiltonian Monte Carlo, on simulated data and then apply TMNRE to the light curves of 86 SNæ Ia from the Carnegie Supernova Project, deriving marginal posteriors in excellent agreement with previous work. Given its ability to accommodate arbitrarily complex extensions to the forward model, e.g. different populations based on host properties, redshift evolution, complicated photometric redshift estimates, selection effects, and non-Ia contamination, without significant modifications to the inference procedure, TMNRE has the potential to become the tool of choice for cosmological parameter inference from future, large SN Ia samples. © 2024, CC BY.

关键词： Supernovae

来源：评论

学校读者我要写书评

暂无评论

Improved Fitness Dependent Optimizer for Solving Economic Load Dispatch Problem

arXiv

引用

arXiv 2022年

作者： Tahir, Barzan Hussein Rashid, Tarik A. Rauf, Hafiz Tayyab Bacanin, Nebojsa Chhabra, Amit Vimal, S. Yaseen, Zaher Mundher Department of Computer Science and Engineering University of Kurdistan Helwer Erbil Iraq Centre for Smart Systems AI and Cybersecurity Staffordshire University Stoke-on-Trent United Kingdom Singidunum University Danijelova 32 Belgrade11000 Serbia Department of Computer Engineering and Technology Guru Nanak Dev University Amritsar India Department of Artificial Intelligence and Data Science Ramco Institute of Technology North Venganallur Village Virudhunagar District Tamilnadu Rajapalayam626 117 India Department of Earth Sciences and Environment Faculty of Science and Technology Universiti Kebangsaan Malaysia Selangor Bangi43600 Malaysia USQ's Advanced Data Analytics Research Group School of Mathematics Physics and Computing University of Southern Queensland QLD4350 Australia New era and Development in Civil Engineering Research Group Scientific Research Center Al-Ayen University Thi-Qar64001 Iraq

Economic Load Dispatch depicts a fundamental role in the operation of power systems, as it decreases the environmental load, minimizes the operating cost, and preserves energy resources. The optimal solution to Economic Load Dispatch problems and various constraints can be obtained by evolving several evolutionary and swarm-based algorithms. The major drawback to swarm-based algorithms is premature convergence towards an optimal solution. Fitness Dependent Optimizer is a novel optimization algorithm stimulated by the decision-making and reproductive process of bee swarming. Fitness Dependent Optimizer (FDO) examines the search spaces based on the searching approach of Particle Swarm Optimization. To calculate the pace, the fitness function is utilized to generate weights that direct the search agents in the phases of exploitation and exploration. In this research, the authors have carried out Fitness Dependent Optimizer to solve the Economic Load Dispatch problem by reducing fuel cost, emission allocation, and transmission loss. Moreover, the authors have enhanced a novel variant of Fitness Dependent Optimizer, which incorporates novel population initialization techniques and dynamically employed sine maps to select the weight factor for Fitness Dependent Optimizer. The enhanced population initialization approach incorporates a quasi-random Sabol sequence to generate the initial solution in the multi-dimensional search space. A standard 24-unit system is employed for experimental evaluation with different power demands. Empirical results obtained using the enhanced variant of the Fitness Dependent Optimizer demonstrate superior performance in terms of low transmission loss, low fuel cost, and low emission allocation compared to the conventional Fitness Dependent Optimizer. The experimental study obtained 7.94E-12, the lowest transmission loss using the enhanced Fitness Dependent Optimizer. Correspondingly, various standard estimations are used to prove the stability

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Delayed Memory Unit: Modelling Temporal Dependency Through Delay Gate

引用

IEEE Transactions on Neural Networks and Learning Systems 2023年第6期36卷 10808-10818页

作者： Pengfei Sun Jibin Wu Malu Zhang Paul Devos Dick Botteldooren Department of Information Technology WAVES Research Group Ghent University Ghent Belgium Department of Data Science and Artificial Intelligence Department of Computing The Hong Kong Polytechnic University Hong Kong SAR China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

Recurrent Neural Networks (RNNs) are renowned for their adeptness in modeling temporal dependencies, a trait that has driven their widespread adoption for sequential data processing. Nevertheless, vanilla RNNs are confronted with the well-known issue of gradient vanishing and exploding, posing a significant challenge for learning and establishing long-range dependencies. Additionally, gated RNNs tend to be over-parameterized, resulting in poor network generalization. To address these challenges, we propose a novel Delayed Memory Unit (DMU) in this paper, wherein a delay line structure, coupled with delay gates, is introduced to facilitate temporal interaction and temporal credit assignment, so as to enhance the temporal modeling capabilities of vanilla RNNs. Particularly, the DMU is designed to directly distribute the input information to the optimal time instant in the future, rather than aggregating and redistributing it over time through intricate network dynamics. Our proposed DMU demonstrates superior temporal modeling capabilities across a broad range of sequential modeling tasks, utilizing considerably fewer parameters than other state-of-the-art gated RNN models in applications such as speech recognition, radar gesture recognition, ECG waveform segmentation, and permuted sequential image classification.

关键词： Logic gates Delays Delay lines Recurrent neural networks Long short term memory Computational modeling Computational efficiency Transformers Sun Speech recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：