Development of versatile techniques for computing similarity between tree-structured data
| Project/Area Number |
21700178
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Doshisha University (2010-2012)
National Institute of Informatics (2009) |
|---|
Principal Investigator |
FUKAGAWA Daiji 同志社大学, 文化情報学部, 助教 (10442518)
|
|---|
| Project Period (FY) |
2009 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2010: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2009: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
|---|
| Keywords | 木構造 / 類似度 / 近似パターン照合 / アルゴリズム / 類似度計算 |
|---|
| Research Abstract |
In this project, we developed several methods which computes distance between tree structured data and gives an approximate matching between them. As a result, we obtained fast approximate algorithms which computes edit distance between ordered/unordered trees, fixed parameter algorithm to compute the proper tree edit distance, fast exact algorithm to compute an optimal tree matching via maximum clique problem, a probabilistic model to measure similarity of trees and a learning algorithm for the model.
|
Report
(5 results)
Research Products
(25 results)
