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

Efficient Pattern Discovery from Massive Semi-Structured Data for Knowledge Infrastructure Formation on the Web

Research Project

Project/Area Number 17002008
Research Category

Grant-in-Aid for Specially Promoted Research

Allocation TypeSingle-year Grants
Review Section Science and Engineering
Engineering
Research InstitutionHokkaido University

Principal Investigator

ARIMURA Hiroki  Hokkaido University, Grad. School of IST., Prof. (20222763)

Co-Investigator(Kenkyū-buntansha) KIDA Takuya  Hokkaido Univ., Grad. School of IST., Assoc. Prof. (70343316)
MINATO Shin-ichi  Hokkaido Univ., Grad School of IST., Assoc. Prof. (10374612)
ITO Kimihito  Hokkaido Univ., Research Center for Zoonosis Control, Assoc. Prof. (60396314)
Project Period (FY) 2005 – 2007
Project Status Completed (Fiscal Year 2007)
Budget Amount *help
¥142,090,000 (Direct Cost: ¥109,300,000、Indirect Cost: ¥32,790,000)
Fiscal Year 2007: ¥9,490,000 (Direct Cost: ¥7,300,000、Indirect Cost: ¥2,190,000)
Fiscal Year 2006: ¥75,660,000 (Direct Cost: ¥58,200,000、Indirect Cost: ¥17,460,000)
Fiscal Year 2005: ¥56,940,000 (Direct Cost: ¥43,800,000、Indirect Cost: ¥13,140,000)
Keywordsknowledge infrastructure formation / semi-structured data / data mining / optimized pattern discovery / knowledge society / knowledge indexing / information extraction / sequence and tree mining / 知識索引構造 / 極太パターン発見 / グラフマイニング
Research Abstract

By rapid progress of network and storage technologies for the last decade, a huge amount of weakly structured electronic data of various types, called semi-structured data, become available over the Internet. In this research project, we study efficient semi-structured data mining technologies that supports human's discovery of useful knowledge from massive collections of semi-structured data. In particular, we develop high-speed semi-structured data mining engines as a core of large-scale knowledge Infrastructure formation from the Internet and establish their architecture and base technologies. In particular, we have studied the following research topics:
1. High-speed semi-structured data mining technologies. We developed efficient depth-first mining algorithms for sequences and trees based on the rightmost expansion technique, proposed by Hiroki Arimura and other researchers. We also devised various optimization techniques in frequent and maximal pattern mining frameworks. We made t … More heoretical analysis of their computational complexity, and show that they are actually polynomial delay and polynomial space complexity enumeration algorithms, which means that they can be used as light-weight and high-throughput mining engines. From theory point of view, they are the first maximal pattern mining algorithms for non-trivial subclasses of semi-structured data having theoretically guaranteed performance.
2. Knowledge indexing technologies. The pre- and post-processing of the data and patterns are important issues for the next-generation data mining. We developed an efficient knowledge indexing data structure, called VSOP, based on Zero-suppressed BDD (ZBDD) proposed by Shin-ichi Minato. VSOP is a compressed indexing structure for discrete structure, equipped with a rich set of algebraic manipulation operators for compressed transactions and itemsets. On the top of VSOP, we devised efficient data mining algorithms that can extract interesting structures hidden in a huge input dataset in an highly interactive way.
3. Knowledge federation technologies. We combine semi-structured data processing techniques with information retrieval and information extraction from the web and stream data. As results, we developed fast pattern matching algorithms for multi-dimensional numerical streams based on bit-parallel techniques and semi-automatic information extraction algorithms from the Web based on demonstration-by-example. We also implemented a set of knowledge discovery tools based on our algorithms and technologies devised in this project. We also made experiments to evaluate the prototype system on real world data on the Web and in Bioinformatics fields. Less

Report

(7 results)
  • 2013 Self-evaluation (Follow-up Assessment) ( PDF )   Comments (Follow-up Assessment) ( PDF )
  • 2012 Abstract(Follow-up Assessment) ( PDF )
  • 2007 Annual Research Report   Final Research Report Summary
  • 2006 Annual Research Report
  • 2005 Annual Research Report
  • Research Products

    (114 results)

All 2008 2007 2006 2005 Other

All Journal Article (92 results) (of which Peer Reviewed: 43 results) Presentation (10 results) Book (11 results) Remarks (1 results)

  • [Journal Article] Intellectual Property Protection for Multimedia Information Technology, A Visual Environment for DOM-based Wrapping and Client-side Linkage of Web Application2008

    • Author(s)
      K. Ito, Y. Tanaka
    • Journal Title

      IGI Global

      Pages: 219-240

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Genetically destined potentials for N-linked glycosylation associated with antigenic changes of influenza virus hemagglutinin2008

    • Author(s)
      Igarashi, M., Ito, K., Kida, H., Takada, A.
    • Journal Title

      Virology (In press)

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

    • Author(s)
      上村卓史・喜田拓也・有村博紀
    • Journal Title

      情報処理学会論文誌:データベース(TOD) Vol.38(In press)

    • NAID

      110007990001

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence2007

    • Author(s)
      Hiroki Arimura, Takeaki Uno
    • Journal Title

      Journal of Combinatorial Optimization Vol. 13

      Pages: 243-262

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Frequent Closed Item Set Mining Based on Zero-suppressed BDDs2007

    • Author(s)
      Shin-ichi Minato, Hiroki Arimura
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence Vol. 22, No. 2

      Pages: 165-172

    • NAID

      130000058332

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Symmetric Item Set Mining Method Using Zero-suppressed BDDs and Application to Biological Data2007

    • Author(s)
      Shin-ichi Minato, Kimihito Ito
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence Vol. 22, No. 2

      Pages: 300-308

    • NAID

      130000058331

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Hardness results on local multiple alignment of biological sequences2007

    • Author(s)
      Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono
    • Journal Title

      IPSJ Transactions on Bioinformatics Vol. 48, No. SIG5(TBIO)

      Pages: 30-38

    • NAID

      110006242960

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] データインテンシブコンピューティングその2-頻出アイテム集合発見アルゴリズム-2007

    • Author(s)
      宇野毅明, 有村博紀
    • Journal Title

      人工知能学会誌 Vol. 22

      Pages: 425-436

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] プロパティ接尾辞木のオフライン線形時間構築アルゴリズム2007

    • Author(s)
      上村卓史, 喜田拓也, 有村博紀
    • Journal Title

      電子情報通信学会論文誌 Vol. J91-D

      Pages: 595-607

    • NAID

      110007380997

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] N-gram Analysis Based on Zero-suppressed BDDs2007

    • Author(s)
      Shin-ichi Minato
    • Journal Title

      Lecture Notes in Computer Science Vol. 4384

      Pages: 289-300

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary 2006 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-suppressed BDDs2007

    • Author(s)
      S. Minato, K. Satoh, T. Sato
    • Journal Title

      In Proc. of 20th International Joint Conference of Artificial Intelligence (IJCAI-2007)

      Pages: 2550-2555

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] An Efficient Algorithm for Complex Pattern Matching over Continuous Data Streams Based on Bit-Parallel Method2007

    • Author(s)
      Tomoya Saito, Takuya Kida, Hiroki Arimura
    • Journal Title

      The Third IEEE International Workshop on Databases for Next-Generation Researchers (SWOD'07)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary 2006 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Method of Variable Ordering for Zero-suppressed Binary Decision Diagrams in Data Mining Applica2007

    • Author(s)
      H. Iwasaki, S. Minato, T. Zeugmann
    • Journal Title

      The Third IEEE International Workshop on Databases for Next-Generation Researchers (SWOD'07)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Time and Space Efficient Discovery of Maximal Geometric Graphs2007

    • Author(s)
      H. Arimura, T. Uno, et al.
    • Journal Title

      Lecture Notes in Computer Science Vol. 4755

      Pages: 219-230

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining2007

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

      Lecture Notes in Computer Science Vol. 4755

      Pages: 42-55

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Mining Maximal Flexible Patterns in a Sequence2007

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

      Lecture Notes in Computer Science Vol. 4914

      Pages: 307-317

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] A Theoretical Study on Variable Ordering of Zero-suppressed BDDs for Representing Frequent Itemsets2007

    • Author(s)
      S. Minato
    • Journal Title

      Lecture Notes in Computer Science Vol. 4914

      Pages: 139-150

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Frequent Pattern Mining and Knowledge Indexing Based on Zero-suppressed BDDs2007

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

      Lecture Notes in Computer Science Vol. 4747

      Pages: 152-169

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Efficient Algorithms for Finding Frequent Substructures from Semi-Structured Data Streams2007

    • Author(s)
      T. Asai, K. Abe, S. Kawasoe, H. Arimura, S. Arikawa
    • Journal Title

      Lecture Notes in Computer Science Vol. 3609

      Pages: 29-45

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence2007

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

      Journal of Combinatorial Optimization Vol. 13

      Pages: 243-262

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Frequent Closed Item Set Mining Based on Zero-suppressed BDDs2007

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

      Transactions of the Japanese Society for Artificial Intelligence Vol. 22, No. 2

      Pages: 165-172

    • NAID

      130000058332

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Symmetric Item Set Mining Method Using Zero-suppressed BDDs and Application to Biological Data2007

    • Author(s)
      S. Minato, K. Ito
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence Vol. 22, No. 2

      Pages: 300-308

    • NAID

      130000058331

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Hardness results on local multiple alignment of biological sequences2007

    • Author(s)
      Tatsuya Akutsu, H. Arimura, Shinichi Shimozono
    • Journal Title

      IPSJ Transactions on Bioinformatics Vol. 48, No. SIG 5(TBIO)

      Pages: 30-38

    • NAID

      110006242960

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Data intensive computing No. 2 : frequent itemset mining algorithms (in Japanese)2007

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

      Transactions of the Japanese Society for Artificial Intelligence Vol. 22

      Pages: 425-436

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] A Linear-Time Off-Line Construction of Property Suffix Trees (in Japanese)2007

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

      IEICE Transactions on Information and Systems Vol. J91-D

      Pages: 595-607

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] N-gram Analysis Based on Zero-suppressed BDDs2007

    • Author(s)
      S. Minato
    • Journal Title

      Lecture Notes in Computer Science Vol. 4384

      Pages: 289-300

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-suppressed BDDs2007

    • Author(s)
      S. Minato, K. Satoh, T. Sato
    • Journal Title

      Proc. of 20th International Joint Conference of Artificial Intelligence (IJCAI-2007)

      Pages: 2550-2555

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] An Efficient Algorithm for Complex Pattern Matching over Continuous Data Streams Based on Bit-Parallel Method2007

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

      Proc. the Third IEEE International Workshop on Databases for Next-Generation Researchers (SWOD'07)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] A Method of Variable Ordering for Zero-suppressed Binary Decision Diagrams in Data Mining Applica2007

    • Author(s)
      H. Iwasaki, S. Minato, T. Zeugmann
    • Journal Title

      Proc. the Third IEEE International Workshop on Databases for Next-Generation Researchers (SWOD'07)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Time and Space Efficient Discovery of Maximal Geometric Graphs2007

    • Author(s)
      H. Arimura, T. Uno, et al
    • Journal Title

      Lecture Notes in Computer Science Vol. 4755

      Pages: 219-230

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams2007

    • Author(s)
      T. Asai, K. Abe, S. Kawasoe, H. Arimura, S. Arikawa
    • Journal Title

      Lecture Notes in Computer Science Vol. 3609

      Pages: 29-45

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Information Science Reference, From planning tools to intelligent assistants : meme media and logic programming technologies2007

    • Author(s)
      N. Lamonova, K. Ito, Y. Tanaka
    • Journal Title

      IGI

      Pages: 170-182

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Intelligent Assistant Systems : Concepts, Techniques and Technologies, Building intelligent multimodal assistants based on logic programming in the meme media architecture2007

    • Author(s)
      K. Ito
    • Journal Title

      IGI

      Pages: 146-169

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Frequent Closed Item Set Mining Based on Zero-suppressed BDDs2007

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

      Information and Media Technologies(IMT) Vol.2

      Pages: 309-316

    • NAID

      130000058332

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Hardness results on local multiple alignment of biological sequences2007

    • Author(s)
      T. Akutsu, H. Arimura, S. Shimozono
    • Journal Title

      IPSJ Trans.on Bioinformatics Vol.48

      Pages: 30-38

    • NAID

      110006242960

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] データインテンシブコンピューティングその2-頻出アイテム集合発見アルゴリズム-2007

    • Author(s)
      宇野毅明・有村博紀
    • Journal Title

      人工知能学会誌 Vol.22

      Pages: 425-436

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

    • Author(s)
      上村卓史・喜田拓也・有村博紀
    • Journal Title

      電子情報通信学会論文誌 Vol.J91-D

      Pages: 595-607

    • NAID

      110007380997

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Time and Space Efficient Discovery of Maximal Geometric Graphs2007

    • Author(s)
      H. Arimura, T. Uno, et. al.
    • Journal Title

      Lecture Notes in Computer Science Vol.4755

      Pages: 219-230

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining2007

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

      Lecture Notes in Computer Science Vol.4755

      Pages: 42-55

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Mining Maximal Flexible Patterns in Sequence2007

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

      Lecture Notes in Computer Science Vol.4914

      Pages: 307-317

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Theoretical Study on Variable Ordering of Zero-suppressed BDDs for Representing Frequent Itemsets2007

    • Author(s)
      S, Minato
    • Journal Title

      Lecture Notes in Computer Science Vol.4914

      Pages: 139-150

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Frequent Pattern Mining and Knowledge Indexing Based on Zero-suppressed BDDs2007

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

      Lecture Notes in Computer Science Vol.4747

      Pages: 152-169

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams2007

    • Author(s)
      T. Asai, K. Abe, S. Kawasoe, H. Arimura, S. Arikawa
    • Journal Title

      Lecture Notes in Computer Science Vol.3609

      Pages: 29-45

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence2007

    • Author(s)
      Hiroki Arimura, Takeaki Uno
    • Journal Title

      Journal of Combinatorial Optimization Vol.13

      Pages: 243-262

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Frequent Closed Item Set Mining Based on Zero-suppressed BDDs2007

    • Author(s)
      Shin-ichi Minato, Hiroki Arimura
    • Journal Title

      Information and Media Technologies (IMT) Vo1.2, No.1

      Pages: 309-316

    • NAID

      130000058332

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Symmetric Item Set Mining Method Using Zero-suppressed BDDs and Application to Biological Data2007

    • Author(s)
      Shin-ichi Minato, Kimihito Ito
    • Journal Title

      Information and Media Technologies (IMT) Vol.2

      Pages: 300-308

    • NAID

      130000058331

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Hardness results on local multiple alignment of biological sequences2007

    • Author(s)
      Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono
    • Journal Title

      IPSJ Transactions on Bioinformatics Vol.48, No.SIG 5(TBIO)

      Pages: 30-38

    • NAID

      110006242960

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-suppressed BDDs2007

    • Author(s)
      S.Minato, K.Satoh, T.Sato
    • Journal Title

      In Proc. of 20th International Joint Conference of Artificial Intelligence (IJCAI-2007)

      Pages: 2550-2555

    • Related Report
      2006 Annual Research Report
  • [Journal Article] A Method of Variable Ordering for Zero-suppressed Binary Decision Diagrams in Data Mining Applica2007

    • Author(s)
      H.Iwasaki, S.Minato, T.Zeugmann
    • Journal Title

      The Third IEEE International Workshop on Databases for Next-Generation Researchers (SWOD'07)

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Meme media for clipping and combining web resources2006

    • Author(s)
      Y. Tanaka, K. Ito, J. Fujima
    • Journal Title

      World Wide Web Vol. 9, Issue. 2

      Pages: 117-142

    • NAID

      120000957436

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] VSOP (Valued-Sum-of-Products) Calculator for Knowledge Precessing Based on Zero-Suppressed BDDs2006

    • Author(s)
      S. Minato
    • Journal Title

      Lecture Notes in Computer Science 3847

      Pages: 40-58

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] A Meme Media Framework for Introducing Multimodal User Interface to Existing Web Applications2006

    • Author(s)
      Kimihito Ito
    • Journal Title

      Information Modelling And Knowledge Bases XVII

      Pages: 83-93

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary 2005 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Faster Pattern Matching Algorithm for Arc-Annotated Sequences2006

    • Author(s)
      Takuya Kida
    • Journal Title

      Lecture Notes in Computer Science Vol. 3847

      Pages: 25-39

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary 2006 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficient Database Analysis Using VSOP Calculator Based on Zero-suppressed BDDs2006

    • Author(s)
      Shin-ichi Minato
    • Journal Title

      Lecture Notes in Computer Science Vol. 4012

      Pages: 169-181

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary 2006 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 単語幅を制約した接尾辞木の効率のよい構築アルゴリズム2006

    • Author(s)
      上村卓史, 喜田拓也, 有村博紀
    • Journal Title

      情報科学技術レターズ, 電子情報通信学会情報処理学会 Vol. 5

      Pages: 5-8

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] VSOP (Valued-Sum-of-Products) Calculator for Knowledge Precessing Based on Zero-Suppressed BDDs2006

    • Author(s)
      S. Minato
    • Journal Title

      Lecture Notes in Computer Science Vol. 3847

      Pages: 40-58

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] A Meme Media Framework for Introducing Multimodal User Interface to Existing Web Applications2006

    • Author(s)
      K. Ito
    • Journal Title

      Information Modelling And Knowledge Bases XVII

      Pages: 83-93

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Faster Pattern Matching Algorithm for Arc-Annotated Sequences2006

    • Author(s)
      T. Kida
    • Journal Title

      Lecture Notes in Computer Science Vol. 3847

      Pages: 25-39

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Efficient Database Analysis Using VSOP Calculator Based on Zero-suppressed BDDs2006

    • Author(s)
      S. Minato
    • Journal Title

      Lecture Notes in Computer Science Vol. 4012

      Pages: 169-181

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Efficient Algorithm of Constructing Suffix Tree with Word Count Limitation (in Japanese)2006

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

      Information Technology Letters, IEICE, IPSJ

      Pages: 5-8

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Computational Challenges of Massive Data Sets and Randomness in Computation, Special Issue on the First and Second Japanese-German Frontiers of Science Symposia2006

    • Author(s)
      J. Rothe, H. Arimura
    • Journal Title

      Journal of Universal Computer Science Vol.12, issue 6

      Pages: 182-182

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Proceedings of Int'l Workshop on Data Mining and Statistical Science (DMSS-2006)2006

    • Author(s)
      H. Arimura, T. Washio, K. Satoh, T. Higuchi, K. Ito, S. Hirano
    • Journal Title

      IGI

      Pages: 225-225

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] 単語幅を制約した接尾辞木の効率のよい構築アルゴリズム2006

    • Author(s)
      上村卓史, 喜田拓也, 有村博紀
    • Journal Title

      情報科学技術レターズ,電子情報通信学会情報処理学会

    • Related Report
      2006 Annual Research Report
  • [Journal Article] VSOP(Valued-Sum-of-products)Calculator for knowledge precessing Based on Zero-Suppressed BDDs2006

    • Author(s)
      S.Minato
    • Journal Title

      Federation over the Web LNAI 3847

      Pages: 40-58

    • Related Report
      2005 Annual Research Report
  • [Journal Article] インフルエンザウイルスの抗原変異予測のためのコンピュータ解析2006

    • Author(s)
      伊藤公人
    • Journal Title

      人獣共通感染症リサーチセンター第一回学術講演会

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Faster Pattern Matching Algorithm for Arc-Annotated Sequences2006

    • Author(s)
      Takuya Kida
    • Journal Title

      Proceedings of Dagstuhl Workshop on Federation over the Web LNAI3847

      Pages: 25-39

    • Related Report
      2005 Annual Research Report
  • [Journal Article] 飽和集合列挙アルゴリズムを用いた大規模データベースからのルール発見手法2005

    • Author(s)
      宇野毅明, 有村博紀
    • Journal Title

      統計数理, 統計数理研究所 第53巻第2号

      Pages: 317-329

    • NAID

      120006019088

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] ゼロサプレス型二分決定グラフを用いたトランザクションデータベースの効率的解析手法2005

    • Author(s)
      湊真一, 有村博紀
    • Journal Title

      電子情報通信学会論文誌D Vol. J89-D, No. 2

      Pages: 172-182

    • NAID

      110004669938

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence2005

    • Author(s)
      Hiroki Arimura, Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science Vol. 3827

      Pages: 724-737

    • NAID

      110003225066

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees2005

    • Author(s)
      Hiroki Arimura, Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science Vol. 3625

      Pages: 1-19

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] LCM ver. 3 : Collaboration of Array, Bitmap and Prefix Tree for Frequent Itemset Mining2005

    • Author(s)
      Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
    • Journal Title

      Proc. OSDM 2005

      Pages: 77-86

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Key Semantics Extraction by Dependency Tree Mining2005

    • Author(s)
      S. Morinaga, H. Arimura, 他3名
    • Journal Title

      roc. 11th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD'05)

      Pages: 666-671

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Finding Simple Disjoint Decompositions in Frequent Itemset Data Using Zero-suppressed BDD2005

    • Author(s)
      S. Minato
    • Journal Title

      Proc. of IEEE ICDM 2005 workshop on Computational Intelligence in Data Mining ISBN-0-9738918-5-8

      Pages: 3-11

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Efficient Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs2005

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

      Proc. IEEE/IEICE/IPSJ Int'l Workshop on Challenges in Web Information Retrieval and Integration (WIRI-2005)

      Pages: 3-10

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Meme Media and Logic Programming Approach for Intelligent Media Systems2005

    • Author(s)
      Kimihito Ito
    • Journal Title

      Proc. the 2005 International Conference on Active Media Technology (AMT2005)

      Pages: 611-616

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Rule discovery from large databases using closed sets enumeration algorithms (in Japanese)2005

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

      Proceedings of the Institute of Statistical Mathematics (Journal) Vol. 53, No. 2

      Pages: 317-329

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Efficient Method of Transaction Database Analysis Using Zero-Suppressed BDDs (in Japanese)2005

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

      IEICE Transactions on Information and Systems Vol. J89-D, No. 2

      Pages: 172-182

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence2005

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

      Lecture Notes in Computer Science Vol. 3827

      Pages: 724-737

    • NAID

      110003225066

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees2005

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

      Lecture Notes in Computer Science Vol. 3625

      Pages: 1-19

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] LCM ver. 3 : Collaboration of Array, Bitmap and Prefix Tree for Frequent Itemset Mining2005

    • Author(s)
      T. Uno, M. Kiyomi, H. Arimura
    • Journal Title

      Proc. OSDM 2005, in conjunction with ACM KDD 2005

      Pages: 77-86

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Key Semantics Extraction by Dependency Tree Mining2005

    • Author(s)
      S. Morinaga, H. Arimura, et al
    • Journal Title

      Proc. 11th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD'05)

      Pages: 666-671

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Meme Media and Logic Programming Approach for Intelligent Media Systems2005

    • Author(s)
      K. Ito
    • Journal Title

      Proc. the 2005 International Conference on Active Media Technology (AMT2005)

      Pages: 611-616

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Special Issue on Algorithmic Learning Theory2005

    • Author(s)
      S. Jain, H. Arimura
    • Journal Title

      Theoretical Computer Science 348(1-2), Elsevier

      Pages: 237-237

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Text Mining (in Japanese)2005

    • Author(s)
      H. Arimura
    • Journal Title

      In Encyclopedia of Artificial Intelligence, JSAI (eds.), (Kyoritsu Publisher)

      Pages: 676-677

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] 飽和集合列挙アルゴリズムを用いた大規模データベースからのルール発見手法2005

    • Author(s)
      宇野毅明, 有村博紀
    • Journal Title

      統計数理(統計数理研究所) 第53巻第2号

      Pages: 317-329

    • NAID

      120006019088

    • Related Report
      2005 Annual Research Report
  • [Journal Article] ゼロサプレス型二分決定グラフを用いたトランザクションデータベースの効率的解析手法2005

    • Author(s)
      湊真一, 有村博紀
    • Journal Title

      電子情報通信学会論文誌D Vol.J89-D No.2

      Pages: 172-182

    • NAID

      110004669938

    • Related Report
      2005 Annual Research Report
  • [Journal Article] A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence2005

    • Author(s)
      Hiroki Arimura, Takeaki Uno
    • Journal Title

      Proc.the 16th Annual International Symposium on Algorithmsand Computation(ISAAC'05) LNCS3827

      Pages: 724-737

    • NAID

      110003225066

    • Related Report
      2005 Annual Research Report
  • [Journal Article] An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees2005

    • Author(s)
      Hiroki Arimura, Takeaki Uno
    • Journal Title

      Proc.15th International Conference on Inductive Logic Programming(ILP'05) LNAI3625

      Pages: 1-19

    • Related Report
      2005 Annual Research Report
  • [Journal Article] LCM ver.3 : Collaboration of Array, Bitmap and Prefix Tree for Frequent Itemset Mining2005

    • Author(s)
      Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
    • Journal Title

      Proc.OSDM2005, in conjunction with ACM SIGKDD'05

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Key Semantics Extraction by Dependency Tree Mining2005

    • Author(s)
      S.Morinaga, H.Arimura, 他3名
    • Journal Title

      Proc.11th ACM SIGKDD Int'l Conf. Decompositons on Knowledge Discovery and Data Mining(KDD'05)

      Pages: 666-671

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Finding Simple Disjoint in Frequent Itemset Data Using Zero-suppressed BDD2005

    • Author(s)
      S.Minato
    • Journal Title

      Proc. of IEEE ICDM 2005 workshop on Computational Intelligence in Data Mining ISBN-0-97389 18-5-8

      Pages: 3-11

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Efficient Combinatorial Item Set Analysis Based on Zero-Suppressed BBDs2005

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

      Proc. IEEE/IEICE/IPSJ Int'l workshop on Challenges in Web Information Retrieval and Integration(WIRI-2005)

      Pages: 3-10

    • Related Report
      2005 Annual Research Report
  • [Presentation] ブラウジング支援のための一覧性の高いキーワードリストの抽出2008

    • Author(s)
      上村卓史, 喜田拓也, 有村博紀
    • Organizer
      情報処理学会第70回全国大会
    • Place of Presentation
      筑波・筑波大学
    • Year and Date
      2008-03-14
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] ブラウジング支援のための一覧性の高いキーワードリストの抽出2008

    • Author(s)
      上村卓史・喜田拓也・有村博紀
    • Organizer
      情報処理学会第70回全国大会
    • Place of Presentation
      筑波
    • Year and Date
      2008-03-14
    • Related Report
      2007 Annual Research Report
  • [Presentation] インフルエンザウイルスの抗原変異予測のためのコンピュータ解析2008

    • Author(s)
      伊藤公人
    • Organizer
      人獣共通感染症リサーチセンター第一回学術講演会
    • Place of Presentation
      札幌・北海道大学
    • Year and Date
      2008-02-13
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Computational analysis of antigenic changes of influenza virus hemagglutinin (invited talk)2008

    • Author(s)
      K. Ito
    • Organizer
      The 1^<st> Academic Seminar, Hokkaido University Research Center for Zoonosis Control
    • Place of Presentation
      Sapporo (in Japanese)
    • Year and Date
      2008-02-13
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Web browsing support by extracting comprehensive keywords (The first author awarded the 70-th IPSJ Annual Meeting best paper award for young scientists)2008

    • Author(s)
      T. Uemura, T. Kida, H. Arimura
    • Organizer
      The 70-th IPSJ Annual Meeting, Marth
    • Place of Presentation
      Tsukuba (in Japanese)
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] 二分決定グラフ(BDD)を活用したデータマイニング・知識発見技術の最近の話題2007

    • Author(s)
      湊真一
    • Organizer
      電子情報通信学会人工知能と知識処理研究会
    • Place of Presentation
      東京・機械振興会館
    • Year and Date
      2007-05-31
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] An Efficient Algorithm for Complex Pattern Matching over Continuous Data Streams Based on Bit-Parallel Method2007

    • Author(s)
      T. Saito, T. Kida, H. Arimura
    • Organizer
      The Third IEEE International Workshop on Data bases for Next-Generation Researchers (SWOD'07)
    • Place of Presentation
      Istanbul,Turkey
    • Year and Date
      2007-04-15
    • Related Report
      2007 Annual Research Report
  • [Presentation] Recent Topics on Data Mining and Knowledge Discovery Using Binary Decision Diagrams (invited talk)2007

    • Author(s)
      S. Minato
    • Organizer
      IEICE SIG-AI seminar
    • Place of Presentation
      Tokyo (in Japanese)
    • Year and Date
      2007-03-31
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] 特別推進研究-知識基盤形成のための大規模半構造データからの超高速パターン発見-2006

    • Author(s)
      有村博紀
    • Organizer
      情報学シンポジウム(日本学術会議, 情報処理学会, 国際学術連合科学技術データ委員会他)
    • Place of Presentation
      東京
    • Year and Date
      2006-01-17
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Grant-in-Aid for Specially Promoted Research : Efficient Pattern Discovery from Massive Semi-Structured Data for Knowledge Infrastructure Formation on the Web (invited talk)2005

    • Author(s)
      H. Arimura
    • Organizer
      Informatics Symposium, JSPS, IPSJ, CODATA
    • Place of Presentation
      Tokyo (in Japanese)
    • Year and Date
      2005-01-17
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Intellectual Property Protection for Multimedia Information Technology, A Visual Environment for DOM-based Wrapping and Client-side Linkage of Web Application2008

    • Author(s)
      K. Ito, Y. Tanaka
    • Publisher
      IGI Global
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Information Science Reference, From planning tools to intelligent assistants : meme media and logic programming technologies2007

    • Author(s)
      N. Lamonova, K. Ito, Y. Tanaka
    • Publisher
      IGI
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Intelligent Assistant Systems : Concepts, Techniques and Technologies, Building intelligent multimodal assistants based on logic programming in the meme media architecture.2007

    • Author(s)
      K. Ito
    • Publisher
      IGI
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Computational Challenges of Massive Data Sets and Randomness in Computation, Special Issue on the First and Second Japanese-German Frontiers of Science Symposia, Journal of Universal Computer Sci., Vol. 12, issue 62006

    • Author(s)
      Jorg Rothe, Hiroki Arimura
    • Total Pages
      182
    • Publisher
      Journal of Universal Computer Science
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Proceedings of Int'l Workshop on Data Mining and Statistical Science (DMSS-2006)2006

    • Author(s)
      H. Arimura, T. Washio, K. Satoh, T. Higuchi, K. Ito, S. Hirano
    • Total Pages
      225
    • Publisher
      DMSS2006
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Computational Challenges of Massive Data Sets and Randomness in Computa, Special Issue on the First and SecondJapanese-German Frontiers of Science Symposia, Journal of Universal Computer Sci., Vol. 12,issue 62006

    • Author(s)
      Jorg Rothe, Hiroki Arimura
    • Total Pages
      182
    • Publisher
      Journal of Universal Computer Science
    • Related Report
      2006 Annual Research Report
  • [Book] Proceedings of Int'l Workshop on Data Mining and Statistical Science (DMSS-2006)2006

    • Author(s)
      H.Arimura, T.Washio, K.Satoh, T.Higuchi, K.Ito, S.Hirano
    • Total Pages
      225
    • Publisher
      DMSS2006
    • Related Report
      2006 Annual Research Report
  • [Book] Special Issue on Algorithmic Learning Thoery, Theoretical Computer Science, 348(1-2)2005

    • Author(s)
      Sanjay Jain, Hiroki Arimura
    • Total Pages
      237
    • Publisher
      Elsevier
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] 人工知能学辞典, (編)人工知能学会, 小項目「テキストマイニング」2005

    • Author(s)
      有村博紀
    • Publisher
      共立出版
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Special Issue on Algorithmic Learning Theory2005

    • Author(s)
      Sanjay Jain, Hiroki Arimura
    • Publisher
      Theoretical Computer Science, 348(1-2), Elsevier
    • Related Report
      2005 Annual Research Report
  • [Book] 人工知能学辞典(小項目 「テキストマイニング」)((編)人工知能学会)2005

    • Author(s)
      有村博紀
    • Publisher
      共立出版
    • Related Report
      2005 Annual Research Report
  • [Remarks] 「研究成果報告書概要(和文)」より

    • URL

      http://www-ikn.ist.hokudai.ac.jp/tokusui/

    • Related Report
      2007 Final Research Report Summary

URL: 

Published: 2005-04-01   Modified: 2018-03-28  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi