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

Optimal partition algorithm of RBF neural network and its applications to stock price prediction

Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence 2005年第3期18卷 374-379页

作者： Sun, Yan-Feng Liang, Yan-Chun Zhang, Wen-Li Lu, Ying-Hua Key Laboratory for Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Department of Computer Science Northeast Normal University Changchun 130024 China

The optimal partition algorithm (OPA) is applied to the training of parameters in the radial basis function (RBF) neural network. The appropriate modification for the OPA is performed according to the characteristics of the RBF neural network. The approach for determining the centers and widths of the clustering is added in the modified OPA and applied to choose the centers and widths of the neural network. A method for adjusting the structure of the neural network dynamically is presented by using the difference of the objective functions of the clustering. Thus it is realized to select the number of the hidden nodes adaptively. Simulation results of the stock price prediction demonstrate the effectiveness of the proposed approach. Comparisons with traditional algorithms show that the proposed OPA method possesses obvious advantages in the precision of forecasting, generalization, and forecasting trends. Simulations also show that the algorithm combining the OPA with the orthogonal least squares (OLS) possesses more superior performance in the rightness of forecasting trends.

关键词： Optimal partition algorithm (OPA) Ordered sample Radial basis function (RBF) neural network Stock price prediction

来源：评论

学校读者我要写书评

暂无评论

A Sustainable City Planning Algorithm Based on TLBO and Local Search

引用

IOP Conference Series: Materials Science and engineering 2017年第1期242卷

作者： Ke Zhang Li Lin Xuanxuan Huang Yiming Liu Yonggang Zhang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering (Jilin University) Ministry of Education Changchun 130012 China

Nowadays, how to design a city with more sustainable features has become a center problem in the field of social development, meanwhile it has provided a broad stage for the application of artificial intelligence theories and methods. Because the design of sustainable city is essentially a constraint optimization problem, the swarm intelligence algorithm of extensive research has become a natural candidate for solving the problem. TLBO (Teaching-Learning-Based Optimization) algorithm is a new swarm intelligence algorithm. Its inspiration comes from the 'teaching' and 'learning' behavior of teaching class in the life. The evolution of the population is realized by simulating the 'teaching' of the teacher and the student 'learning' from each other, with features of less parameters, efficient, simple thinking, easy to achieve and so on. It has been successfully applied to scheduling, planning, configuration and other fields, which achieved a good effect and has been paid more and more attention by artificial intelligence researchers. Based on the classical TLBO algorithm, we propose a TLBO_LS algorithm combined with local search. We design and implement the random generation algorithm and evaluation model of urban planning problem. The experiments on the small and medium-sized random generation problem showed that our proposed algorithm has obvious advantages over DE algorithm and classical TLBO algorithm in terms of convergence speed and solution quality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Multi-label Deep Learning for Gene Function Annotation in Cancer Pathways

引用

Scientific reports 2018年第1期8卷 8995页

作者： Renchu Guan Xu Wang Mary Qu Yang Yu Zhang Fengfeng Zhou Chen Yang Yanchun Liang Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun 130012 China. MidSouth Bioinformatics Center and Joint Bioinformatics Ph.D. Program of University of Arkansas at Little Rock and Univ. of Arkansas Medical Sciences Little Rock AR 72204 USA. Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Beijing 100093 China. College of Earth Sciences Jilin University Changchun 130061 China. yangc616@***. Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun 130012 China. ycliang@***. Zhuhai Laboratory of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai 519041 China. ycliang@***.

A correction to this article has been published and is linked from the HTML and PDF versions of this paper. The error has not been fixed in the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic watermarking scheme based on the Shamir threshold and branch structure

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2008年第SUPPL. 2期38卷 221-225页

作者： Yin, Ke Wang, Zhi-Quan Zhu, Jian-Qi Dong, Gang School of Automation Nanjing University of Science and Technology Nanjing 210094 China Electric Power Simulation and Control Engineering Center Nanjing Institute of Technology Nanjing 211167 China Key Laboratory of Symbol Computation and Knowledge Engineer College of Computer Science and Technology Jilin University Changchun 130012 China

