Rule Extraction by Genetic Programming with Clustered Terminal Symbols
5th International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2009
290-295 頁
2009-11 発行
アクセス数 : 627 件
ダウンロード数 : 76 件
今月のアクセス数 : 3 件
今月のダウンロード数 : 0 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00028459
| ファイル情報(添付) | |
| タイトル ( eng ) |
Rule Extraction by Genetic Programming with Clustered Terminal Symbols
|
| 作成者 |
Hara Akira
Tanaka Haruko
Ichimura Takumi
Takahama Tetsuyuki
|
| 収録物名 |
5th International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2009
|
| 開始ページ | 290 |
| 終了ページ | 295 |
| 抄録 |
When Genetic Programming (GP) is applied to rule extraction from databases, the attributes of the data are often used for the terminal symbols. However, in the case of the database with a large number of attributes, the search space becomes vast because the size of the terminal set increases. As a result, the search performance declines. For improving the search performance, we propose new methods for dealing with the large-scale terminal set. In the methods, the terminal symbols are clustered based on the similarities of the attributes. In the beginning of search, by reducing the number of terminal symbols, the rough and rapid search is performed. In the latter stage of search, by using the original attributes for terminal symbols, the local search is performed. By comparison with the conventional GP, the proposed methods showed the faster evolutional speed and extracted more accurate classification rules.
|
| NDC分類 |
技術・工学 [ 500 ]
|
| 言語 |
英語
|
| 資源タイプ | 会議発表論文 |
| 出版者 |
IEEE SMC Hiroshima Chapter
|
| 発行日 | 2009-11 |
| 権利情報 |
(c) Copyright by IEEE SMC Hiroshima Chapter.
|
| 出版タイプ | Version of Record（出版社版。早期公開を含む） |
| アクセス権 | オープンアクセス |
| 収録物識別子 |
[ISSN] 1883-3977
[URI] http://www.hil.hiroshima-u.ac.jp/iwcia/2009/
|
