Can data compression algorithm do abstraction?
Project/Area Number |
23650074
|
Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
Allocation Type | Multi-year Fund |
Research Field |
Intelligent informatics
|
Research Institution | Kyushu Institute of Technology |
Principal Investigator |
SAKAMOTO Hiroshi 九州工業大学, 大学院情報工学研究院, 教授 (50315123)
|
Co-Investigator(Kenkyū-buntansha) |
KUBOYAMA Tetsuji 学習院大学, 計算機センター, 教授 (80302660)
|
Project Period (FY) |
2011 – 2013
|
Project Status |
Completed (Fiscal Year 2013)
|
Budget Amount *help |
¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2013: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
Keywords | データ圧縮 / データマイニング / 簡潔データ構造 / グラフ構造 / 情報抽出 / パターン発見 / マイニング |
Research Abstract |
When data is too big to read by machine, such data is useless. For such huge data flood, we need to develop the next generation information technology. In this study, adopting our technique for directly comparing texts, we propose an efficient algorithm of knowledge discovery for huge text data beyond GB.
|
Report
(4 results)
Research Products
(36 results)
-
-
-
-
-
-
[Journal Article] A Succinct Grammar Compression2013
Author(s)
Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto
-
Journal Title
24th Annual Symposium on Combinatorial Pattern Matching
Volume: 7922
Pages: 235-246
DOI
ISBN
9783642389047, 9783642389054
Related Report
Peer Reviewed
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-