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

Characteristic Pattern Mining in Hierarchical Structured Databases

Research Project

Project/Area Number 19700146
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Intelligent informatics
Research InstitutionKobe University

Principal Investigator

OZAKI Tomonobu  Kobe University, 自然科学系先端融合研究環重点研究部, 助教 (40365458)

Project Period (FY) 2007 – 2008
Project Status Completed (Fiscal Year 2008)
Budget Amount *help
¥3,020,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥420,000)
Fiscal Year 2008: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2007: ¥1,200,000 (Direct Cost: ¥1,200,000)
Keywords知識発見とデータマイニング / データマイニング / 階層的構造データ / 半構造データマイニング / グラフマイニング / 飽和パタン発見
Research Abstract

本研究では,系列やグラフデータなどの組合せである複合的な構造データを対象に,データ中に頻繁に出現する代表的・特徴的パタンを効率的に発見するアルゴリズムの開発を行った.
その結果,(1)木構造データを対象とした制約付きパタン,(2)構造データ集合のグラフを対象とした各種特徴的パタン,(3)グラフ系列を対象とした飽和強相関パタンなど,複合構造データに対する新たなパタンの効率的な発見手法の開発に成功した.

Report

(3 results)
  • 2008 Annual Research Report   Final Research Report ( PDF )
  • 2007 Annual Research Report
  • Research Products

    (27 results)

All 2008 2007

