• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2007 Fiscal Year Final Research Report Summary

Data mining technique from huge graph structured data which are lossless compressed

Research Project

Project/Area Number 17500096
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionHiroshima City University

Principal Investigator

UCHIDA Tomoyuki  Hiroshima City University, Graduate School of Information Sciences, Associate Professor (70264934)

Co-Investigator(Kenkyū-buntansha) SHOUDAI Takayoshi  Kyushu University, Graduate School of Information Science and Electrical Engineering, Associate Professor (50226304)
MIYAHARA Tetsuhiro  Hiroshima City University, Graduate School of Information Sciences, Associate Professor (90209932)
SUZUKI Yusuke  Hiroshima City University, Graduate School of Information Sciences, Assistant Professor (10398464)
Project Period (FY) 2005 – 2007
KeywordsAlgorithm / Data Mining / Machine Learning / Algorithmic Graph Theory
Research Abstract

Due to the rapid growth of Internet, many graph structured data such as Web documents, electric power wiring diagram and chemical compounds have become accessible on Internet. The purpose of this research is to present efficient graph mining algorithms for finding characteristic graph patterns from lossless compressed graph structured data. Then, we give results of this research as follows.
1. For tree structured data such as Web documents, we gave polynomial time learning algorithms on inductive inference and polynomial time learning algorithms in query learning model. Moreover, we presented tree mining algorithms for tree structured data.
2. In order to give graph mining techniques for graph structured data, by giving a polynomial time matching algorithm and a polynomial time algorithm for solving the minimal language problem for TTSP graph patterns, which is one of knowledge representations of an Electric power wiring diagram, we showed that the class of TTSP graphs is inductively inf … More erable from positive data. In the query learning model, we showed that finite unions of TTSP graph patterns are polynomial time learnable from queries. Moreover, we presented a graph mining algorithm of finding characteristic graph patterns from a set of outerplanar graphs which is a data model of chemical compounds.
3. Based on Lempel-Zip compression for strings, we proposed a lossless compression algorithm for huge trees. Through several experiments, we showed that the proposed algorithms have good performance. Moreover, based on XBW transformations for trees given by Ferragina, et. al. in 2005, we presented an XBW transformation of lossless compressed trees. Then, we presented an efficient search algorithm of finding all occurrences of a given path on XBW structures of lossless compressed trees.
4. Based on an XBW transformation for huge lossless compressed trees, we proposed an XBW transformation for TTSP graphs. Moreover, we also presented an efficient search algorithm of finding all occurrences of a given path on XBW structures of TTSP graphs. Less

  • Research Products

    (12 results)

All 2008 2007 2006 2005

All Journal Article (9 results) (of which Peer Reviewed: 3 results) Presentation (3 results)

  • [Journal Article] Mining of Frequent Block Preserving Outerplanar Graph Structured Patlterns2008

    • Author(s)
      Y.Sasaki, H.Yamasaki, T.Shoudai, T.Uchida
    • Journal Title

      Proc.17th International Conference on Inductive Logic Programming(ILP-2007) 4894

      Pages: 239-253

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
  • [Journal Article] Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns2008

    • Author(s)
      Y. Sasaki, H. Yamasaki, T. Shoudai, T. Uchida
    • Journal Title

      Proc. 17th International Conference on Inductive Logic Programming(ILP-2007), Refereed, Springer-Verlag LNAI 4894

      Pages: 239-253

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries2008

    • Author(s)
      S. Matsumoto, T. Shoudai, T. Uchida, T. Miyahara, Y. Suzuki
    • Journal Title

      IEICE TRANSACTIONS on Information and Systems, Refereed, IEICE Vol. E91-D, No. 2

      Pages: 222-230

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Exact Learning of Finite Unions of Graph Patterns from Queries2007

    • Author(s)
      R. Okada, S. Matsumoto, T. Uchida, Y. Suzuki, T. Shoudai
    • Journal Title

      Proc. 18th International Conference on Algorithmic Learning Theory(ALT-2007), Refereed, Springer-Verlag LNAI 4754

      Pages: 290-304

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Extracting Structural Features Among Words from Document Data Streams2006

    • Author(s)
      K.Ishida, T.Uchida and K.Kawamoto
    • Journal Title

      Proc.19th Australian Conference on Artificial Intelligence 2006(AI 2006) 4304

      Pages: 332-341

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
  • [Journal Article] Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data2006

    • Author(s)
      Y.Suzuki, T.Shoudai, T.Uchida and T.Miyahara
    • Journal Title

      Theoretical Computer Science Vol.350,No.1

      Pages: 63-90

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
  • [Journal Article] Extracting Structural Features among Words from Document Data Streams2006

    • Author(s)
      K. Ishida, T. Uchida, K. Kawamoto
    • Journal Title

      Proc. 19th Australian Joint Conference on Artificial Intelligence(AI.2006), Refereed, Springer-Verlag LNAI 4304

      Pages: 67-78

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data2006

    • Author(s)
      Y. Suzuki, T. Shoudai, T. Uchida, T. Miyahara
    • Journal Title

      Theoretical Computer Science, Refereed Vol. 350, No. 1

      Pages: 63-90

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data2005

    • Author(s)
      R. Takami, Y. Suzuki, T. Uchida, T. Shoudai, Y. Nakamura
    • Journal Title

      Proc. 15th International Conference on Inductive Logic Programming(ILP-2005), Refereed, Springer-Verlag LNAI 3625

      Pages: 366-383

    • Description
      「研究成果報告書概要(欧文)」より
  • [Presentation] Sequential Algorithm Based on a Lempel-Ziv Compression Scheme for Tree Structured Data2006

    • Author(s)
      K. Katoh, Y. Itokawa, T. Uchida, T. Shoudai, Y. Nakamura
    • Organizer
      LA Symposium(Summer), not Refereed
    • Place of Presentation
      Saijyo Grand Hotel, Hiroshima
    • Year and Date
      20060802-04
    • Description
      「研究成果報告書概要(欧文)」より
  • [Presentation] Polynomial Time Inductive Inference of Interval Graph Pattern Languages from Positive Data2006

    • Author(s)
      H. Yamasaki, T. Shoudai
    • Organizer
      Proc. 4th Workshop on Learning with Logics and Logics for Learning(LLLL-2006), Refereed
    • Place of Presentation
      The Tower Hall Funabori, Tokyo
    • Year and Date
      20060605-06
    • Description
      「研究成果報告書概要(欧文)」より
  • [Presentation] Sequential Algorithm Based on a Lempel-Ziv Compression Scheme for Tree Structured Data2006

    • Author(s)
      加藤 廣一郎、糸川 裕子、内田 智之、正代 隆義、中村 泰明
    • Organizer
      夏のLAシンポジウム
    • Place of Presentation
      西条グランドホテル(広島県)
    • Year and Date
      20060000
    • Description
      「研究成果報告書概要(和文)」より

URL: 

Published: 2010-02-04  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi