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

2011 Fiscal Year Final Research Report

Next-Generation Semi-structured Data Mining for Large-Scale Knowledge Base Formation

Research Project

  • PDF
Project/Area Number 20240014
Research Category

Grant-in-Aid for Scientific Research (A)

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

Principal Investigator

ARIMURA Hiroki  北海道大学, 情報科学研究科, 教授 (20222763)

Co-Investigator(Kenkyū-buntansha) KIDA Takuya  北海道大学, 大学院・情報科学研究科, 准教授 (70343316)
MINATO Shin-ichi  北海道大学, 大学院・情報科学研究科, 准教授 (10374612)
ITO Kimihito  北海道大学, 人獣共通感染症リサーチセンター, 准教授 (60396314)
UNO Takeaki  国立情報学研究所, 情報学プリンシプル研究系, 准教授 (00302977)
HIRATA Kouichi  九州工業大学, 情報工学研究院, 准教授 (20274558)
Project Period (FY) 2008 – 2011
Keywords知識発見とデータマイニング
Research Abstract

In this research, we study efficient semi-structured data mining technologies and related knowledge federation and indexing technologies, which enables knowledge extraction from massive semi-structured data in the real world. Finally, we made a number of knowledge extraction experiments.

  • Research Products

    (49 results)

All 2012 2011 2010 2009 2008 Other

