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

SSRN 2022年

作者： Li, Ying Sun, Hang Fang, Wensi Ma, Qin Han, Siyu Wang-Sattler, Rui Du, Wei Yu, Qiong Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Qianjin Street Jilin Changchun130012 China Department of Biomedical Informatics Ohio State University Lane Ave ColumbusOH43210 United States TUM School of Medicine Technical University of Munich Ismaninger Straße 22 Bavaria Munich81675 Germany Helmholtz Center Munich German Research Center for Environmental Health Ingolstadter Landstraße 1 Bavaria Neuherberg85764 Germany Department of Epidemiology and Biostatistics School of public health Jilin University Qianjin Street Jilin Changchun130012 China

For many classification tasks, only experimentally validated positive samples are available, and experimentally validated negative samples are not recorded. The lack of negative samples poses a great challenge for using supervised machine learning. To address this problem, we propose a novel deep reinforcement learning based model to screen reliable negative samples from unlabeled samples, named SURE. SURE has two modules: sample selector and sample inspector. The sample selector screens reliable negative samples from unlabeled samples by two reinforcement strategies. The sample inspector classifies samples and provides rewards to the sample selector. In this paper, we focus on one popular issue in the field of bioinformatics: the ncRNA-protein interaction (NPI) prediction task, which lacks reliable negative samples. Thirty datasets for NPI prediction are used to test the screening effect of SURE. The Experimental results show that our model has a robust negative sample screening capability and is superior to all outstanding sample screening methods used in the NPI prediction task. In addition, we refine 5 NPI datasets containing reliable negative samples screened by SURE, and a webserver (***/sure) is available offering the NPI prediction refined by SURE. © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Affine-periodic solutions by averaging methods

引用

Science China Mathematics 2018年第3期61卷 439-452页

作者： Jiamin Xing Xue Yang Yong Li College of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Mathematics and Statistics Northeast Normal University Center for Mathematics and Interdisciplinary Sciences Northeast Normal University

This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-periodic when Q is an orthogonal matrix. It can be even unbounded but x(t)/|x(t)| is quasi-periodic,like a helical line. for example x(t)=e^(at)(cos ωt, sin ωt), when Q is not an orthogonal matrix. The averaging method of higher order for finding affine-periodic solutions is given by topological degree.

关键词： affine-periodic solutions averaging method topological degree

来源：评论

学校读者我要写书评

暂无评论

Efficient reinforcement learning in continuous state and action spaces with Dyna and policy approximation

引用

Frontiers of Computer Science 2019年第1期13卷 106-126页

作者： Shan ZHONG Quan LIU Zongzhang ZHANG Qiming FU School of Computer Science and Technology Soochow UniversitySuzhou 215000China School of Computer Science and Engineering Changshu Institute of TechnologyChangshu 215500China Jiangsu Province Key Laboratory of Intelligent Building Energy Efficiency Suzhou University of Science and TechnologySuzhou 215006China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210000China College of Electronic &Information Engineering Suzhou University of Science and TechnologySuzhou 215000China

Dyna is an effective reinforcement learning (RL) approach that combines value function evaluation with model ***,existing works on Dyna mostly discuss only its efficiency in RL problems with discrete action *** paper proposes a novel Dyna variant,called Dyna-LSTD-PA,aiming to handle problems with continuous action ***-LSTD-PA stands for Dyna based on least-squares temporal difference (LSTD)and policy ***-LSTD-PA consists of two simultaneous,interacting *** learning process determines the probability distribution over action spaces using the Gaussian distribution;estimates the underlying value function,policy,and model by linear representation;and updates their parameter vectors online by LSTD(,t).The planning process updates the parameter vector of the value function again by using ofttine LSTD(2).Dyna-LSTD-PA also uses the Sherman-Morrison formula to improve the efficiency of LSTD(,t),and weights the parameter vector of the value function to bring the two processes ***,the global error bound is derived by considering approximation,estimation,and model ***,Dyna-LSTD-PA outperforms two representative methods in terms of convergence rate,success rate,and stability performance on four benchmark RL problems.

关键词： problem solving control methods heuristic search methods dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Movie Score Prediction Model Based on Movie Plots

Movie Score Prediction Model Based on Movie Plots

引用

2019国际计算机前沿大会

作者： Hui Xie Haomeng Wang Chen Zhao Zhe Wang College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education (Jilin University)

With the rapid development of the movie industry, it is vital to evaluate and predict a movie's quality. In this paper, a movie score prediction model is proposed based on the movie plots. Movie data was processed with the word2 vec method, and the linear regression model and back propagation neural network algorithm were employed to establish the movie score prediction model. The high-quality classic movie plots of high-scoring movies summed up by big data contributed to a high synthesis of the wonderful content of the *** results show that it is effective in terms of movie evaluation and prediction, and helpful in understanding people's preferences for movie plots.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal control approach to stability criteria on Hill's equations

引用

Applied Mathematics(A Journal of Chinese Universities) 2018年第3期33卷 253-273页

作者： ZU Jian LI Yong School of Mathematics and Statistics & Center for Mathematics and Interdisciplinary Sciences North-east Normal University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University College of Mathematics Jilin University

This paper gives a tutorial on how to prove Lyapunov type criteria by optimal control methods. Firstly, we consider stability criteria on Hill’s equations with nonnegative potential. By optimal control methods developed in 1990s, we obtain several stability criteria including Lyapunov’s criterion, Neǐgauz and Lidskiǐ’s criterion. Secondly, we present stability criteria on Hill’s equations with sign-changing potential in which Brog’s criterion and Krein’s criterion are included.

关键词： stability criteria optimal control method Hill's equation Lyapunov inequality

来源：评论

学校读者我要写书评

暂无评论

Deep neural architecture search with deep graph bayesian optimization

arXiv

引用

arXiv 2019年

作者： Ma, Lizheng Cui, Jiaxu Yang, Bo College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education

Bayesian optimization (BO) is an effective method of finding the global optima of black-box functions. Recently BO has been applied to neural architecture search and shows better performance than pure evolutionary strategies. All these methods adopt Gaussian processes (GPs) as surrogate function, with the handcraft similarity metrics as input. In this work, we propose a Bayesian graph neural network as a new surrogate, which can automatically extract features from deep neural architectures, and use such learned features to fit and characterize black-box objectives and their uncertainty. Based on the new surrogate, we then develop a graph Bayesian optimization framework to address the challenging task of deep neural architecture search. Experiment results show our method significantly outperforms the comparative methods on benchmark tasks. Copyright © 2019, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

High-Resolution Natural Image Matting by Refining Low-resolution Alpha Mattes

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 PP卷 PP页

作者： Xianmin Ye Yihui Liang Mian Tan Fujian Feng Lin Wang Han Huang College of Data Science and Information Engineering Guizhou Minzu University Guiyang China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China School of Computer Science Zhongshan Institute University of Electronic Science and Technology of China Zhongshan China Guizhou Key Laboratory of Pattern Recognition and Intelligent System and the College of Data Science and Information Engineering Guizhou Minzu University Guiyang China School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot (SCUT) MOE of China Guangzhou China Guangdong Engineering Center for Large Model and GenAI Technology Guangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

High-resolution natural image matting plays an important role in image editing, film-making and remote sensing due to its ability of accurately extract the foreground from a natural background. However, due to the complexity brought about by the proliferation of resolution, the existing image matting methods cannot obtain high-quality alpha mattes on high-resolution images in reasonable time. To overcome this challenge, we introduce a high-resolution image matting framework based on alpha matte refinement from low-resolution to high-resolution (HRIMF-AMR). The proposed framework transforms the complex high-resolution image matting problem into low-resolution image matting problem and high-resolution alpha matte refinement problem. While the first problem is solved by adopting an existing image matting method, the latter is addressed by applying the Detail Difference Feature Extractor (DDFE) designed as a part of our work. The DDFE extracts detail difference features from high-resolution images by measuring the image feature difference between high-resolution images and low-resolution images. The low-resolution alpha matte is refined according to the extracted detail difference feature, providing the high-resolution alpha matte. In addition, the Matte Detail Resolution Difference (MDRD) loss is introduced to train the DDFE, which imposes an additional constraint on the extraction of detail difference features with mattes. Experimental results show that integrating HRIMF-AMR significantly enhances the performance of existing matting methods on high-resolution images of Transparent-460 and Alphamatting. Project page: https://***/yexianmin/HRAMR-Matting.

关键词： Feature extraction Image resolution Image color analysis Optimization Remote sensing Clustering algorithms Accuracy Visualization Transforms Training

来源：评论

学校读者我要写书评

暂无评论

Unraveling the Oxidation Behaviors of MXenes in Aqueous Systems by Active-Learning-Potential Molecular-Dynamics Simulation

引用

Angewandte Chemie 2023年第32期135卷

作者： Pengfei Hou Yumiao Tian Prof. Yu Xie Prof. Fei Du Prof. Gang Chen Dr. Aleksandra Vojvodic Prof. Jianzhong Wu Dr. Xing Meng Key Laboratory of Physics and Technology for Advanced Batteries (Ministry of Education) College of Physics Jilin University 130012 Changchun P. R. China Department of Chemical and Biomolecular Engineering University of Pennsylvania PA 19104 Philadelphia USA Department of Chemical and Environmental Engineering University of California CA 92521 Riverside USA Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University 130012 Changchun P. R. China

MXenes are 2D materials with great potential in various applications. However, the degradation of MXenes in humid environments has become a main obstacle in their practical use. Here we combine deep neural networks and an active learning scheme to develop a neural network potential (NNP) for aqueous MXene systems with ab initio precision but low cost. The oxidation behaviors of super large aqueous MXene systems are investigated systematically at nanosecond timescales for the first time. The oxidation process of MXenes is clearly displayed at the atomic level. Free protons and oxides greatly inhibit subsequent oxidation reactions, leading to the degree of oxidation of MXenes to exponentially decay with time, which is consistent with the oxidation rate of MXenes measured experimentally. Importantly, this computational study represents the first exploration of the kinetic process of oxidation of super-sized aqueous MXene systems. It opens a promising avenue for the future development of effective protection strategies aimed at controlling the stability of MXenes.

关键词： MXenes Degradation Neural NetworksActive Learning Oxidation Protection

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems

arXiv

引用

arXiv 2023年

作者： Xiao, Yubin Wang, Di Li, Boyang Chen, Huanhuan Pang, Wei Wu, Xuan Li, Hao Xu, Dong Liang, Yanchun Zhou, You The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China The Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore The School of Computer Science and Engineering Nanyang Technological University 639798 Singapore The School of Computer Science University of Science & Technology of China Hefei230026 China The School of Mathematical and Computer Sciences Heriot-Watt University EdinburghEH14 4AS United Kingdom College of Computer National University of Defense Technology Hunan Changsha410073 China The Department of Electrical Engineering and Computer Science Bond Life Sciences Center University of Missouri Columbia United States The School of Computer Science Zhuhai College of Science and Technology Zhuhai519000 China

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recently, neural networks have gained popularity in this research area because as shown in the literature, they provide strong heuristic solutions to TSPs. Compared to autoregressive neural approaches, non-autoregressive (NAR) networks exploit the inference parallelism to elevate inference speed but suffer from comparatively low solution quality. In this paper, we propose a novel NAR model named NAR4TSP, which incorporates a specially designed architecture and an enhanced reinforcement learning strategy. To the best of our knowledge, NAR4TSP is the first TSP solver that successfully combines RL and NAR networks. The key lies in the incorporation of NAR network output decoding into the training process. NAR4TSP efficiently represents TSP encoded information as rewards and seamlessly integrates it into reinforcement learning strategies, while maintaining consistent TSP sequence constraints during both training and testing phases. Experimental results on both synthetic and real-world TSPs demonstrate that NAR4TSP outperforms five state-of-the-art models in terms of solution quality, inference speed, and generalization to unseen scenarios. Copyright © 2023, The Authors. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Stochastic Variational Inference-Based Parallel and Online Supervised Topic Model for Large-Scale Text Processing

引用

Journal of Computer Science & Technology 2018年第5期33卷 1007-1022页

作者： Yang Li Wen-Zhuo Song Bo Yang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China Aviation University of Air Force Changchun 130062 China

Topic modeling is a mainstream and effective technology to deal with text data, with wide applications in text analysis, natural language, personalized recommendation, computer vision, etc. Among all the known topic models, supervised Latent Dirichlet Allocation （sLDA） is acknowledged as a popular and competitive supervised topic model. How- ever, the gradual increase of the scale of datasets makes sLDA more and more inefficient and time-consuming, and limits its applications in a very narrow range. To solve it, a parallel online sLDA, named PO-sLDA （Parallel and Online sLDA）, is proposed in this study. It uses the stochastic variational inference as the learning method to make the training procedure more rapid and efficient, and a parallel computing mechanism implemented via the MapReduce framework is proposed to promote the capacity of cloud computing and big data processing. The online training capacity supported by PO-sLDA expands the application scope of this approach, making it instrumental for real-life applications with high real-time demand. The validation using two datasets with different sizes shows that the proposed approach has the comparative accuracy as the sLDA and can efficiently accelerate the training procedure. Moreover, its good convergence and online training capacity make it lucrative for the large-scale text data analyzing and processing.

关键词： topic modeling, large-scale text classification, stochastic variational inference, cloud computing online learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：