A phenotypic genetic algorithm for inductive logic programming

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29646

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29646

题名:	A phenotypic genetic algorithm for inductive logic programming
作者:	Chien,YWC;Chen,YL
贡献者:	資訊管理研究所
日期:	2009
上传时间:	2010-06-29 20:37:15 (UTC+8)
出版者:	中央大學
摘要:	Inductive logic programming (ILP) is one of the most popular approaches in machine learning. ILP can be used to automate the construction of first-order definite clause theories from examples and background knowledge. Although ILP has been successfully applied in various domains, it has the following weaknesses: (1) weak capabilities in numerical data processing. (2) zero noise tolerance, and (3) unsatisfactory learning time with a large number of arguments in the relation. This paper proposes a phenotypic genetic algorithm (PGA) to overcome these weaknesses. To strengthen the numerical data processing capabilities, a multiple level encoding structure is used that can represent three different types of relationships between two numerical data. To tolerate noise, PGA's goal of finding perfect rules is changed to finding top-k rules, which allows noise in the induction process. Finally, to shorten learning time, we incorporate the semantic roles constraint into PGA, reducing search space and preventing the discovery of infeasible rules. Stock trading data from Yahool Finance Online is used in our experiments. The results indicate that the PGA algorithm can find interesting trading rules from real data. (c) 2008 Elsevier Ltd. All rights reserved.
關聯:	EXPERT SYSTEMS WITH APPLICATIONS
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	1037	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....