| Project/Area Number |
22240010
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (A)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
HIRATA Kouich 九州工業大学, 情報工学研究院, 教授 (20274558)
TOKUNAGA Hiroo 首都大学東京, 理工学研究科, 教授 (30211395)
TSUIKI Hideki 京都大学, 人間・環境学研究科, 教授 (10211377)
HIROWATARI Eiju 北九州市立大学, 基盤教育センター, 教授 (60274429)
YOSHINAKA Ryo 京都大学, 情報学研究科, 助教 (80466424)
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
SUGIYAMA Mahito 大阪大学, 産業科学研究所, 助教 (10733876)
|
|---|
| Research Collaborator |
IKEDA Madori 京都大学, 情報学研究科, 博士課程
OTAKI Keisuke 京都大学, 情報学研究科, 博士課程
|
|---|
| Project Period (FY) |
2010-04-01 – 2014-03-31
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥37,570,000 (Direct Cost: ¥28,900,000、Indirect Cost: ¥8,670,000)
Fiscal Year 2013: ¥10,660,000 (Direct Cost: ¥8,200,000、Indirect Cost: ¥2,460,000)
Fiscal Year 2012: ¥10,400,000 (Direct Cost: ¥8,000,000、Indirect Cost: ¥2,400,000)
Fiscal Year 2011: ¥10,790,000 (Direct Cost: ¥8,300,000、Indirect Cost: ¥2,490,000)
Fiscal Year 2010: ¥5,720,000 (Direct Cost: ¥4,400,000、Indirect Cost: ¥1,320,000)
|
|---|
| Keywords | 知識発見 / 機械学習 / 形式概念解析 / 閉集合 / 実数計算 / 離散構造データ / フラクタル |
|---|
| Research Abstract |
This research project is aiming at foundations of knowledge discovery algorithms for both discrete data and continuous data. The key concept of the foundations is closed set. We developed a semi-supervised algorithm for data which have both discrete attributes and continuous attributes. We applied the closed set method to combination of discrete data and continuous data from economics. We also developed new distances between discrete data, a new pseud-distance for continuous data, and a method diagnosis of outliers. We also applied binary coding to image retrieval. As theoretical results, we developed a computational learning theory based on Gray code, a computational learning theory of algebraic closed sets, a fast method of updating the lattice formed by fast closed sets.
|