A novel dynamic software watermark scheme based on the Shamir threshold and branch structure is presented. First, we split the watermark into a set of shares using the Shamir threshold scheme. Second, these values are encrypted with the DES block cipher that forms the watermark shares to be embedded into different methods of program according to the dynamic behavior of the branch structure. Our scheme can withstand most semantics-preserving attacks and can retrieve the original watermark based on partial information. Simulation tests show that our scheme is very robust, stealthy and has a high price performance rate compared with other methods.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Surrogate Model Based Genetic Algorithm for Complex Problem Solving

引用

Journal of Physics: Conference Series 2020年第1期1646卷

作者： Ying Pei Hao Gao Xiaosong Han The College of Information Engineering Changchun University of Finance and Economics Changchun 130122 China Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology College of Software Jilin University Changchun 130012 China

It is well known that when the fitness function is relatively complex, the optimization time cost of the genetic algorithm will be extremely huge. To address this issue, the surrogate model was employed to predict the fitness value of the optimization problem, to reduce the number of actual calculated fitness values. In this paper, BP neural network, the least square method and support vector machine were fused in the genetic algorithm to evaluate partial individuals' fitness. Sufficient benchmark numerical experiments were conducted, and the results proved that the strategy could reduce the calculating counts of fitness function on similar accuracy basis compared with simple genetic algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient and effective automatic image annotation using positive and negative example images

引用

ICIC Express Letters 2011年第8 B期5卷 2927-2932页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Bao, Cuizhu Dong, Yuying Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University No. 2699 Qianjin Avenue Changchun 130012 China Institute of Computer Graphics and Image Processing Dalian Nationalities University No. 18 Liaohe Road Eco. and Tech. Dev. Zone Dalian 116600 China College of Computer Science and Engineering Dalian Nationalities University No. 18 Liaohe Road Eco. and Tech. Dev. Zone Dalian 116600 China College of Life Science Dalian Nationalities University No. 18 Liaohe Road Eco. and Tech. Dev. Zone Dalian 116600 China

Automatic image annotation is an active topic and difficult task in computer vision domain, which has attracted more and more researchers' attention. Many approaches have been proposed to automatically annotate images. To improve the annotation quality, most of them have profound principlessophisticated modelsand high time complexities. How to efficiently annotate image is becoming one key issue in the field of computer vision. We propose a very efficient and effective approach called keyword vector classification approach, whose model is very simple. Experiments on Corel5K dataset show that the annotation performance of the our proposed approach is almost four times better than translation model and twice better than CMRM (in terms of precision, recall and F1) while the time cost of ours surprisingly decreases. In addition, to our knowledge, our proposed approach outperforms most of existing ones in terms of N+. © 2011 ISSN 1881-803X.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Design of a Daily Brief Business Report Generator based on Web Scraping with KNN Algorithm

引用

Journal of Physics: Conference Series 2019年第5期1345卷

作者： Gang Lin Yanchun Liang Xiaoyang Fu Guangshun Chen Shaocan Cai Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Department of Computer Science and Technology School of Computer Science Zhuhai 519041 Guangdong China Department of Computer Science and Technology School of Computer Science Zhuhai College of Jilin University Zhuhai 519041 Guangdong China

In order to generate a report for an enterprise where there is neither the API supporting from their existing website systems nor the granted database access rights approval, a daily business report generator system based on web scraping with k nearest neighbor (kNN) classification algorithm is proposed in this paper. It covers the web crawler technology that is to access existing website system and extract business data. The kNN algorithm is applied to identify the verification code on the login page, and the brief daily report generating in a spread-sheet style grid. Compared with some OCR engine for image recognition, the system in Python can automatically generate the brief daily business reports by the kNN algorithm, which is better than some library with default training set on validating the verification code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Catalog segmentation with double constraints in business” [Pattern Recognition Letters 30 (4) (2009) 440–448]

引用

Pattern Recognition Letters 2009年第15期30卷 1440-1440页

作者： Xiujuan Xu Yu Liu Zhe Wang Chunguang Zhou Yanchun Liang College of Computer Science Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China School of Software Dalian University of Technology Dalian Economic and Technological Development Zone Liaoning Number 8 Road Dalian 116620 China

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：