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

DMFVAE:miRNA-disease associations prediction based on deep matrix factorization method with variational autoencoder

Frontiers of computer Science 2024年第6期18卷 259-270页

作者： Pijing WEI Qianqian WANG Zhen GAO Ruifen CAO Chunhou ZHENG Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China

MicroRNAs(miRNAs)are closely related to numerous complex human diseases,therefore,exploring miRNA-disease associations(MDAs)can help people gain a better understanding of complex disease *** increasing number of computational methods have been developed to predict ***,the sparsity of the MDAs may hinder the performance of many *** addition,many methods fail to capture the nonlinear relationships of miRNA-disease network and inadequately leverage the features of network and neighbor *** this study,we propose a deep matrix factorization model with variational autoencoder(DMFVAE)to predict potential *** first decomposes the original association matrix and the enhanced association matrix,in which the enhanced association matrix is enhanced by self-adjusting the nearest neighbor method,to obtain sparse vectors and dense vectors,***,the variational encoder is employed to obtain the nonlinear latent vectors of miRNA and disease for the sparse vectors,and meanwhile,node2vec is used to obtain the network structure embedding vectors of miRNA and disease for the dense ***,sample features are acquired by combining the latent vectors and network structure embedding vectors,and the final prediction is implemented by convolutional neural network with channel *** evaluate the performance of DMFVAE,we conduct five-fold cross validation on the HMDD v2.0 and HMDD v3.2 datasets and the results show that DMFVAE performs ***,case studies on lung neoplasms,colon neoplasms,and esophageal neoplasms confirm the ability of DMFVAE in identifying potential miRNAs for human diseases.

关键词： miRNA-disease association deep matrix factorization self-adjusted nearest neighbor variational encoder network structure

来源：评论

学校读者我要写书评

暂无评论

Degradation-Trend-Aware Deep Neural Network with Attention Mechanism for Bearing Remaining Useful Life Prediction

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2997-3011页

作者： Liu, Yongkang Pan, Donghui Zhang, Haifeng Zhong, Kai Anhui University Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education School of Mathematical Sciences Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China

Remaining useful life (RUL) prediction of bearings has extraordinary significance for prognostics and health management (PHM) of rotating machinery. RUL prediction approaches based on deep learning have been dedicated to finding a nonlinear mapping relationship between nonstationary monitoring data and RUL. However, most existing approaches pay little attention to the degradation trend of diverse health stages of bearing and lack the discriminative power of crucial degradation features, resulting in the loss of some important information associated with RUL. To address this challenge, this article proposes a novel RUL prediction framework based on degradation-trend-aware deep neural network with attention mechanism (DTADAN). First the multidirection features with evident degradation trend are extracted via the analysis of bearing vibration signal from both time-domain and time-frequency domain. Next, the deep neural network architecture with attention mechanism is utilized to adaptively learn the critical degradation features beneficial for RUL prediction. Distinct from the existing approaches, the proposed framework is able to dynamically extract key degradation features of the bearing including degradation trend information and effectively fuse multidirection information to improve RUL prediction accuracy. The performance of the proposed approach is evaluated via case studies on XJTU-SY bearing dataset and PRONOSTIA bearing dataset. Compared with other state-of-the-art approaches, the proposed framework has better predictive accuracy and robustness. Additionally, interpretable analysis is provided to reveal the process of model learning and data characteristics, and the analysis results are helpful in guiding model learning. © 2020 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Dual Averaging for Distributed Unbalanced Optimization with Delayed Information

引用

IEEE Transactions on signal and Information processing over Networks 2025年 11卷 366-377页

作者： Huang, Qing Fan, Yuan Cheng, Songsong Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electrical Engineering and Automation Anhui Hefei230601 China

In this paper, we study a category of distributed constrained optimization problems where each agent has access to local information, communicates with its neighbors, and cooperatively minimizes the aggregated cost functions over time-varying unbalanced graphs. To address the considered problems, we propose a distributed dual averaging algorithm based on a row-stochastic weighted matrix (DDAR), which improves the robustness of network topology compared to conventional push-sum algorithms. Moreover, we develop a modified version of DDAR with delayed information (DDARD), which considers the delays of both network communication and gradient calculation, enhancing the algorithm's flexibility in communication and iteration. Our analysis demonstrates that the DDAR and DDARD achieve the optimal value at rates of O(N/(1-λ)√T) and O(τ2N/(1-λ}})√T}), respectively. Finally, the theoretical results are confirmed by simulation on a logistic regression problem. © 2015 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks

引用

CAAI Transactions on Intelligence Technology 2023年第3期8卷 893-913页

作者： Lei Zhang Yutong Liu Haipeng Yang Fan Cheng Qi Liu Xingyi Zhang Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Intelligent Computing and Signal Processing of Ministry of EducationSchool of Computer Science and TechnologyAnhui UniversityHefeiChina School of Computer Science and Technology University of Science and Technology of ChinaHefeiChina

Influence maximization,whose aim is to maximise the expected number of influenced nodes by selecting a seed set of k influential nodes from a social network,has many applications such as goods advertising and rumour *** the existing influence maximization methods,the community‐based ones can achieve a good balance between effectiveness and ***,this kind of algorithm usually utilise the network community structures by viewing each node as a non‐overlapping *** fact,many nodes in social networks are overlapping ones,which play more important role in influence *** this end,an overlapping community‐based particle swarm opti-mization algorithm named OCPSO for influence maximization in social networks,which can make full use of overlapping nodes,non‐overlapping nodes,and their interactive information is ***,an overlapping community detection algorithm is used to obtain the information of overlapping community structures,based on which three novel evolutionary strategies,such as initialisation,mutation,and local search are designed in OCPSO for better finding influential *** results in terms of influence spread and running time on nine real‐world social networks demonstrate that the proposed OCPSO is competitive and promising comparing to several state‐of‐the‐arts(***,CMA‐IM,CIM,CDH‐SHRINK,CNCG,and CFIN).

关键词： computational intelligence data mining social network

来源：评论

学校读者我要写书评

暂无评论

Dependable Pipeline Detection algorithms for GPRs in Obscuration Environments 7

Dependable Pipeline Detection algorithms for GPRs in Obscura...

引用

7th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2024

作者： Zhou, Hongyu Xu, Guanghui Li, Yingsong Huang, ZhiXiang Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China

ISBN: (纸本)9798350384437

We propose a robust pipeline detection algorithm for obscuration environments, which includes two improvements: a pre-processing method called the Regional Adaptive Thresh-olding Algorithm (RATA) and a novel clustering method based on trend analysis and symmetric matching called as Symmetry Matching Clustering Algorithm (SMCA). This approach is highly effective in extracting targets from low-intensity regions and has been validated through simulation experiments. The gotten results demonstrate significant enhancements in the accuracy and reliability of underground pipeline detection in obscuration environments. Comparative analysis shows that, in some aspects, the proposed method outperforms existing algorithms. © 2024 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Kernel Weibull M-Transform Least Mean Square Algorithm 12

Kernel Weibull M-Transform Least Mean Square Algorithm

引用

12th IEEE International Conference on computer Science and Network Technology, ICCSNT 2024

作者： Bi, Chenchong Miao, Yongchun Li, Liping Li, Yingsong Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China

ISBN: (纸本)9798350350791

The paper introduces a Kernel Weibull M-Transform Least-Mean Square (LMS) (KWMLMS) algorithm aimed to enhance filtering performance for a nonlinear system. By incorporating the Weibull M-Transformation into the cost function of the Kernel LMS (KLMS) algorithm, a weighting updated rule is gotten. Simulation experiments conducted for nonlinear-system identification under impulse noise conditions demonstrate that the created KWMLMS algorithm achieves significantly faster convergence compared to existing methods, indicating its superiority in dealing with impulsive-noises. © 2024 IEEE.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

Linear Subspace Surrogate Modeling for Large-Scale Expensive Single/Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2023年第3期29卷 1-1页

作者： Si, Langchun Zhang, Xingyi Tian, Ye Yang, Shangshang Zhang, Limiao Jin, Yaochu School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China School of Artificial Intelligence Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei China Faculty of Technology Bielefeld University Bielefeld Germany

Despite that the surrogate-assisted evolutionary algorithms have achieved great success in addressing expensive optimization problems, they still suffer from stiff challenges when the number of dimensions of problems becomes large. The primary reason lies in that it is very hard to build an acceptable surrogate model in the high-dimensional search space with small amounts of evaluated historical data in evolution. To tackle this issue, we suggest an effective surrogate modeling method for large-scale expensive optimization in this paper, where the models are built on a number of linear subspaces instead of the original search space. Specifically, a linear subspace is constructed by a pair of points/solutions which are generated based on the set of elite solutions. For each linear subspace, several historical solutions are first associated according to their distance to the linear subspace, and then a surrogate model is trained by the associated solutions and used to evaluate the offspring. To ensure the exploration and exploitation capacity of the proposed method, these linear subspaces and the surrogate models are updated after a few iterations. Experimental results on CEC’2010 and CEC’2013 single-objective optimization problems with up to 1500 decision variables show that the proposed algorithm is superior over six comparison algorithms. Moreover, we also extend the proposed algorithm to multi-objective optimization problems and verified its competitiveness on problems with up to 1500 decision variables. IEEE

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Chinese Named Entity Recognition Augmented with Lexicon Memory

引用

Journal of computer Science & Technology 2023年第5期38卷 1021-1035页

作者：周奕郑骁庆黄萱菁 School of Computer Science Fudan UniversityShanghai 200438China Shanghai Key Laboratory of Intelligent Information Processing Shanghai 200438China

Inspired by the concept of content-addressable retrieval from cognitive science,we propose a novel fragment-based Chinese named entity recognition(NER)model augmented with a lexicon-based memory in which both character-level and word-level features are combined to generate better feature representations for possible entity *** that the boundary information of entity names is particularly useful to locate and classify them into pre-defined categories,position-dependent features,such as prefix and suffix,are introduced and taken into account for NER tasks in the form of distributed *** lexicon-based memory is built to help generate such position-dependent features and deal with the problem of out-of-vocabulary *** results show that the proposed model,called LEMON,achieved state-of-the-art performance with an increase in the Fl-score up to 3.2%over the state-of-the-art models on four different widely-used NER datasets.

关键词： named entity recognition(NER) lexicon-based memory content-addressable retrieval position-dependent feature neural network

来源：评论

学校读者我要写书评

暂无评论

A method of embedding a high-resolution image into a large field-of-view image

引用

Multimedia Tools and Applications 2025年第14期84卷 13037-13056页

作者： Dong, Yanmei Pei, Mingtao Jia, Yunde Key Laboratory of Intelligent Information Processing and Graph Processing Tus College of Digit Guangxi University of Science and Technology Liuzhou545006 China Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing100081 China

Images captured by wide-angle cameras or fisheye cameras are with large Field-of-View (FOV) but low resolution, while images captured by conventional cameras are with high-resolution but limited FOV. To handle this contradiction, in this paper, we propose to improve the resolution of a large FOV image by embedding a high-resolution image into it. We present an image embedding method based on non-rigid transformations and mesh optimization. Without any radial distortion correction on large FOV images, we utilize non-rigid transformations to model the mathematical transformation relationship between the high-resolution image and the large FOV image. Meanwhile, we exploit mesh optimization to generate evenly distributed control points for maintaining the shape and content of the large FOV image. To verify the effectiveness of the proposed method, we capture some image pairs from a conventional camera and a large FOV camera, and exploit several classic image alignment methods to implement four baseline methods. The experimental results show that our method preserves the shape and content of the original FOV image from 58% to 82%, which significantly outperforms all baseline methods. The results indicate that the proposed method can effectively embed a high-resolution image into a large FOV image as well as preserve the shape and content of the large FOV image. In other words, the resolution of a large FOV image can be improved via high-resolution image embedding. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Radiomics Feature Selection Method Based on Frequency Iteration and Multi-Supervised Training Mode

引用

computers, Materials & Continua 2024年第5期79卷 2277-2293页

作者： Zhigao Zeng Aoting Tang Shengqiu Yi Xinpan Yuan Yanhui Zhu School of Computer Hunan University of TechnologyZhuzhou412007China Hunan Key Laboratory of Intelligent Information Perception and Processing Technology Zhuzhou412007China

Radiomics is a non-invasive method for extracting quantitative and higher-dimensional features from medical images for *** has received great attention due to its huge application prospects in recent *** can know that the number of features selected by the existing radiomics feature selectionmethods is basically about *** this paper,a heuristic feature selection method based on frequency iteration and multiple supervised training mode is *** on the combination between features,it decomposes all features layer by layer to select the optimal features for each layer,then fuses the optimal features to form a local optimal group layer by layer and iterates to the global optimal combination *** with the currentmethod with the best prediction performance in the three data sets,thismethod proposed in this paper can reduce the number of features fromabout ten to about three without losing classification accuracy and even significantly improving classification *** proposed method has better interpretability and generalization ability,which gives it great potential in the feature selection of radiomics.

关键词： Radiomics feature selection machine learning metaheuristic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：