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

A Sarsa() algorithm based on double-layer fuzzy reasoning

Mathematical Problems in engineering 2013年 2013卷

作者： Liu, Quan Mu, Xiang Huang, Wei Fu, Qiming Zhang, Yonggang School of Computer Science and Technology Soochow University Suzhou Jiangsu 215006 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

Solving reinforcement learning problems in continuous space with function approximation is currently a research hotspot of machine learning. When dealing with the continuous space problems, the classic Q-iteration algorithms based on lookup table or function approximation converge slowly and are difficult to derive a continuous policy. To overcome the above weaknesses, we propose an algorithm named DFR-Sarsa() based on double-layer fuzzy reasoning and prove its convergence. In this algorithm, the first reasoning layer uses fuzzy sets of state to compute continuous actions;the second reasoning layer uses fuzzy sets of action to compute the components of Q-value. Then, these two fuzzy layers are combined to compute the Q-value function of continuous action space. Besides, this algorithm utilizes the membership degrees of activation rules in the two fuzzy reasoning layers to update the eligibility traces. Applying DFR-Sarsa() to the Mountain Car and Cart-pole Balancing problems, experimental results show that the algorithm not only can be used to get a continuous action policy, but also has a better convergence performance. © 2013 Quan Liu et al.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Fold-based meta-analysis: a method for identifying differentially expressed genes in microarray data

引用

Journal of Information and computational Science 2013年第11期10卷 3453-3462页

作者： Tian, Yuan Bai, Tian Liu, Guixia Li, Zhangxiu Wu, Jianan Zhou, Chunguang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China College of Computer Science and Technology Changchun University Changchun 130022 China

The increase of microarray experiments brings a fresh challenge to analyze microarray data across datasets. Several methods have been developed and implemented. But the current tools were either complicated software with inefficiency methods or web applications, among which some were limited to specific data format. In this paper, we propose Fold-based Meta-analysis (FM), a method to identify Differentially Expressed Genes (DEGs) in microarray data. It could meta-analyze datasets in either the same or different platforms. We test FMT, respectively, on two published Arabidopsis datasets in one platform and three Mouse datasets in three different platforms, and then analyze the Gene Ontology (GO) terms or metabolic pathways of the most DEGs. Our results show that they are highly agreed on DEGs, and many of them are crucial and functional. In summary, our method is fast and practical. © 2013 Binary Information Press.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

Prediction of multiple sequence alignment based on an improved particle swarm optimization

引用

Journal of Bionanoscience 2013年第1期7卷 92-96页

作者： Gao, Yu-Xi Wang, Yan-Min Pei, Zhi-Li Department of Computer Science Jilin Business and Technology College China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University China College of Computer Science and Technology Inner Mongolia University for the Nationalities Tongliao 028000 China

In this paper we use an improved Particle Swarm Optimization algorithm to solve Multiple Sequence Alignment (MSA). MSA is a key problem in bioinformatics. The thesis starts with the theory of Particle swarm optimization algorithm and the design an improved algorithm for Multiple Sequence Alignment. The simulated experiments show that the improved algorithm surpasses existing algorithms in performance. Copyright © 2013 American Scientific Publishers.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Prediction of ncRNA based on least squares support vector machine

引用

Journal of Bionanoscience 2013年第1期7卷 121-125页

作者： Xing, Chong Wan, Liming Wang, Jiaxin Liang, Yanchun College of Electrical and Information Engineering Guanghua College of Changchun University Changchun 130033 China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China Research Institute on General Development and Evaluation of Equipment EAAF of PLA Beijing 100076 China

In this paper, on the basis of principal component analysis, we use least squares support vector machine (LS-SVM) to predict tRNA. Appearance frequencies of single nucleotide, 2-nucleotides, (G-C)% and (A-T)% were chosen as characteristic inputs. Results from tests showed that the prediction accuracy was 90.51% on prokaryotic tRNA dataset. The results indicate that the proposed method is adoptable for prokaryotic ncRNA prediction. Copyright © 2013 American Scientific Publishers.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Optical flow computation based on spline functionals

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2013年第SUPPL.1期43卷 165-168页

作者： Guo, Xiao-Xin Yang, Guang Xu, Zhi-Wen College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China

A mathematical model using the spline functional as smooth constraints was presented. The second-and fourth-order partial differential equations constraints were two special cases in the model. The necessary condition for optical flow minimization problem solution was also presented. This model provided a basis for formal representation and numerical computation of optical flow from a methodological point of view. The significance of this mathematical model lay in the simplification of the equations for optical flow computation into linear algebraic equations. The simplification can contribute to discrete representation of the optical flow equation, and also verify that the use of smoothness constraints can ensure the existence and uniqueness of the solution from the view of the algebraic equations.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Intensity preserving technology in image restoration

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2013年第SUPPL.1期43卷 106-109页

作者： Guo, Xiao-Xin Xu, Zhi-Wen Che, Xiang-Jiu College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China

A new approach of image restoration for the sequence of fluorescein angiography was proposed. First, the intensity constraint was incorporated into Miller regularization equation to obtain the ability to preserve the high intensity of pixels. Thus, the restored image would be influenced not only by the smoothness constraints, but also by the intensity constraints. Secondly, in the process of the restoration, we use an intensity template obtained from the pre-filtering procedure was used to achieve the intensity constraints. The template represented an image composed by the desired intensity value. The experiments show that the proposed scheme gains a better result in both high intensity preservation and image restoration.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Speech separation in the vehicle environment based on fastICA algorithm

引用

Journal of Multimedia 2012年第1期7卷 33-40页

作者： Zhang, Jindong Qin, Guihe Liu, Ye College of computer science and technology Jilin University Changchun China Key Laboratory of Symbol Computation Knowledge Engineering of the Ministry of Education Changchun China

The speech interaction in-vehicle was mainly realized by the speech recognition. The human-machine interaction around was usually disturbed by the noise, and the speech received by the receiver was not the original pure speech, so compared to the pure environment, the accuracy of the speech recognition declined so sharply that it could not meet the demand of the practical application of human- machine interaction. So the speech recognition was required to have the strong adaptability and processing capacity to the speech with noise. In this paper, the FastICA algorithm in signal process and statistics was studied and used to separate the driver's speech in the vehicle environment, and realizes the pretreatment in recognizing driver's speech. The effectiveness of the method had been validated in actual vehicle experimental configuration. © 2012 Academy Publisher.

关键词： Speech processing

来源：评论

学校读者我要写书评

暂无评论

Conflict-based belief revision operators in possibilistic logic 26

Conflict-based belief revision operators in possibilistic lo...

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Qi, Guilin Wang, Kewen Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and Engineering Southeast University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China School of Computing and Information Technology Griffith University Australia

ISBN: (纸本)9781577355687

In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we consider weighted prime implicants of a possibilistic knowledge base and use them to define novel revision operators in possibilistic logic. Intuitively, a weighted prime implicant of a possibilistic knowledge base is a logically weakest possibilistic term (i.e., a set of weighted literals) that can entail the knowledge base. We first show that the existing definition of a weighted prime implicant is problematic and need a modification. To define a revision operator using weighted prime implicants, we face two problems. The first problem is that we need to define the notion of a conflict set between two weighted prime implicants of two possibilistic knowledge bases to achieve minimal change. The second problem is that we need to define the disjunction of possibilistic terms. We solve these problems and define two conflict-based revision operators in possibilistic logic. We then adapt the well-known postulates for revision proposed by Katsuno and Mendelzon and show that our revision operators satisfy four of the basic adapted postulates and satisfy two others in some special cases. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Improving the Recommendation of Collaborative Filtering by Fusing Trust Network

Improving the Recommendation of Collaborative Filtering by F...

引用

International Conference on computational Intelligence and Security

作者： Bo Yang Pengfei Zhao Shuqiu Ping Jing Huang School of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun P.R.China

To accurately and actively provide users with their potentially interested information or services is the main task of a recommender system. Collaborative filtering is one of the most widely adopted recommender methods, whereas it is suffering the issue of sparse rating data that will severely degenerate the quality of recommendations. To address this issue, the article proposes a novel method, named the FTRA (Fusing Trust and Ratings), trying to improve the performance of collaborative filtering recommendation by means of elaborately integrating twofold sparse information, i.e., the conventional rating data given by users and the social trust network among the same users. The performance of FTRA is rigorously validated by comparing it with six representative methods on a real-world dataset. The experimental results show that the FTRA outperforms all other competitors in terms of both precision and recall. More importantly, our work suggests that the strategy of augmenting sparse rating data by fusing trust networks does significantly improve the quality of conventional collaborative filtering recommendation, and its quality could be further improved by means of designing more effective integrating schemes.

关键词： Collaboration Recommender systems Measurement Social network services Web sites Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A hybrid optimization algorithm for the multi-chromosomal reversal median problem

A hybrid optimization algorithm for the multi-chromosomal re...

引用

1st International Conference on engineering and Technology Innovation, ICETI 2011

作者： Zhang, Yi Zhang, Meng Department of Computer Science Jilin Business and Technology College Changchun 130062 China Military Simulation Technology Institute Air Force Aviation University Changchun130022 China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China

ISBN: (纸本)9783037853245

In this paper, we introduce a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the multi-chromosomal reversal median problem. We convert the large-scale genome into TSP maps at first. Then we use a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the problem. In our improved algorithm, we increase the search speed by implement multi-branch parallel search of ACO. Our extensive experiments on simulated datasets show that this median solver is efficient.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：