Presentation 2006-05-18
Data Compression and Anti-unification for Semi-structured Documents with Tree Grammars
Jun ONUMA, Koichiro DOI, Akihiro YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this study, we present an algorithm named TGCA which compresses semi-structured texts, and performs anti-unification on semi-structured texts compressed by the algorithm. Anti-unification is a method for extracting common structure from several data, and is used in the theory of machine learning based on logic. By the anti-unification of semi-structured texts, we can get the common structure from several texts. We analyze the performance of our model in the best and worst case scenarios, and compare it with the original model.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) anti-unification / semi-structured data / deta compression
Paper # AI2006-9
Date of Issue

Conference Information
Committee AI
Conference Date 2006/5/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Data Compression and Anti-unification for Semi-structured Documents with Tree Grammars
Sub Title (in English)
Keyword(1) anti-unification
Keyword(2) semi-structured data
Keyword(3) deta compression
1st Author's Name Jun ONUMA
1st Author's Affiliation Faculty of Engineering, Kyoto University:MEITEC Corp.()
2nd Author's Name Koichiro DOI
2nd Author's Affiliation Graduated School of Informatics, Kyoto University
3rd Author's Name Akihiro YAMAMOTO
3rd Author's Affiliation Graduated School of Informatics, Kyoto University
Date 2006-05-18
Paper # AI2006-9
Volume (vol) vol.106
Number (no) 38
Page pp.pp.-
#Pages 6
Date of Issue