All Journal Article (22 results) (of which Peer Reviewed: 22 results) Presentation (25 results) Book (1 results) Remarks (1 results)

  • [Journal Article] A Dynamically Reconfigurable FPGA-based Pattern Matching Hardware for Subclasses of Regular Expressions2012

    • Author(s)
      Y. Kaneta, S. Yoshizawa, S. Minato, H. Arimura, and Y. Miyanaga
    • Journal Title

      IEICE Trans. Inf. and Syst

      Volume: Vol.D

    • Peer Reviewed
  • [Journal Article] Improving Parse Trees for Efficient Variable-to-Fixed Length Codes2012

    • Author(s)
      S. Yoshida, T. Uemura, T. Kida, T. Asai, and Seishi Okamoto
    • Journal Title

      Journal of Information Processing

      Volume: Vol.20, No.1 Pages: 238-249

    • Peer Reviewed
  • [Journal Article] Counterexamples to the long-standing conjecture on the complexity of BDD binary operations2012

    • Author(s)
      R. Yoshinaka, J. Kawahara, S. Denzumi, H. Arimura, and S. Minato
    • Journal Title

      Information Processing Letters

      Volume: Vol.112, Issue16 Pages: 636-640

    • Peer Reviewed
  • [Journal Article] Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism2011

    • Author(s)
      Y. Kaneta, H. Arimura, R. Raman
    • Journal Title

      Journal of Discrete Algorithms

    • Peer Reviewed
  • [Journal Article] A polynomial-time-delay and polynomial-space algorithm for enumeration prob-lems in multi-criteria optimization2011

    • Author(s)
      Y. Okamoto, T. Uno
    • Journal Title

      European Journal of Operational Research 210 (1)

      Pages: 48-56

    • Peer Reviewed
  • [Journal Article] Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees2011

    • Author(s)
      K. Hirata, Y. Yamamoto, T. Kuboyama
    • Journal Title

      Proc. CPM 2011, LNCS, Springer

      Volume: Vol.6661 Pages: 402-415

    • Peer Reviewed
  • [Journal Article] Sparse and Truncated Suffix Trees on Variable-Length Codes2011

    • Author(s)
      T. Uemura and H. Arimura
    • Journal Title

      Proc. CPM2011, LNCS, Springer

      Volume: Vol.6661 Pages: 246-260

    • Peer Reviewed
  • [Journal Article] An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences2010

    • Author(s)
      T. Katoh, H. Arimura, K. Hirata
    • Journal Title

      IPSJ Online Transactions, TOD

      Volume: Vol.3 Pages: 1-12

    • Peer Reviewed
  • [Journal Article] Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method2010

    • Author(s)
      T. Uemura, D. Ikeda, T. Kida, H. Arimura
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence

      Volume: Vol.26 Pages: 297-306

    • Peer Reviewed
  • [Journal Article] 分節木と共用文字列で表現される符号上での効率良い圧縮照合アルゴリズム2010

    • Author(s)
      喜田拓也
    • Journal Title

      電子情報通信学会和文論文誌

      Volume: Vol.J93-D Pages: 733-741

    • Peer Reviewed
  • [Journal Article] Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism2010

    • Author(s)
      Y. Kaneta, H. Arimura
    • Journal Title

      Proc. IWOCA2010, LNCS, Springer

      Volume: Vol.6460 Pages: 68-81

    • Peer Reviewed
  • [Journal Article] Fast Bit-Parallel Matching for Network and Regular Expressions2010

    • Author(s)
      Y. Kaneta, S. Minato, H. Arimura
    • Journal Title

      Proc. SPIRE'10, LNCS

      Volume: Vol.6393 Pages: 372-384

    • Peer Reviewed
  • [Journal Article] An Efficient Depth-First Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences2009

    • Author(s)
      T. Katoh, H. Arimura, K. Hirata
    • Journal Title

      IPSJ Trans. on Databases

      Volume: Vol.2, No.4 Pages: 1-12

    • Peer Reviewed
  • [Journal Article] STVF符号:頻度刈り込み接尾辞木を用いた効率良いVF符号化2009

    • Author(s)
      喜田拓也
    • Journal Title

      日本データベース学会論文誌DBSJ Journal

      Volume: Vol.8 Pages: 125-130

    • Peer Reviewed
  • [Journal Article] A Polynomial-delay Polynomial-space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences2009

    • Author(s)
      T. Katoh, H. Arimura, K. Hirata
    • Journal Title

      Proc. PAKDD2009, LNAI, Springer

      Volume: Vol.5476 Pages: 172-183

    • Peer Reviewed
  • [Journal Article] Mining Frequent Bipartite Episode from Event Sequences2009

    • Author(s)
      T. Katoh, H. Arimura, K. Hirata
    • Journal Title

      Discovery Science 2009, LNCS, Springer

      Volume: Vol.5808 Pages: 136-151

    • Peer Reviewed
  • [Journal Article] ウェブ閲覧における効率的なキーワード抽出とその利用2008

    • Author(s)
      上村, 喜田, 有村
    • Journal Title

      情報処理学会撤誌:データベース(TOD)

      Volume: 38 Pages: 49-60

    • Peer Reviewed
  • [Journal Article] プロパティ接尾辞木のオフライン線形時間構築アルゴリズム2008

    • Author(s)
      上村, 喜田, 有村
    • Journal Title

      電子情報通信学会論文誌

      Volume: J91-D Pages: 595-607

    • Peer Reviewed
  • [Journal Article] Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration2008

    • Author(s)
      T. Uno and H. Arimura
    • Journal Title

      LNCS, Springer

      Volume: Vol.5012 Pages: 357-368

    • Peer Reviewed
  • [Journal Article] LCM over ZBDDs : Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation2008

    • Author(s)
      S. Minato, T. Uno, and H. Arimura
    • Journal Title

      LNCS, Springer

      Volume: Vol.5012 Pages: 234-246

    • Peer Reviewed
  • [Journal Article] An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting2008

    • Author(s)
      T. Asai, S. Okamoto, and H. Arimura
    • Journal Title

      LNCS, Springer

      Volume: Vol.5433 Pages: 13-25

    • Peer Reviewed
  • [Journal Article] Flexible Framework for Time-Series Pattern Matching over Multi-Dimension Data Stream2008

    • Author(s)
      T. Kida, T. Saito, and H. Arimura
    • Journal Title

      LNCS, Springer

      Volume: vol.5433 Pages: 1-12

    • Peer Reviewed
  • [Presentation] Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application2012

    • Author(s)
      Kunihiro Wasa, Takeaki Uno, and Hiroki Arimura
    • Organizer
      Proc. COCOON'12
    • Place of Presentation
      LNCS, Springer
    • Year and Date
      20120000
  • [Presentation] 複合イベント系列処理のための効率良い窓付きパターン照合アルゴリズム2012

    • Author(s)
      細川威樹,金田悠作,有村博紀
    • Organizer
      DEIM2012,B8-1
    • Year and Date
      20120000
  • [Presentation] 半構造データに対する効率良い近接パターン照合アルゴリズム2012

    • Author(s)
      和佐州洋,金田悠作,宇野毅明,有村博紀
    • Organizer
      DEIM2012
    • Year and Date
      20120000
  • [Presentation] High-speed String and Regular Expression Matching on FPGA2011

    • Author(s)
      Y. Kaneta, S. Yoshizawa, S. Minato, and H. Arimura
    • Organizer
      Proc APSIPA ASC 2011
    • Year and Date
      20111000
  • [Presentation] Implementation of Sequence BDDs in Erlang2011

    • Author(s)
      S. Denzumi, H. Arimura, S. Minato
    • Organizer
      Proc ACM ERLANG
    • Place of Presentation
      ACM
    • Year and Date
      20110900
  • [Presentation] Notes on Sequence Binary Decision Diagrams : Relationship to Acyclic Automata and Complexities of Binary Set Operations2011

    • Author(s)
      S. Denzumi, Ryo Yoshinaka, H. Arimura and Shin-Ichi Minato
    • Organizer
      Proc. PSC'11
    • Place of Presentation
      Czech Tech. Univ., Prague
    • Year and Date
      20110000
  • [Presentation] Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data2010

    • Author(s)
      H. Arimura
    • Organizer
      Proc. ISCIS'10, LNEE
    • Place of Presentation
      London, UK
    • Year and Date
      20100000
  • [Presentation] An Efficient Algorithm for Almost Instantaneous VF Code Using Multip lexed Parse Tree2010

    • Author(s)
      S. Yoshida, T. Kida
    • Organizer
      Proc. DCC'10, IEEE
    • Year and Date
      20100000
  • [Presentation] Dynamic Reconfigurable Bit-Parallel Architecture for Large-Scale Regular Expression Matching2010

    • Author(s)
      Y. Kaneta, S. Minato, H. Arimura, 他2名
    • Organizer
      Proc. IEEE FPT'10, IEEE
    • Year and Date
      20100000
  • [Presentation] Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases2010

    • Author(s)
      S. Minato, T. Uno
    • Organizer
      Proc. SDM'10, SIAM
    • Year and Date
      20100000
  • [Presentation] On Performance of Compressed Pattern Matching on VF Codes2010

    • Author(s)
      S. Yoshida, T. Kida
    • Organizer
      Proc. DCC'11, IEEE
    • Year and Date
      20100000
  • [Presentation] Aligned Bipartite Episodes Between the Genera of Bacteria2010

    • Author(s)
      T. Katoh, K. Hirata, H. Arimura, 他2名
    • Organizer
      Proc. 2010 CME'10, IEEE/ICME
    • Year and Date
      20100000
  • [Presentation] Efficient Multiple Regular Expression Matching on FPGAs based on Extended SHIFT-AND Method2010

    • Author(s)
      Y. Kaneta, S. Minato, H. Arimura
    • Organizer
      Proc. SASIMI'10
    • Place of Presentation
      Taipei
    • Year and Date
      20100000
  • [Presentation] Inference of Geographic Transmission Probability of In uenza Viruses from a Large Phylogenetic Tree2009

    • Author(s)
      Fumiaki Yanagihashi, Kimihito Ito, H. Arimura
    • Organizer
      Proc. GIW
    • Place of Presentation
      Pacifico Yokohama
    • Year and Date
      20090900
  • [Presentation] Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed sequences, Graphs, and Pictures in Accessible Set Systems2009

    • Author(s)
      H.Arimura, T.Uno
    • Organizer
      Proc. SDM'09, SIAM
    • Year and Date
      20090000
  • [Presentation] Comparison of ZDD-Vectors and WZDDs for Frequent Pattern Mining2009

    • Author(s)
      Haruya Iwasaki, Elsa Loekito, S. Minato, James Bailey
    • Organizer
      Proc. LLLL'09
    • Place of Presentation
      Kyoto
    • Year and Date
      20090000
  • [Presentation] Mining Frequent k-Partite Episodes from Event Sequences2009

    • Author(s)
      T. Katoh, H. Arimura, Koichi Hirata
    • Organizer
      Proc. LLLL'09
    • Place of Presentation
      Kyoto
    • Year and Date
      20090000
  • [Presentation] Monolithic and Partial Compilation Methods for Probabilistic Inference of Bayesian Networks using ZBDDs2009

    • Author(s)
      D. Tokoro, Kiyoharu Hama guchi, Toshinobu Kashiwabara, S. Minato
    • Organizer
      DMSS'09
    • Place of Presentation
      京大会館(京都府)
    • Year and Date
      20090000
  • [Presentation] 木の最適ラベリング問題とその進化系統樹への応用2009

    • Author(s)
      柳橋史成,伊藤公人,有村博紀
    • Organizer
      第16回SIGBIO
    • Place of Presentation
      中央大学後楽園キャンパス
    • Year and Date
      20090000
  • [Presentation] Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data (invited talk)2008

    • Author(s)
      H. Arimura
    • Organizer
      PAKDD'08, Lecture Notes in Computer Science (LNCS), Springer
    • Year and Date
      20080000
  • [Presentation] Efficient Method of Large-Scale Data Analysis Using BDD-based Data Compression (Invited Talk)2008

    • Author(s)
      S. Minato
    • Organizer
      In Proc. IWMMSP'08
    • Year and Date
      20080000
  • [Presentation] ZBDD-Based Probabilistic Computation and Application for System Analysis2008

    • Author(s)
      S. Minato
    • Organizer
      In Proc of Workshop of SoC Design Methodologies
    • Place of Presentation
      National Tsing Hua University, China
    • Year and Date
      20080000
  • [Presentation] XQUBE:具体例と演示からのXQuery問合せ構築のための視覚言語2008

    • Author(s)
      筒井淳平,有村博紀
    • Organizer
      iDBフォーラム2008
    • Place of Presentation
      福島,飯坂ホテル聚楽
    • Year and Date
      20080000
  • [Presentation] 極小出現区間を用いた頻出エピソード発見アルゴリズムの高速化2008

    • Author(s)
      大谷英行,喜田拓也,宇野毅明,有村博紀
    • Organizer
      情報処理学会jDBフォーラムDBS研
    • Place of Presentation
      小樽市民会館
    • Year and Date
      20080000
  • [Presentation] A Fast Algorithm for Cofactor Implication Checking and Its Application for Knowledge Discovery2008

    • Author(s)
      S. Minato
    • Organizer
      Proc. IEEE CIT 2008
    • Place of Presentation
      Sydney, Australia
    • Year and Date
      2008-07-08
  • [Book] 英語で学ぶ計算理論2008

    • Author(s)
      Thomas Zeugnann,湊真一,大久保好章
    • Total Pages
      222
    • Publisher
      コロナ社
  • [Remarks]

    • URL

      http://www-ikn.ist.hokudai.ac.jprarim/

URL: 

Published: 2013-07-31  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi