| Project/Area Number |
23700267
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Sensitivity informatics/Soft computing
|
|---|
| Research Institution | Kinki University (2012-2013)
Okayama University (2011) |
|---|
Principal Investigator |
HANDA Hisashi 近畿大学, 理工学部, 准教授 (60304333)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2013: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2012: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
|---|
| Keywords | 分布推定アルゴリズム / 強化学習問題 / グラフ / グラフカーネル / 進化計算 / 進化アルゴリズム / グラフマイニング |
|---|
| Research Abstract |
This research project has proposed two sorts of novel Estimation of Distribution Algorithms (EDAs). The first EDA is the Estimation of Distribution ALgorithms for solving Reinforcement Learning Algorithms, called EDA-RL. For this algorithm, we have investigated the detection of slip states, and the estimation of the structure of the probabilistic model in the EDA-RL. Another proposed EDA is the EDA for graph-related problems. This algorithm can cope with individuals represented by graphs. By using graph kernels, we do not have to take care of ruggede fitness landscpaes caused by individual representations. During the project peirod, we have published journal articles and international coneference papers. Moreover, we have two oppotunity of the invited talks including a talk in Taiwan.
|
