東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Self-emergence of structures in gene...

Li, Xin.

FindBook

Google Book

Amazon

博客來

Self-emergence of structures in gene expression programming.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Self-emergence of structures in gene expression programming./
作者:	Li, Xin.
面頁冊數:	119 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5197.
Contained By:	Dissertation Abstracts International67-09B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3233164
ISBN:	9780542868900

Self-emergence of structures in gene expression programming.
Li, Xin.

Self-emergence of structures in gene expression programming. - 119 p.

Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5197.

Thesis (Ph.D.)--University of Illinois at Chicago, 2006.

Data mining tasks are pivotal for the improvement of manufacturing and design processes. However, some of the hidden patterns or relationships among the data are very complex, which cannot be easily detected by traditional data mining techniques. Several example industrial applications include cell phone reliability drop testing, call failure detection, wave filter design, and simulations, etc. Gene Expression Programming (GEP) was recently developed to address this challenge in data analysis and knowledge discovery. Being an evolutionary computation method, GEP distinguishes itself by searching the global optimum through a population of candidate solutions in parallel and being able to produce solutions of any possible form with minimum requirements of pre-knowledge.

ISBN: 9780542868900Subjects--Topical Terms:

626642
Computer Science.

Self-emergence of structures in gene expression programming.
LDR:03256nmm 2200301 4500 001 1830527
005 20070430071713.5
008 130610s2006 eng d
020 $a 9780542868900
035 $a (UnM)AAI3233164
035 $a AAI3233164
040 $a UnM $c UnM
100 1 $a Li, Xin. $3 999627
245 1 0 $a Self-emergence of structures in gene expression programming.
300 $a 119 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5197.
500 $a Adviser: Peter C. Nelson.
502 $a Thesis (Ph.D.)--University of Illinois at Chicago, 2006.
520 $a Data mining tasks are pivotal for the improvement of manufacturing and design processes. However, some of the hidden patterns or relationships among the data are very complex, which cannot be easily detected by traditional data mining techniques. Several example industrial applications include cell phone reliability drop testing, call failure detection, wave filter design, and simulations, etc. Gene Expression Programming (GEP) was recently developed to address this challenge in data analysis and knowledge discovery. Being an evolutionary computation method, GEP distinguishes itself by searching the global optimum through a population of candidate solutions in parallel and being able to produce solutions of any possible form with minimum requirements of pre-knowledge.
520 $a Although quite flexible, the algorithm still has limited performance with respect to complex problems since structure related information about evolving solutions is overlooked during its execution. This research aims to improve the problem solving ability of the GEP algorithm for complex data mining tasks by preserving and utilizing the self-emergence of structures during its evolutionary process.
520 $a An incremental approach has been pursued to achieve the proposed research goal, including the investigation of the constant creation methods in GEP, for identifying and promoting good solution structures; the design of a new genotype representation, namely, Prefix Gene Expression Programming (P-GEP), for establishing a solution structure preserving evolutionary process; and the introduction and implementation of self-emergent structures in P-GEP, for speeding up the learning process by reusing some evolved useful structural components and hence decomposing the complexity of the target solutions.
520 $a Benchmark testing and theoretical analysis have both demonstrated that this line of work successfully assists the evolutionary process in advocating solutions with good functional structures, and finding meaningful building blocks to hierarchically form the final solutions following a faster fitness convergence curve, especially when applied to structurally complex problems. In general, more accurate solutions, higher success rates, and more compact solution structures have been achieved compared to the original GEP algorithm and other traditional methods.
590 $a School code: 0799.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Illinois at Chicago. $3 1020478
773 0 $t Dissertation Abstracts International $g 67-09B.
790 1 0 $a Nelson, Peter C., $e advisor
790 $a 0799
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3233164