Development of memory-saving and time-efficient Web mining strategies and its applications on cloud computing
| Project/Area Number |
24500178
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Hiroshima City University |
|---|
Principal Investigator |
TOMOYUKI Uchida 広島市立大学, 情報科学研究科, 准教授 (70264934)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
SHOUDAI Takayoshi 九州国際大学, 国際関係学部, 教授 (50226304)
MIYAHARA Tetsuhiro 広島市立大学, 情報科学研究科, 准教授 (90209932)
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
ITOKAWA Yuko 広島国際大学, 心理科学部, 助教 (40341234)
SUZUKI Yusuke 広島市立大学, 情報科学研究科, 助教 (10398464)
|
|---|
| Project Period (FY) |
2012-04-01 – 2015-03-31
|
| Project Status |
Completed (Fiscal Year 2014)
|
| Budget Amount *help |
¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2014: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Keywords | グラフアルゴリズム / データマイニング / 知識発見 / Webマイニング / クラウド・コンピューティング / 機械学習 / 情報基礎 / 情報検索 / クラウド・コンピューテイング / 簡潔データ構造 / クラウドコンピューティング / 順序木パターン / 順序木言語 |
|---|
| Outline of Final Research Achievements |
The purpose of this research is to present memory-saving and time efficient Web mining strategies for extracting graph structured features common to webpages and apply proposed algorithms to information retrieval systems based on collaborative cloud computing. Firstly, we defined a succinct data representation for a term tree pattern representing tree structured features common to webpages. Secondly, we defined ordered graph patterns expressing graph structured features extracted from images in Webpages. Thirdly, we proposed efficient pattern matching algorithms for term tree patterns and incremental polynomial time enumeration algorithms using succinct data structures. Fourthly, based on computational machine learning, we showed polynomial time inductive inferability of ordered graph patterns from positive data by giving polynomial time pattern matching algorithms. Finally, we applied our proposed algorithms for information retrieval systems based on collaborative cloud computing.
|
Report
(4 results)
Research Products
(18 results)