All Journal Article (11 results) (of which Peer Reviewed: 11 results) Presentation (16 results)

  • [Journal Article] 拡張出現マッチングを用いた制約付きノイズ許容極小順序木パターンの発見2008

    • Author(s)
      尾崎 知伸,大川 剛直
    • Journal Title

      情報処理学会論文誌:データベース Vol.1, No.3

      Pages: 20-35

    • NAID

      110007990016

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] グラフデータベースからの頻出相互関連部分グラフ集合の発見2008

    • Author(s)
      尾崎 知伸,大川 剛直
    • Journal Title

      人工知能学会論文誌 Vol.23,No.6

      Pages: 514-525

    • NAID

      130000098264

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] 構造データ集合からなるグラフデータベースからの頻出パターン発見2008

    • Author(s)
      山本 翼,尾崎 知伸,大川 剛直
    • Journal Title

      情報処理学会論文誌:データベース Vol.1,No.1

      Pages: 26-35

    • NAID

      110007989999

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] 限定的出現マッチを利用した逆単調制約付き頻出飽和順序木の発見2008

    • Author(s)
      尾崎 知伸,大川 剛直
    • Journal Title

      人工知能学会論文誌 Vol.23,No.2

      Pages: 58-67

    • NAID

      130000097937

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] グラフデータベースからの頻出相互関連部分グラフ集合の発見2008

    • Author(s)
      尾崎知伸,大川剛直
    • Journal Title

      人工知能学会論文誌 No.23, Vol.6

      Pages: 514-525

    • NAID

      130000098264

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 拡張出現マッチングを用いた制約付きノイズ許容極小順序木パターンの発見2008

    • Author(s)
      尾崎知伸,大川剛直
    • Journal Title

      情報処理学会論文誌 : データベース Vol.1, No.3

      Pages: 20-35

    • NAID

      110007990016

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 構造データ集合からなるグラフデータベースからの頻出パターン発見2008

    • Author(s)
      山本翼, 尾崎知伸, 大川剛直
    • Journal Title

      情報処理学会論文誌 : データベース Vol.1, No.1

      Pages: 26-35

    • NAID

      110007989999

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 構造データ集合からなるグラフデータベースからの頻出パターン発見2008

    • Author(s)
      山本翼, 尾崎知伸, 大川剛直
    • Journal Title

      情報処理学会論文誌:データベース

    • NAID

      110007989999

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 制限付き最右拡張を用いた効率的な飽和順序木の発見2007

    • Author(s)
      尾崎 知伸,大川 剛直
    • Journal Title

      情報処理学会論文誌:データベース Vol.48,No.SIG11(TOD34)

      Pages: 118-127

    • NAID

      110006317690

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] 制限付き最右拡張を用いた効率的な飽和順序木の発見2007

    • Author(s)
      尾崎知伸, 大川剛直
    • Journal Title

      情報処理学会論文誌:データベース Vol.48, NoSI G11(TOD34)

      Pages: 118-127

    • NAID

      110006317690

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 限定的出現マッチを利用した逆単調制約付き頻出飽和順序木の発見2007

    • Author(s)
      尾崎知伸, 大川剛直
    • Journal Title

      人工知能学会論文誌 Vol.23,No.2

      Pages: 58-67

    • NAID

      130000097937

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Presentation] Discovery of Internal and External Hyperclique Patterns in Complex Graph Databases2008

    • Author(s)
      Tsubasa Yamamoto,Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      The 4th International Workshop on Mining Complex Data (MCD 2008) in conjunction with IEEE ICDM 2008 pp.301-309
    • Place of Presentation
      Pisa Italy
    • Year and Date
      2008-12-15
    • Related Report
      2008 Final Research Report
  • [Presentation] Ohkawa,Mining Correlated Pairs of Patterns in Multidimensional Structured Databases2008

    • Author(s)
      Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      The 4th International Workshop on Mining Complex Data (MCD 2008) in conjunction with IEEE ICDM 2008 pp.275-282
    • Place of Presentation
      Pisa Italy
    • Year and Date
      2008-12-15
    • Related Report
      2008 Final Research Report
  • [Presentation] Mining Correlated Pairs of Patterns in Multidimensional Structured Databases2008

    • Author(s)
      Tomonobu Ozak and Takenao Ohkawa
    • Organizer
      The 4th International Workshop on Mining Complex Data
    • Place of Presentation
      Pisa, Italy
    • Year and Date
      2008-12-15
    • Related Report
      2008 Annual Research Report
  • [Presentation] Discovery of Internal and External Hyperclique Patterns in Complex Graph Databases2008

    • Author(s)
      Tsubasa Yamainoto, Tomonobu Ozaki and Takenao Ohkawa
    • Organizer
      The 4th International Workshop on Mining Complex Data
    • Place of Presentation
      Pisa, Italy
    • Year and Date
      2008-12-15
    • Related Report
      2008 Annual Research Report
  • [Presentation] Discovery of Closed Hyperclique Patterns in a Sequence of Graphs2008

    • Author(s)
      Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      Graphs,The Third International Workshop on Data-Mining and Statistical Science (DMSS2008) pp.12-15
    • Place of Presentation
      Tokyo Japan
    • Year and Date
      2008-09-25
    • Related Report
      2008 Final Research Report
  • [Presentation] Discovery of Closed Hyperclique Patterns in a Sequence of Graphs2008

    • Author(s)
      Tomonobu Ozaki and Takenao Ohkawa
    • Organizer
      The Third International Workshop on Data-Mining and Statistical Science
    • Place of Presentation
      Tokyo, Japan
    • Year and Date
      2008-09-25
    • Related Report
      2008 Annual Research Report
  • [Presentation] Mining Correlated Subgraphs in Graph Databases2008

    • Author(s)
      Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      The 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2008),pp.272-283
    • Place of Presentation
      Osaka Japan
    • Year and Date
      2008-05-23
    • Related Report
      2008 Final Research Report
  • [Presentation] Mining Correlated Subgraphs in Graph Databases2008

    • Author(s)
      Tomonobu Ozaki and Takenao Ohkawa
    • Organizer
      The 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining
    • Place of Presentation
      Osaka, Japan
    • Year and Date
      2008-05-23
    • Related Report
      2008 Annual Research Report
  • [Presentation] Mining Mutually Dependent Ordered Subtrees in Tree Databases2008

    • Author(s)
      Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      First International Workshop on Algorithms for Large-Scale Information Processing in Knowledge Discovery (ALSIP 2008),pp.78-89
    • Place of Presentation
      Osaka Japan
    • Year and Date
      2008-05-20
    • Related Report
      2008 Final Research Report
  • [Presentation] Mining Mutually Dependent Ordered Subtrees in Tree Databases2008

    • Author(s)
      Tomonobu Ozaki and Takenao Ohkawa
    • Organizer
      First International Workshop on Algorithms for Large-Scale Information Processing in Knowledge Discovery
    • Place of Presentation
      Osaka, Japan
    • Year and Date
      2008-05-20
    • Related Report
      2008 Annual Research Report
  • [Presentation] Discovery of frequent graph patterns that consist of the vertices with the complex structures2007

    • Author(s)
      Tsubasa Yamamoto,Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      The Third International Workshop on Mining Complex Data (MCD'07) pp.71-82
    • Place of Presentation
      Warsaw Poland
    • Year and Date
      2007-09-17
    • Related Report
      2008 Final Research Report
  • [Presentation] Discovery of frequent graph patterns that consist of the vertices with the complex structures2007

    • Author(s)
      Tsubasa Yamamoto, Tomonobu Ozaki, Takenao Ohkawa
    • Organizer
      The Third International Workshop on Mining Complex Data
    • Place of Presentation
      Warsaw, Poland
    • Year and Date
      2007-09-17
    • Related Report
      2007 Annual Research Report
  • [Presentation] Ohkawa,Mining Frequent Delta-Free Induced Ordered Subtrees in Tree-structured Databases2007

    • Author(s)
      Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      The 5th Workshop on Learning with Logics and Logics for Learning pp.3-9
    • Place of Presentation
      Miyazaki Japan
    • Year and Date
      2007-06-18
    • Related Report
      2008 Final Research Report
  • [Presentation] Mining Frequent Delta-Free Induced Ordered Subtrees in Tree-structured Databases2007

    • Author(s)
      Tomonobu Ozaki, Takenao Ohkawa
    • Organizer
      5th Workshop on Learning with Logics and Logics for Learning
    • Place of Presentation
      Miyazaki, Japan
    • Year and Date
      2007-06-18
    • Related Report
      2007 Annual Research Report
  • [Presentation] Efficiently Mining Closed Constrained Frequent Ordered Subtrees by using Border Information2007

    • Author(s)
      Tomonobu Ozaki,Takenao Ohkawa
    • Organizer
      The 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2007) pp.745-752
    • Place of Presentation
      Nanjing China
    • Year and Date
      2007-05-23
    • Related Report
      2008 Final Research Report
  • [Presentation] Efficiently Mining Closed Constrained Frequent Ordered Subtrees bv usine Border Information2007

    • Author(s)
      Tomonobu Ozaki, Takenao Ohkawa
    • Organizer
      The 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining
    • Place of Presentation
      Nanjing, China
    • Year and Date
      2007-05-23
    • Related Report
      2007 Annual Research Report

URL: 

Published: 2007-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi