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

GMFLDA: Improved prediction of IncRNA-disease association via graph convolutional network

IEEE Access 2025年 13卷 85330-85341页

作者： Kim, Kwangsu Ha, Jihwan Pukyong National University Department of Scientific Computing Busan48513 Korea Republic of Pukyong National University Major of Big Data Convergence Division of Data Information Science Busan48513 Korea Republic of

The rapid expansion of diverse networks has created a growing need to integrate multiple heterogeneous structures to effectively capture both inter- and intra-entity relationships. This integration helps preserve the intrinsic meaning of complex biological interactions. Network-based approaches have been highly effective in predicting node labels and uncovering hidden associations between entities. These methods have been widely applied in areas such as user-item recommendations, gene-gene interactions, and lncRNA-disease association prediction. In this study, we present GMFLDA, an advanced machine learning framework for inferring lncRNA-disease associations (LDA) by synergizing graph convolutional networks (GCNs) with deep matrix factorization. Specifically, GCNs are leveraged to extract and encode high-fidelity feature representations of lncRNAs and diseases, while deep matrix factorization, implemented via a multi-layer perceptron, facilitates the discovery of potential disease-associated lncRNAs. Our model exhibits outstanding predictive performance, achieving AUCs of 0.9183 and 0.9057 in leave-one-out and five-fold cross-validation experiments, respectively. Extensive comparative evaluations demonstrate that GMFLDA surpasses four state-of-the-art methods, underscoring its superior predictive capability. We anticipate that GMFLDA will serve as a powerful computational tool for biomarker discovery, significantly accelerating the identification of disease-associated lncRNAs while mitigating the time and cost constraints of traditional wet-lab experiments. © 2013 IEEE.

关键词： Matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Secure and privacy-preserving federated learning-based resource allocation for next generation networks

Secure and privacy-preserving federated learning-based resou...

引用

International Conference on Innovation and Technological Advances for Sustainability, ITAS 2023

作者： Dandoush, Abdulhalim Gouissem, Ala Ciftler, Bekir Sait Division of Information Technology College of Computing and Information Technology University of Doha for Science and Technology Doha Qatar ESME Sduria/L2TI at Sorbonne University Paris Nord France Division of Data Science and Artificial Intelligence College of Computing and Information Technology University of Doha for Science and Technology Doha Qatar

ISBN: (纸本)9781032803722

This paper surveys recent research on federated learning-based resource allocation for next-generation networks in order to identify research gaps and potential future directions. We start by outlining the main challenges and requirements for secure and privacy-preserving resource allocation in these networks. The existing solutions and techniques proposed in the literature are then reviewed. The strengths and limitations of these solutions are analyzed, and trade-offs in terms of security, privacy, efficiency, and scalability are discussed. The research gaps and promising directions for future research are identified, such as integrating multiple solutions (e.g., game theory or optimization techniques with federated learning) and developing new models and algorithms for AI-based resource allocation that address specific challenges and requirements of next-generation networks. The goal is to inspire further research in this critical and rapidly evolving field. © 2025 The Author(s).

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Solving key challenges in collider physics with foundation models

引用

Physical Review D 2025年第5期111卷 L051504-L051504页

作者： Vinicius Mikuni Benjamin Nachman National Energy Research Scientific Computing Center Berkeley Lab Berkeley California 94720 USA Physics Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Berkeley Institute for Data Science University of California Berkeley California 94720 USA

Foundation models are neural networks that are capable of simultaneously solving many problems. Large language foundation models like ChatGPT have revolutionized many aspects of daily life, but their impact for science is not yet clear. In this paper, we use a new foundation model for hadronic jets to solve three key challenges in collider physics. In particular, we show how experiments can (1) save significant computing power when developing reconstruction algorithms, (2) perform a complete uncertainty quantification for high-dimensional measurements, and (3) search for new physics with model agnostic methods using low-level inputs. In each case, there are significant computational or methodological challenges with current methods that limit the science potential of deep learning algorithms. By solving each problem, we take jet foundation models beyond proof-of-principle studies and into the toolkit of practitioners.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust Kernel Sparse Subspace Clustering

Robust Kernel Sparse Subspace Clustering

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Ivica Kopriva Division of Computing and Data Science Rudjer Boskovich Institute Zagreb Croatia

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Kernel methods are widely used in pattern recognition, including subspace clustering (SC). They transform nonlinear problems in the input data space into linear ones in a high-dimensional feature space. This transformation, achieved through the kernel trick, makes computationally tractable nonlinear algorithms possible. However, kernelizing linear algorithms through the kernel trick is infeasible in case of gross sparse corruptions that are modeled by the ℓ 1 -norm of the error term. To address this, we propose, for the first time, a robust kernel sparse SC (RKSSC) algorithm for data with gross sparse corruptions. We validated the proposed approach on two well-known datasets, using the linear robust SSC algorithm and nonlinear (kernel-based) SSC algorithm as baseline models. According to the Wilcoxon test, the RKSSC's algorithm clustering performance is statistically significantly better than baselines.

关键词： Computational modeling Clustering algorithms Signal processing algorithms Transforms Signal processing Pattern recognition Sparse matrices Kernel Speech processing Optimization

来源：评论

学校读者我要写书评

暂无评论

On Error-Based Step Size Control for Discontinuous Galerkin Methods for Compressible Fluid Dynamics

引用

应用数学与计算数学学报 2025年第1期7卷 3-39页

作者： Hendrik Ranocha Andrew R.Winters Hugo Guillermo Castro Lisandro Dalcin Michael Schlottke-Lakemper Gregor J.Gassner Matteo Parsani Applied Mathematics University of HamburgBundesstr.5520146 HamburgGermany Department of Mathematics Applied Mathematics Linköping UniversityLinköpingSweden Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Applied and Computational Mathematics RWTH Aachen UniversityAachenGermany High-Performance Computing Center Stuttgart University of StuttgartStuttgartGermany Department of Mathematics and Computer Science University of CologneCologneGermany Center for Data and Simulation Science University of CologneCologneGermany Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Physical Science and Engineering Division(PSE) King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia

We study a temporal step size control of explicit Runge-Kutta(RK)methods for com-pressible computational fluid dynamics(CFD),including the Navier-Stokes equations and hyperbolic systems of conservation laws such as the Euler *** demonstrate that error-based approaches are convenient in a wide range of applications and compare them to more classical step size control based on a Courant-Friedrichs-Lewy(CFL)*** numerical examples show that the error-based step size control is easy to use,robust,and efficient,e.g.,for(initial)transient periods,complex geometries,nonlinear shock captur-ing approaches,and schemes that use nonlinear entropy *** demonstrate these properties for problems ranging from well-understood academic test cases to industrially relevant large-scale computations with two disjoint code bases,the open source Julia pack-ages *** with *** and the C/Fortran code SSDC based on PETSc.

关键词： Explicit Runge-Kutta(RK)methods Step size control Compressible fluid dynamics Adaptivity in space and time Shock capturing

来源：评论

学校读者我要写书评

暂无评论

data-Adaptive Low-Rank Sparse Subspace Clustering

arXiv

引用

arXiv 2025年

作者： Kopriva, Ivica Division of Computing and Data Science Ruđer Bošković Institute Zagreb Croatia

Low-rank sparse subspace clustering (LRSSC) algorithms built on self-expressive model effectively capture both the global and local structure of the data. However, existing solutions, primarily based on proximal operators associated with Sp / l p , p∈{0, 1/2, 2/3, 1}, norms are not data-adaptive. In this work, we propose an LRSSC algorithm incorporating a data-adaptive surrogate for the S0 / l 0 quasi-norm. We provide a numerical solution for the corresponding proximal operator in cases where an analytical expression is unavailable. The proposed LRSSC algorithm is formulated within the proximal mapping framework, and we present theoretical proof of its global convergence toward a stationary point. We evaluate the performance of the proposed method on three well known datasets, comparing it against LRSSC algorithms constrained by Sp / l p , p∈{0, 1/2, 2/3, 1}, *** Codes 68W05, 68U10, 65Y99 © 2025, CC BY.

关键词： data assimilation

来源：评论

学校读者我要写书评

暂无评论

Fuzzy-Based Optimization Techniques for Segmenting the Tumors in Multimodal MRI Images

引用

Operations Research Forum 2025年第1期6卷 1-27页

作者： Alagarsamy, Saravanan Nagarajan, D. Govindaraj, Vishnuvardhan Department of Information Technology Sri Sivasubramaniya Nadar College of Engineering Rajiv Gandhi Salai (OMR) Tamilnadu Chennai India Department of Mathematics Rajalakshmi Institute of Technology Chennai India Division of Data Science of School of Computing Science and Education VIT Bhopal University Kothrikalan Madhya Pradesh Sehore 466114 India

Accurate brain tumor prediction is essential when approaching the field of health care;wherever accuracy in decision-making is crucial, the issues also need to be resolved right away. Many artificial intelligence and machine learning-based techniques have been developed in the last couple of years in the field of healthcare. The intention of this work is to create an algorithm that combines the features of Crow Search (CS) and Interval Type-II Fuzzy Logic System (IT2FLS) algorithms to distinguish the area of tumor from complex brain tissues. The ability of oncologists to make decisions is critical for any therapy sequence to be successful, and the methodology proposed in the research work considerably influences a conclusion through technology interruption. The suggested approach is flexible enough to work with a diversity of image sequences found in the BRATS Challenge 2020 dataset that presents varying degrees of obstacles, challenges, and difficulties in locating the anomalous regions, and it produces improved demarcation results that have been instinctively evaluated and supported by Dice score (98 ± 1.3), specificity (98 ± 1.4), and sensitivity (98 ± 1.7) as average metrics. The motive of this study is the enhancement of the visual perception of oncologists, which gives them improved insight into and comprehension of the condition of the patient. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2025.

关键词： Crow Search (CS) Interval Type-II Fuzzy Logic System (IT2FLS) Magnetic Resonance Imaging (MRI) Tumor segmentation

来源：评论

学校读者我要写书评

暂无评论

Bayesian classifier based on cancer prognostic markers using accelerated failure time model with frailty effect

引用

Quality and Quantity 2025年 1-27页

作者： Vishwakarma, Gajendra K. Kumari, Pragya Bhattacharjee, Atanu Ong, Seng Huat Department of Mathematics & Computing Indian Institute of Technology Dhanbad Jharkhand Dhanbad 826004 India Division of Population Health and Genomics School of Medicine University of Dundee Dundee United Kingdom Institute of Actuarial Science and Data Analytics UCSI University Kuala Lumpur 56000 Malaysia Institute of Mathematical Sciences University of Malaya Kuala Lumpur 50603 Malaysia

This work presents a Bayesian classifier technique to categorize patients based on predictive biomarkers of time-to-event data utilizing the Accelerated Failure Time (AFT) model incorporating the frailty effect. Before classification, efficient and significant markers from a high-dimensional gene expression dataset need to be identified. Currently, it is an emerging area in oncology. A conventional three-step feature selection approach is introduced to select the most relevant markers from high-dimensional data. A threshold value for each selected marker is obtained using the proposed Bayesian classification procedure incorporating the AFT model with the frailty effect. The frailty effect is incorporated to account for unobserved heterogeneity in the expression values of subjects, allowing for a more accurate investigation of the risk of cancer-related outcomes. A simulation study is performed to validate the proposed classification approach, and the classification’s performance is evaluated using the Brier score, and the result indicates that it is relatively high. Application of the proposed classification technique is provided for two high-dimensional TCGA datasets of lung cancer patients. Our results provide evidence about the effect of classified gene expression values on the survival risk of lung cancer patients. © The Author(s), under exclusive licence to Springer Nature B.V. 2025.

关键词： Accelerated failure time model Bayesian Cancer’s biomarker Classification Survival analysis

来源：评论

学校读者我要写书评

暂无评论

Decoder-Only Image Registration

引用

IEEE Transactions on Medical Imaging 2025年 PP卷 PP页

作者： Jia, Xi Lu, Wenqi Cheng, Xinxing Duan, Jinming University of Birmingham School of Computer Science United Kingdom Manchester Metropolitan University Department of Computing and Mathematics United Kingdom University of Manchester Division of Informatics Imaging and Data Sciences United Kingdom

In unsupervised medical image registration, encoder-decoder architectures are widely used to predict dense, full-resolution displacement fields from paired images. Despite their popularity, we question the necessity of making both the encoder and decoder learnable. To address this, we propose LessNet, a simplified network architecture with only a learnable decoder, while completely omitting a learnable encoder. Instead, LessNet replaces the encoder with simple, handcrafted features, eliminating the need to optimize encoder parameters. This results in a compact, efficient, and decoder-only architecture for 3D medical image registration. We evaluate our decoder-only LessNet on five registration tasks: 1) inter-subject brain registration using the OASIS-1 dataset, 2) atlas-based brain registration using the IXI dataset, 3) cardiac ES-ED registration using the ACDC dataset, 4) inter-subject abdominal MR registration using the CHAOS dataset, and 5) multi-study, multi-site brain registration using images from 13 public datasets. Our results demonstrate that LessNet can effectively and efficiently learn both dense displacement and diffeomorphic deformation fields. Furthermore, our decoder-only LessNet can achieve comparable registration performance to benchmarking methods such as Voxel-Morph and TransMorph, while requiring significantly fewer computational resources. © 1982-2012 IEEE.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

HistoMSC: Density and topology analysis for AI-based visual annotation of histopathology whole slide images

引用

Computers in Biology and Medicine 2025年 190卷 109991-109991页

作者： Ahmad, Zahoor Al-Thelaya, Khaled Alzubaidi, Mahmood Joad, Faaiz Gilal, Nauman Ullah Mifsud, William Boughorbel, Sabri Pintore, Giovanni Gobbetti, Enrico Schneider, Jens Agus, Marco Division of Information and Computing Technology College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation Doha Qatar Kite Pharma Santa MonicaCA United States Visual and Data-intensive Computing CRS4 Italy Qatar Computing Research Institute Hamad Bin Khalifa University Qatar Foundation Doha Qatar

We introduce an end-to-end framework for the automated visual annotation of histopathology whole slide images. Our method integrates deep learning models to achieve precise localization and classification of cell nuclei with spatial data aggregation to extend classes of sparsely distributed nuclei across the entire slide. We introduce a novel and cost-effective approach to localization, leveraging a U-Net architecture and a ResNet-50 backbone. The performance is boosted through color normalization techniques, helping achieve robustness under color variations resulting from diverse scanners and staining reagents. The framework is complemented by a YOLO detection architecture, augmented with generative methods. For classification, we use context patches around each nucleus, fed to various deep architectures. Sparse nuclei-level annotations are then aggregated using kernel density estimation, followed by color-coding and isocontouring. This reduces visual clutter and provides per-pixel probabilities with respect to pathology taxonomies. Finally, we use Morse–Smale theory to generate abstract annotations, highlighting extrema in the density functions and potential spatial interactions in the form of abstract graphs. Thus, our visualization allows for exploration at scales ranging from individual nuclei to the macro-scale. We tested the effectiveness of our framework in an assessment by six pathologists using various neoplastic cases. Our results demonstrate the robustness and usefulness of the proposed framework in aiding histopathologists in their analysis and interpretation of whole slide images. © 2025 The Authors

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：