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

Arimura Hiroki  有村 博紀

ORCIDConnect your ORCID iD *help
… Alternative Names

ARIMURA Hiroki  有村 博紀

有村 博紀  アリムラ ヒロキ

Less
Researcher Number 20222763
Other IDs
External Links
Affiliation (Current) 2025: 北海道大学, 情報科学研究院, 教授
Affiliation (based on the past Project Information) *help 2019 – 2024: 北海道大学, 情報科学研究院, 教授
2011 – 2018: 北海道大学, 情報科学研究科, 教授
2007 – 2011: Hokkaido University, Grad. School of IST., Prof.
2006: 北海道大学, 大学院情報科学研究科, 教授
2004 – 2005: 北海道大学, 大学院・情報科学研究科, 教授 … More
2000 – 2003: 九州大学, 大学院・システム情報科学研究院, 助教授
1996 – 2001: 九州大学, 大学院・システム情報科学研究科, 助教授
1998: 九州大学, 大学院システム情報科学研究科, 助教授
1995: 九州工業大学, 情報工学部, 助教授
1992 – 1993: 九州工業大学, 情報工学部, 助手 Less
Review Section/Research Field
Principal Investigator
Intelligent informatics / Science and Engineering / Intelligent informatics / Media informatics/Database / Medium-sized Section 61:Human informatics and related fields / Medium-sized Section 60:Information science, computer engineering, and related fields / Intelligent informatics / Multimedia database / Engineering / Science and Engineering / Complex systems … More
Except Principal Investigator
… More Intelligent informatics / Transformative Research Areas, Section (IV) / Intelligent informatics / Computer system / 計算機科学 / Science and Engineering Less
Keywords
Principal Investigator
データマイニング / 半構造データ / XML / 情報抽出 / ウェブマイニング / 知識獲得 / 最適パターン発見 / 機械学習 / 知識発見 / ストリーム処理 … More / 大規模知識索引 / 情報検索 / パターン照合 / グラフマイニング / data mining / KDD / 文脈性 / 多重性 / 大規模知識処理 / ストリームデータ処理 / 知識基盤形成 / semi-structured data / HTML / 高次元非構造データ検索 / 非構造データ / ビッグデータ / 知識索引 / イベントストリーム処理 / 大規模半構造データ / 半構造マイニング / XPath / パターン発見 / データストリーム / 文法圧縮 / 系列パターン / XMLデータ / データストリームマイニング / 帰納論理プログラミング / パターン言語 / 最小汎化 / データベースからの知識獲得 / 次世代機械学習技術 / 離散構造学習 / 大規模列挙 / 大規模並列列挙 / 並列ソルバー / 複雑パターン / 時空間データマイニング / 意味マイニング / QBFソルバー / sequence and tree mining / information extraction / knowledge indexing / knowledge society / optimized pattern discovery / knowledge infrastructure formation / 極太パターン発見 / 知識索引構造 / 系列と木マイニング / 知識集約型技術 / tree mining / Xpath / sequence discovery / pattern matching / XML data / data stream / オンライン半構造データ検索 / 大規模ネットワークデータ / 高速データストリーム / 半構造データ技術 / 木マイニング / Pattern matching / Data compression / Machine learning / Information extraction / Semi-structured data / Web Mining / 主施律の類似性 / 文字列照合 / 類似性指標 / 和歌データ / 語相関パターン / テキストデータ / データ圧縮 / 接尾辞配列 / 半構造化テキスト / Webマイニング / 類似画像検索技術 / オープン・イノベーション・プラットフォーム / 国際標準化 / データベース / バイオミメティクス / イベント照合 / 超低メモリアルゴリズム / 部分超グラフ列挙 / 半構造マイニングエンジン / ZDD / 群パターンマイニング / トラジェクトリ照合 / 高次元データ検索 / ウェブページ / 極大パターン発見 / エピソードマイニング / 頻出パターン発見 / 知識発見とデータマイニング / SAX / 圧縮索引 / ストリーム / オンラインアルゴリズム / ウェブからの情報抽出 / エピソードパターン / Knowledge management / Learning from entailment / ホーン節の学習 / XSLT / 計算学習理論 / テキストマイニング / 大規模知識ベース / ILP (アイ・エル・ピ-) / 一階述語ホーン節 / ILP / 能動学習 / 一階ホーン節 / 帰納論理プログラム / 論理プログラム / テキストデータベース / テキストデータマイニング / 極小多重汎化 / String Pattern Language / 正例からの学習 / 背景知識 / オブジェクト指向データベース … More
Except Principal Investigator
アルゴリズム / データマイニング / 二分決定グラフ / ILP / 離散構造 / 機械学習 / データ構造 / ZDD / BDD / 知的CAI / 知的教育システム / 説明可能性 / 非同期ストリーム索引 / 準最適解集合 / ネットワーク信頼性 / 並列SAT / MSO / 革新的アルゴリズム基盤 / 厳密被覆 / 分子設計 / Answer Set Programming / 圧縮索引 / 部分グラフ数え上げ / 並列型ソルバ / アルゴリズムの社会還元 / アルゴリズム基盤 / 網羅的解析 / グラフアルゴリズム / 索引化 / 演算処理系 / 列挙アルゴリズム / 離散構造処理系 / 列挙 / 最適化 / グラフ理論 / 大規模データ処理 / 組合せ集合 / 論理関数 / ストリーム処理 / リコンフィギュラブル / グラフ処理 / リコンフィギュラブルシステム / 組合せ最適化問題 / イジングモデル / ビッグデータ / abduction / inductive inference / knowledge discovery / 発見 / 反駁推論 / 決定木 / H-map / データマイニングアルゴリズム / 統計的記号モデリング / 抽象値 / 節管理 / 事例ベース / 高速パターンマッチング / 拡張アブダクション / 脳機能画像 / 記号的統計モデリング / アブダクション / 帰納推論 / 知識発見 / Text Database / Data Compression / Sequential Pattern Matching / Information Retrieval / テキストデータベース / 情報圧縮 / 逐次パターン照合 / 情報検索 / 離散構造データ解析 / 木構造データ / グラフ / 木 / 動的計画法 / カーネル法 / 構造化データ / セキュリティ / 計算料理論 / 知識処理 / 情報ネットワーク / データベース解析 / 知識発見とデータマイニング / マイクロワールド / 発見的学習支援 / 環境型CAI / 発見学習支援 / 演えき的学習 / 発見的学習 Less
  • Research Projects

    (30 results)
  • Research Products

    (420 results)
  • Co-Researchers

    (48 People)
  •  社会を志向した革新的アルゴリズムの実装

    • Principal Investigator
      安田 宜仁
    • Project Period (FY)
      2020 – 2024
    • Research Category
      Grant-in-Aid for Transformative Research Areas (A)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      NTT Communication Science Laboratories
  •  Development of Next-generation Semi-Structured Data Mining Technology Towards The Real-World Knowledge Creation InfrastructurePrincipal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      2020 – 2024
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 61:Human informatics and related fields
    • Research Institution
      Hokkaido University
  •  Expansion of efficient search and discovery technology for processing massive data stream in the real worldPrincipal Investigator

    • Principal Investigator
      Arimura Hiroki
    • Project Period (FY)
      2018 – 2020
    • Research Category
      Grant-in-Aid for Challenging Research (Exploratory)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Hokkaido University
  •  Next-generation semi-structured data mining technologies for real-world knowledge infrastructuresPrincipal Investigator

    • Principal Investigator
      Arimura Hiroki
    • Project Period (FY)
      2016 – 2019
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Hokkaido University
  •  Efficient search and discovery technology for processing massive data stream in the real worldPrincipal Investigator

    • Principal Investigator
      Arimura Hiroki
    • Project Period (FY)
      2015 – 2017
    • Research Category
      Grant-in-Aid for Challenging Exploratory Research
    • Research Field
      Multimedia database
    • Research Institution
      Hokkaido University
  •  Reconfigurable Architectures for Accelerating Data Mining

    • Principal Investigator
      Motomura Masato
    • Project Period (FY)
      2015 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Computer system
    • Research Institution
      Hokkaido University
  •  Research on Fundamental Algorithms of Discrete Structure Manipulation Systems

    • Principal Investigator
      MINATO Shin-ichi
    • Project Period (FY)
      2015 – 2019
    • Research Category
      Grant-in-Aid for Scientific Research (S)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyoto University
      Hokkaido University
  •  バイオミメティクス・データベースのオープンイノベーションプラットフォームへの展開Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      2013 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Complex systems
    • Research Institution
      Hokkaido University
  •  Development of Next-Generation Semi-structured Data Mining for Large-Scale Knowledge Base FormationPrincipal Investigator

    • Principal Investigator
      Arimura Hiroki
    • Project Period (FY)
      2012 – 2015
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Hokkaido University
  •  A study on positive-definite and efficient kernels for structured data

    • Principal Investigator
      SHIN Yoshihiro
    • Project Period (FY)
      2011 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Intelligent informatics
    • Research Institution
      University of Hyogo
  •  情報ネットワークにおける大規模知識処理のための超高速アルゴリズムの研究

    • Principal Investigator
      トーマス ツォイクマン (トーマス ツオイクマン)
    • Project Period (FY)
      2009 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Hokkaido University
  •  Next-Generation Semi-structured Data Mining for Large-Scale Knowledge Base FormationPrincipal Investigator

    • Principal Investigator
      ARIMURA Hiroki
    • Project Period (FY)
      2008 – 2011
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Hokkaido University
  •  Research on database analysis algorithms using very large-scale monolithic memory space

    • Principal Investigator
      MINATO Shin-ichi
    • Project Period (FY)
      2008 – 2011
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Intelligent informatics
    • Research Institution
      Hokkaido University
  •  Efficient Pattern Discovery from Massive Semi-Structured Data for Knowledge Infrastructure Formation on the WebPrincipal Investigator

    • Principal Investigator
      ARIMURA Hiroki
    • Project Period (FY)
      2005 – 2007
    • Research Category
      Grant-in-Aid for Specially Promoted Research
    • Review Section
      Science and Engineering
      Engineering
    • Research Institution
      Hokkaido University
  •  最適パターン発見に基づく大規模半構造データからの知的情報獲得システムの開発Principal Investigator

    • Principal Investigator
      ZEUGMANN Thomas, 有村 博紀
    • Project Period (FY)
      2004 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Hokkaido University
  •  超高速データストリームのためのオンライン型半構造情報変換システムの開発Principal Investigator

    • Principal Investigator
      坂本 比呂志, 有村 博紀
    • Project Period (FY)
      2004 – 2005
    • Research Category
      Grant-in-Aid for Exploratory Research
    • Research Field
      Media informatics/Database
    • Research Institution
      Kyushu Institute of Technology
      Hokkaido University
  •  最適パターン発見に基づく大規模半構造データからの知的情報獲得システムの開発Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      2003
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Kyushu University
  •  Study of High-speed Data Mining Algorithms from Massive Data StreamsPrincipal Investigator

    • Principal Investigator
      IKEDA Daisuke, 有村 博紀
    • Project Period (FY)
      2003 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Media informatics/Database
    • Research Institution
      KYUSHU UNIVERSITY
      Hokkaido University
  •  最適パターン発見に基づく大規模半構造データからの知的情報獲得システムの開発Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      2002
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Kyushu University
  •  最適パターン発見に基づく大規模半構造データからの知的情報獲得システムの開発Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      2001
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (C)
    • Review Section
      Science and Engineering
    • Research Institution
      Kyushu University
  •  高度知識ベースを対象とした知識獲得システムの研究Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      1999 – 2000
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyushu University
  •  Development of Efficient Data Mining Systems for Large Semi-Structured Text DataPrincipal Investigator

    • Principal Investigator
      ARIMURA Hiroki
    • Project Period (FY)
      1999 – 2001
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyushu University
  •  Knowledge Discovery by Inferences

    • Principal Investigator
      SATO Taisuke
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (A)
    • Research Institution
      Tokyo Institute of Technology
  •  超大規模データからの高速データマイニング・システムの研究Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      1997
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Research Institution
      Kyushu University
  •  高度知識ベースを対象とした知識獲得システムの研究Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      1997 – 1998
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyushu University
  •  大規模オブジェクト指向データベースを対象とした知識獲得システムの研究Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      1996
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyushu University
  •  大規模オブジエクト指向データベースを対象とした知識獲得システムの研究Principal Investigator

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      1995
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyushu Institute of Technology
  •  Speedup of Text Database by Data Compression

    • Principal Investigator
      SHINOHARA Takeshi
    • Project Period (FY)
      1995 – 1997
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      計算機科学
    • Research Institution
      Kyushu Institute of Technology
  •  概念の理解と知識の定着をはかる知的CAIに関する研究

    • Principal Investigator
      竹内 章
    • Project Period (FY)
      1993
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Research Institution
      Kyushu Institute of Technology
  •  概念の理解と知識の定着をはかる知的CAIに関する研究

    • Principal Investigator
      竹内 章
    • Project Period (FY)
      1992
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Research Institution
      Kyushu Institute of Technology

All 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 Other

All Journal Article Presentation Book

  • [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
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Book] 人工知能学辞典, (編)人工知能学会, 小項目「テキストマイニング」2005

    • Author(s)
      有村博紀
    • Publisher
      共立出版
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Book] 人工知能学辞典(小項目 「テキストマイニング」)((編)人工知能学会)2005

    • Author(s)
      有村博紀
    • Publisher
      共立出版
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Book] Special Issue on Algorithmic Learning Theory2005

    • Author(s)
      Sanjay Jain, Hiroki Arimura
    • Publisher
      Theoretical Computer Science, 348(1-2), Elsevier
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph2023

    • Author(s)
      Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
    • Journal Title

      Lecture Notes in Computer Science, Proc. SPIRE2023,

      Volume: 14240 Pages: 28-34

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Computing the Collection of Good Models for Rule Lists2022

    • Author(s)
      Kota Mata, Kentaro Kanamori, Hiroki Arimura
    • Journal Title

      Proc. the 18th International Conference on Machine Learning and Data Mining (MLDM 2022)

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Cartesian Tree Subsequence Matching2022

    • Author(s)
      Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
    • Journal Title

      Proc. the 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: LIPIcs223

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number2021

    • Author(s)
      Kurita Kazuhiro、Wasa Kunihiro、Uno Takeaki、Arimura Hiroki
    • Journal Title

      Theoretical Computer Science

      Volume: - Pages: 32-41

    • DOI

      10.1016/j.tcs.2021.05.008

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19J10761, KAKENHI-PROJECT-19K20350, KAKENHI-PLANNED-20H05963, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-20H00595
  • [Journal Article] Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization2021

    • Author(s)
      Kanamori Kentaro、Takagi Takuya、Kobayashi Ken、Arimura Hiroki
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence

      Volume: 36 Issue: 6 Pages: C-L44_1-12

    • DOI

      10.1527/tjsai.36-6_C-L44

    • NAID

      130008110420

    • ISSN
      1346-0714, 1346-8030
    • Year and Date
      2021-11-01
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20J20654, KAKENHI-PROJECT-21K17817, KAKENHI-PLANNED-20H05963, KAKENHI-PROJECT-20H00595
  • [Journal Article] DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization2021

    • Author(s)
      #Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura
    • Journal Title

      Proc. the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI 2020)

      Volume: - Pages: 2855-2862

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization.2021

    • Author(s)
      Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
    • Journal Title

      Proceedings of the AAAI Conference on Artificial Intelligence

      Volume: 35(13) Pages: 11564-11574

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Fairness-Aware Decision Tree Editing Based on Mixed- Integer Linear Optimization2021

    • Author(s)
      Kanamori Kentaro、Arimura Hiroki
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence

      Volume: 36 Issue: 4 Pages: B-L13_1-10

    • DOI

      10.1527/tjsai.36-4_B-L13

    • NAID

      130008060598

    • ISSN
      1346-0714, 1346-8030
    • Year and Date
      2021-07-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-20H05963, KAKENHI-PROJECT-20H00595
  • [Journal Article] Efficient enumeration of dominating sets for sparse graphs2021

    • Author(s)
      Kurita Kazuhiro、Wasa Kunihiro、Arimura Hiroki、Uno Takeaki
    • Journal Title

      Discrete Applied Mathematics

      Volume: 303 Pages: 283-295

    • DOI

      10.1016/j.dam.2021.06.004

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K20350, KAKENHI-PLANNED-20H05963, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-20H00595
  • [Journal Article] Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts.2020

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
    • Journal Title

      Algorithmica

      Volume: 82(5) Pages: 1346-1377

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization2020

    • Author(s)
      Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
    • Journal Title

      35th Conference on Aritificial Intelligence (AAAI 2021)

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Journal Article] DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization2020

    • Author(s)
      Kanamori Kentaro、Takagi Takuya、Kobayashi Ken、Arimura Hiroki
    • Journal Title

      Proc. the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence

      Volume: - Pages: 2855-2862

    • DOI

      10.24963/ijcai.2020/395

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Journal Article] Discovery of Regularized Areas with Maximal Confidence from Location Data2019

    • Author(s)
      Hiroya Inakoshi, Tatsuya Asai, Takuya Kida, Hiroki Arimura
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence

      Volume: 34 Issue: 3 Pages: D-I56_1-10

    • DOI

      10.1527/tjsai.D-I56

    • NAID

      130007641593

    • ISSN
      1346-0714, 1346-8030
    • Year and Date
      2019-05-01
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K19771, KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743
  • [Journal Article] Enumeration of Distinct Support Vectors for Interactive Decision Making2019

    • Author(s)
      Kentaro Kanamori, Satoshi Hara, Masakazu Ishihata, Hiroki Arimura
    • Journal Title

      Proceedings of the 2019 ICML Workshop on Human In the Loop Learning (HILL 2019)

      Volume: arXiv:1906.01876

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Fast Identification of Heavy Hitters by Cached and Packed Group Testing2019

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

      Lecture Notes in Computer Science, Springer, the 26th International Symposium on String Processing and Information Retrieval

      Volume: vol.11811 Pages: 241-257

    • DOI

      10.1007/978-3-030-32686-9_17

    • ISBN
      9783030326852, 9783030326869
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K19771, KAKENHI-PROJECT-16H01743
  • [Journal Article] Route graph: joint map-matching by maximizing posterior probability2019

    • Author(s)
      Hiroya Inakoshi, Junichi Shigezumi, Tatsuya Asai, Takuya Kida, Hiroki Arimura
    • Journal Title

      IPSJ Transactions on Mathematical Modeling and Its Applications

      Volume: Vol.12, No.1 Pages: 19-19

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Journal Article] Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score2019

    • Author(s)
      Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, and Hiroki Arimura
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E102.A Issue: 9 Pages: 1159-1170

    • DOI

      10.1587/transfun.E102.A.1159

    • NAID

      130007699483

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2019-09-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K19771, KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743
  • [Journal Article] "Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score"2019

    • Author(s)
      Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, and Hiroki Arimura
    • Journal Title

      IEICE Trans. Inf. and Syst., Special Section on Discrete Mathematics and Its Applications

      Volume: 印刷中

    • NAID

      130007699483

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Journal Article] Route graph: joint map-matching by maximizing posterior probability2019

    • Author(s)
      Hiroya Inakoshi, Junichi Shigezumi, Tatsuya Asai, Takuya Kida, Hiroki Arimura
    • Journal Title

      IPSJ Transactions on Mathematical Modeling and Its Applications

      Volume: Vol.12, No.1 Pages: 43-51

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs2019

    • Author(s)
      Kurita Kazuhiro、Wasa Kunihiro、Uno Takeaki、Arimura Hiroki
    • Journal Title

      Lecture Notes in Computer Science book series

      Volume: 11638 Pages: 339-351

    • DOI

      10.1007/978-3-030-25005-8_28

    • ISBN
      9783030250041, 9783030250058
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-19J10761
  • [Journal Article] "Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score"2019

    • Author(s)
      Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, and Hiroki Arimura
    • Journal Title

      IEICE Trans. Inf. and Syst., Special Section on Discrete Mathematics and Its Applications

      Volume: なし

    • NAID

      130007699483

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts2019

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, and Diptarama Hendrian
    • Journal Title

      Algorithmica

      Volume: Vol.82 Issue: 5 Pages: 1346-1377

    • DOI

      10.1007/s00453-019-00646-w

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K19771, KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743, KAKENHI-PLANNED-20H05963
  • [Journal Article] The Complexity of Induced Tree Reconfiguration Problems2019

    • Author(s)
      WASA Kunihiro、YAMANAKA Katsuhisa、ARIMURA Hiroki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E102.D Issue: 3 Pages: 464-469

    • DOI

      10.1587/transinf.2018FCP0010

    • NAID

      130007605874

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2019-03-01
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16K00002, KAKENHI-PROJECT-18K19771, KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743
  • [Journal Article] "Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth"2018

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      Proceedings of the 29th International Workshop on Combinatorial Algorithms (IWOCA 2018), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: Vol.10979 Pages: 201-213

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] "Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth"2018

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      Proceedings of the 29th International Workshop on Combinatorial Algorithms (IWOCA 2018), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: Vol.10979 Pages: 201-213

    • DOI

      10.1007/978-3-319-94667-2_17

    • ISBN
      9783319946665, 9783319946672
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Journal Article] "Efficient Enumeration of Dominating Sets for Sparse Graphs"2018

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, and Takeaki Uno
    • Journal Title

      Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: Vol.8 Pages: 1-13

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] "Efficient Enumeration of Dominating Sets for Sparse Graphs"2018

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, and Takeaki Uno
    • Journal Title

      Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: Vol.8

    • DOI

      10.4230/LIPICS.ISAAC.2018.8

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Journal Article] "DenseZDD: A Compact and Fast Index for Families of Sets"2018

    • Author(s)
      Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, and Kunihiko Sadakane
    • Journal Title

      Algorithms

      Volume: Vol.11, No.8 Issue: 8 Pages: 1-23

    • DOI

      10.3390/a11080128

    • NAID

      120006659589

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K19771, KAKENHI-PROJECT-18K18102, KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-16H02781
  • [Journal Article] Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four2018

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      IEICE Transactions, Special Section on Discrete Mathematics and Its Applications

      Volume: EA

    • NAID

      130007479537

    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] "Discovering Co-Cluster Structure from Relationships between Biased Objects"2018

    • Author(s)
      Iku Ohama, Takuya Kida, Hiroki Arimura
    • Journal Title

      IEICE Transactions

      Volume: Vol.101-D, No.12 Pages: 3108-3122

    • NAID

      130007539376

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth2018

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      Lecture Notes in Computer Science, Proceedings of the 29th International Workshop (IWOCA 2018) on Combinatorial Algorithms,

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Optimization and Enumeration of Decision Trees from Massive Data Sets2017

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

      Proc. 21st Conference of the International Federation of Operational Research Societies (IFORS 2017)(査読付き国際会議論文)

      Volume: - Pages: 16-21

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2017

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
    • Journal Title

      Special Issue on Discrete Mathematics and Its Applications, IEICE Trans. Inf. and Syst.

      Volume: 未定

    • NAID

      130006038281

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Journal Article] Discovering Relevance-Dependent Bicluster Structure from Relational Data2017

    • Author(s)
      Ohama Iku、Kida Takuya、Arimura Hiroki
    • Journal Title

      Proc. the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)(査読付き国際会議論文)

      Volume: - Pages: 2578-2584

    • DOI

      10.24963/ijcai.2017/359

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743
  • [Journal Article] On the Model Shrinkage Effect of Gamma Process Edge Partition Models2017

    • Author(s)
      Iku Ohama, Issei Sato, Takuya Kida, Hiroki Arimura
    • Journal Title

      Proc. the 31st Annual Conference on Neural Information Processing Systems (NIPS2017)(査読付き国際会議論文)

      Volume: - Pages: 397-405

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2017

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura,
    • Journal Title

      Special Issue on Discrete Mathematics and Its Applications, IEICE Trans. Inf. and Syst

      Volume: 印刷中

    • NAID

      130006038281

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2017

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
    • Journal Title

      Special Issue on Discrete Mathematics and Its Applications, IEICE Trans. Inf. and Syst.

      Volume: 印刷中

    • NAID

      130006038281

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Statistical Emerging Pattern Mining with Multiple Testing Correction2017

    • Author(s)
      Junpei Komiyama, Masakazu Ishihata, Hiroki Arimura, Takashi Nishibayashi, Shin-ichi Minato
    • Journal Title

      The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2017)(査読付き国際会議論文)

      Volume: - Pages: 897-906

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Journal Article] Statistical Emerging Pattern Mining with Multiple Testing Correction2017

    • Author(s)
      Junpei Komiyama and Masakazu Ishihata and Hiroki Arimura and Takashi Nishibayashi and Shin-ichi Minato
    • Journal Title

      Proceedings of the 23rd {ACM} {SIGKDD} International Conference on Knowledge Discovery and Data Mining

      Volume: 1 Pages: 897-906

    • DOI

      10.1145/3097983.3098137

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K12736, KAKENHI-PROJECT-16H01743
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2017

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E100.A Issue: 9 Pages: 1785-1793

    • DOI

      10.1587/transfun.E100.A.1785

    • NAID

      130006038281

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-17H01697, KAKENHI-PROJECT-15J01438, KAKENHI-PROJECT-15K12022
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2017

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E100-A (9) Pages: 1785-1793

    • NAID

      130006038281

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Journal Article] On the Model Shrinkage Effect of Gamma Process Edge Partition Models2017

    • Author(s)
      Iku Ohama, Issei Sato, Takuya Kida, Hiroki Arimura
    • Journal Title

      Proc. the 31st Annual Conference on Neural Information Processing Systems (NIPS2017)

      Volume: ー Pages: 897-906

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression2017

    • Author(s)
      Takagi Takuya、Goto Keisuke、Fujishige Yuta、Inenaga Shunsuke、Arimura Hiroki
    • Journal Title

      Proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)(査読付き国際会議論文)

      Volume: - Pages: 304-316

    • DOI

      10.1007/978-3-319-67428-5_26

    • ISBN
      9783319674278, 9783319674285
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-17H01697, KAKENHI-PROJECT-15K12022
  • [Journal Article] Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees2016

    • Author(s)
      Mayumbo Nyirenda, Hiroki Arimura, Kimihito Ito
    • Journal Title

      Proc. 5th International Conference on Multimedia Computing and Systems (ICMCS'16), IEEE

      Volume: ID-111

    • DOI

      10.4230/LIPIcs.CPM.2016.22

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-26280003, KAKENHI-PROJECT-15K12022
  • [Journal Article] Fully-online construction of suffix trees for multiple texts2016

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga and Hiroki Arimura
    • Journal Title

      Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM'16), Leibniz International Proceedings in Informatics (LIPIcs), DROPS

      Volume: Vol.54

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Estimating the Lineage Dynamics of Human Influenza B Viruses2016

    • Author(s)
      Mayumbo Nyirenda, Ryosuke Omori, Heidi L. Tessmer, Hiroki Arimura, Kimihito Ito
    • Journal Title

      PLoS ONE

      Volume: 11(11) Issue: 11 Pages: e0166107-e0166107

    • DOI

      10.1371/journal.pone.0166107

    • NAID

      120005946864

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-16H02863, KAKENHI-PROJECT-16J02715
  • [Journal Article] Fully-online construction of suffix trees for multiple texts2016

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga and Hiroki Arimura
    • Journal Title

      Proc of. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM'16)(査読付き国際会議論文)

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2016

    • Author(s)
      TakuyaTakagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
    • Journal Title

      Lecture Notes in Computer Science, Springer

      Volume: Vol.9843 Pages: 213-225

    • DOI

      10.1007/978-3-319-44543-4_17

    • NAID

      130006038281

    • ISBN
      9783319445427, 9783319445434
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-16H02781, KAKENHI-PROJECT-26280003, KAKENHI-PROJECT-15K12022
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2016

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
    • Journal Title

      Proc.of 27th International Workshop on Combinatorial Algorithm(査読付き国際会議論文)

      Volume: LNCS, 9843 Pages: 213-225

    • NAID

      130006038281

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Journal Article] The Relevance Dependent Infinite Relation Model for Discovering Co-Cluster Structure from Relationships with Structured Noise2016

    • Author(s)
      Iku Ohama, Hiromi Iida, Takuya Kida, and Hiroki Arimura
    • Journal Title

      IEICE Trans. Inf. and Syst.

      Volume: Vol.E99-D, No.4

    • NAID

      130005141378

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Journal Article] Multi-Layered Framework for Modeling Relationships Between Biased Objects abstract2015

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

      Proc. 2015 SIAM Int’l Conf. on Data Mining, SIAM

      Volume: SDM2015 Pages: 819-827

    • DOI

      10.1137/1.9781611974010.92

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] The Complexity of Induced Tree Reconfiguration Problems2015

    • Author(s)
      Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9618 Pages: 330-342

    • DOI

      10.1007/978-3-319-30000-9_26

    • NAID

      130007605874

    • ISBN
      9783319299990, 9783319300009
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24240021, KAKENHI-PROJECT-13J01149, KAKENHI-PROJECT-16H01743
  • [Journal Article] Fully-online construction of suffix trees and DAWGs for multiple texts2015

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga and Hiroki Arimura
    • Journal Title

      CoRR, arXiv

      Volume: 1507.07622 Pages: 1-22

    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2015

    • Author(s)
      Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
    • Journal Title

      CoRR, arXiv

      Volume: 1602.00422 Pages: 1-10

    • NAID

      130006038281

    • Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Journal Article] Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score2015

    • Author(s)
      Y. Sasaki, T. Shibuya, K. Ito, H. Arimura
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9371 Pages: 191-203

    • NAID

      130007699483

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] 大規模軌跡データからの群パターン発見のための実用的アルゴリズム2015

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

      情報処理学会論文誌

      Volume: 56 Pages: 1292-1304

    • NAID

      110009890369

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] 大規模軌跡データからの群パターン発見のための実用的アルゴリズム2015

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

      情報処理学会論文誌

      Volume: Vol.56, No.4 Pages: 1292-1304

    • NAID

      110009890369

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Journal Article] 大規模軌跡データからの群パターン発見のための実用的アルゴリズム,2015

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

      情報処理学会論文誌

      Volume: 56 Pages: 1292-1304

    • NAID

      110009890369

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Journal Article] A Compact and Fast Index Structure for Families of Sets2014

    • Author(s)
      Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, and Kunihiko Sadakane
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 未定(受理済み)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree2014

    • Author(s)
      Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      IEICE Trans. Inf. and Syst.

      Volume: Vol.E97-D, No.3 Pages: 421-430

    • NAID

      130003394857

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph2014

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

      Proc. The 25th International Symposium on Algorithms and Computation (ISAAC 2014)

      Volume: LNCS 8889 Pages: 94-102

    • DOI

      10.1007/978-3-319-13075-0_8

    • ISBN
      9783319130743, 9783319130750
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-13J01149, KAKENHI-PROJECT-24240021, KAKENHI-PUBLICLY-25120501
  • [Journal Article] Oblivious evaluation of non-deterministic finite automata with application to privacy preserving virus genome detection2014

    • Author(s)
      Hirohito Sasakawa, Hiroki Harada, David duVerle, Hiroki Arimura, Koji Tsuda, Jun Sakuma
    • Journal Title

      Proc. 13th Workshop on Privacy in the Electronic Society (WPES 2014)

      Volume: - Pages: 21-30

    • DOI

      10.1145/2665943.2665954

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-24106010, KAKENHI-PROJECT-24240021
  • [Journal Article] Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree2014

    • Author(s)
      Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      IEICE Trans. Inf. and Syst.

      Volume: Vol.E97-D, No.3 Pages: 421-430

    • NAID

      130003394857

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Journal Article] 文字列の圧縮列挙索引技術とパターン照合技術2014

    • Author(s)
      伝住周平,有村博紀,定兼邦彦
    • Journal Title

      小特集 「フカシギの数え方」から広がるアルゴリズムの理工学 : 二分決定グラフによる離散構造処理と広がる応用分野, 電子情報通信学会誌

      Volume: Vol.97, No.12 Pages: 1080-1085

    • Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree2014

    • Author(s)
      Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: Vol.E97-D, No.3 Pages: 421-430

    • NAID

      130003394857

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] DenseZDD: A compact and fast index for families of sets2014

    • Author(s)
      Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
    • Journal Title

      Proc. Symposium on Experimental Algorithms (SEA 2014), Lecture Notes in Computer Science

      Volume: 8504 Pages: 187-198

    • DOI

      10.1007/978-3-319-07959-2_16

    • NAID

      120006659589

    • ISBN
      9783319079585, 9783319079592
    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106010, KAKENHI-PROJECT-24240021, KAKENHI-PUBLICLY-25120501
  • [Journal Article] Enumeration of Complete Set of Flock Patterns in Trajectories2014

    • Author(s)
      Xiaoliang Geng, Takuya Takagi, Hiroki Arimura, and Takeaki Uno
    • Journal Title

      Proc. the 5th ACM SIGSPATIAL International Workshop on GeoStreaming (IWGS 2014), ACM

      Volume: なし Pages: 53-61

    • DOI

      10.1145/2676552.2676560

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24240021, KAKENHI-PUBLICLY-25120501
  • [Journal Article] Sequence Binary Decision Diagram: Minimization, Relationship to Acyclic Automata, and Complexities of Boolean Set Operations2014

    • Author(s)
      Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato
    • Journal Title

      Discrete Applied Mathematics

      Volume: 未確定 Pages: 61-80

    • DOI

      10.1016/j.dam.2014.11.022

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-13J01937, KAKENHI-PROJECT-24240021, KAKENHI-PUBLICLY-25120501, KAKENHI-PLANNED-24106010, KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-15K12022
  • [Journal Article] Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph2014

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

      Lecture Notes in Computer Science, Springer

      Volume: Vol.8889 Pages: 94-102

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Journal Article] Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree2014

    • Author(s)
      Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, and Hiroki Arimura
    • Journal Title

      IEICE TRANSACTIONS on Information and Systems

      Volume: Vol.E97-D, No.3 Pages: 421-430

    • NAID

      130003394857

    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Journal Article] 文字列の圧縮列挙索引技術とパターン照合技術2014

    • Author(s)
      伝住周平,有村博紀,定兼邦彦
    • Journal Title

      小特集「フカシギの数え方」から広がるアルゴリズムの理工学:二分決定グラフによる離散構造処理と広がる応用分野,電子情報通信学会誌

      Volume: Vol.97, No.12 Pages: 1080-1085

    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Journal Article] Polynomial Delay and Space Discovery of Connected and Acyclic Sub-Hypergraphs in a Hypergraph2013

    • Author(s)
      Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, and Hiroki Arimura
    • Journal Title

      Lecture Notes in Computer Science

      Volume: Vol.8140 Pages: 308-323

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] Polynomial Delay and Space Discovery of Connected and Acyclic Sub-Hypergraphs in a Hypergraph2013

    • Author(s)
      Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, and Hiroki Arimura
    • Journal Title

      Lecture Notes in Computer Science

      Volume: Vol.8140 Pages: 308-323

    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Journal Article] Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees2013

    • Author(s)
      Kunihiro Wasa, Hiroki Arimura, Kouichi Hirata, and Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: Vol.8199 Pages: 73-84

    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Journal Article] Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees2013

    • Author(s)
      Kunihiro Wasa, Hiroki Arimura, Kouichi Hirata, and Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: Vol.8199 Pages: 73-84

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] A Dynamically Reconfigurable FPGA-based Pattern Matching Hardware for Subclasses of Regular Expressions2012

    • Author(s)
      Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura, 他2名
    • Journal Title

      IEICE Trans.Inf.and Syst.

      Volume: Vol.D(accepted)

    • NAID

      10031024212

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

    • NAID

      10031024212

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

    • NAID

      120004710971

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] 長大な拡張文字列パターンに対する大規模文字列照合の高速化2012

    • Author(s)
      笹川 裕人, 金田 悠作, 有村博紀
    • Journal Title

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

      Volume: Vol.11, No.1 Pages: 55-60

    • NAID

      40019381157

    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] A Dynamically Reconfigurable FPGA-based Pattern Matching Hardware for Subclasses of Regular Expressions2012

    • Author(s)
      Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, and Yoshikazu Miyanaga
    • Journal Title

      IEICE Trans. Inf. and Syst.

      Volume: Vol.E95-D, No.7 Pages: 1847-1857

    • NAID

      10031024212

    • Data Source
      KAKENHI-PROJECT-24240021
  • [Journal Article] Counterexamples to the long-standing conjecture on the complexity of BDD binary operations2012

    • Author(s)
      Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, and Shin-ichi Minato
    • Journal Title

      Information Procssing Letters

      Volume: Vol.112, Issue 16 Issue: 16 Pages: 636-640

    • DOI

      10.1016/j.ipl.2012.05.007

    • NAID

      120004710971

    • Data Source
      KAKENHI-PROJECT-24240021
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method2011

    • Author(s)
      Takashi Uemura, Daisuke Ikeda, Takuya Kida, Hiroki Arimura
    • Journal Title

      人工知能学会論文誌

      Volume: Vol.26, No.1 Pages: 297-306

    • NAID

      130000455378

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

    • Author(s)
      Yusaku Kaneta, Hiroki Arimura, Raseev Raman
    • Journal Title

      Journal of Discrete Algorithms

      Volume: (未定)(in printing) Pages: 119-135

    • DOI

      10.1016/j.jda.2011.12.018

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014, KAKENHI-PROJECT-24240021
  • [Journal Article] Sparse and Truncated Suffix Trees on Variable-Length Codes2011

    • Author(s)
      Takashi Uemura, Hiroki Arimura
    • Journal Title

      Lecture Notes in Computer Science

      Volume: Vol.6661 Pages: 246-260

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Fast Bit-Parallel Matching for Network and Regular Expressions2010

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

      Proc. the 17th Symposium on String Processing and Information Retrieval (SPIRE2010)

      Volume: LNCS 6393 Pages: 372-384

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

    • NAID

      130000251505

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Fast Bit-Parallel Matching for Network and Regular Expressions2010

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

      Proc.the 17th Symp.on String Processing and Information Retrieval (SPIRE2010)(LNCS, Vol.6393, Springer)

      Pages: 372-384

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Dynamic Reconfigurable Bit-Parallel Architecture for Large-Scale Regular Expression Matching2010

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

      Proc.the 2010 IEEE Int'l Conference on Field-Programmable Technology(IEEE)

      Pages: 21-28

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Aligned Bipartite Episodes Between the Genera of Bacteria2010

    • Author(s)
      Takashi Katoh, Kouichi Hirata, Hiroki Arimura, 他2名
    • Journal Title

      Proc. 2010 IEEE/ICME International Conference on Complex Medical Engineering (CME'10)

      Volume: IEEE/ICME CME10 Pages: 193-197

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] 「おめでとうソサイエティ論文賞」ゼロサプレス型二分決定グラフを用いたトランザクションデータベースの効率的解析手法2010

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

      電子情報通信学会 情報・システムソサイエティ誌

      Volume: Vol.15, No.3 Pages: 15-15

    • Data Source
      KAKENHI-PROJECT-20300051
  • [Journal Article] 「おめでとうソサイエティ論文賞」ゼロサプレス型二分決定グラフを用いたトランザクションデータベースの効率的解析手法2010

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

      電子情報通信学会情報・システムソサイエティ誌 Vol.15, No.3

      Pages: 15-15

    • Data Source
      KAKENHI-PROJECT-20300051
  • [Journal Article] An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences2010

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

      IPSJ Online Trans. Vol.3

      Pages: 1-12

    • NAID

      130000251505

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Unsupervised Spam Detection by Documen Probability Estimation with Maximal Overlap Method2010

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

      Trans.of the Japanese Society for Artificial Intelligence Vol.26

      Pages: 297-306

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Dynamic Reconfigurable Bit-Parallel Architecture for Large-Scale Regular Expression Matching2010

    • Author(s)
      Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura, 他2名
    • Journal Title

      Proc. the 2010 IEEE International Conference on Field-Programmable Technology

      Volume: IEEE FPT10 Pages: 21-28

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

    • Author(s)
      Takashi Katoh, Hiroki Arimura, Kouichi Hirata
    • Journal Title

      IPSJ Online Transactions

      Volume: Vol.3 Pages: 1-12

    • NAID

      130000251505

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] 「おめでとうソサイエティ論文賞」ゼロサプレス型二分決定グラフを用いたトランザクションデータベースの効率的解析手法2010

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

      電子情報通信学会情報・システムソサイエティ誌

      Volume: Vol.15, No.3 Pages: 15-15

    • Data Source
      KAKENHI-PROJECT-20300051
  • [Journal Article] Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism2010

    • Author(s)
      Yusaku Kaneta, Hiroki Arimura
    • Journal Title

      Proc. 21st International Workshop on Combinatorial Algorithms (IWOCA2010)

      Volume: LNCS 6460 Pages: 68-81

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

    • NAID

      130000455378

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

    • NAID

      130000251505

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

    • Author(s)
      Takashi Katoh, Hiroki Arimura, Kouichi Hirata
    • Journal Title

      Proc.13rd Pacific-Asia Conference on Knowledge Discovery and Data Mining(PAKDD2009) LNAI5476

      Pages: 172-183

    • NAID

      40020258451

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Polynomial-Delay and Polynomial-Space Algo- rithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems2009

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

      Proc.2009 SIAM Int'l Conf.on Data Mining 2002 (SDM'09)(SIAM)

      Pages: 1087-1098

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

    • NAID

      40020258451

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed sequences, Graphs, and Pictures in Accessible Set Systems2009

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

      Proc.2009 SIAM International Conference on Data Mining 2002(SDM'09) SIAM SDM 2009

      Pages: 1087-1098

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] An Efficient Depth-First Search Algorithm for Extracting Frequent Diam ond Episodes from Event Sequences2009

    • Author(s)
      Takashi Katoh, Hiroki Arimuray, Kouichi Hirata
    • Journal Title

      IPSJ Trans. on Databases Vol.2, No.4

      Pages: 1-12

    • NAID

      130000251505

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Mining Frequent Bipartite Episode from Event Sequences2009

    • Author(s)
      Takashi Katoh, Hiroki Arimura, Kouichi Hirata
    • Journal Title

      Proc.of Discovery Science 2009 LNAI5808

      Pages: 136-151

    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-21013001
  • [Journal Article] Mining Frequent Bipartite Episode from Event Sequences2009

    • Author(s)
      Takashi Katoh, Hiroki Arimura, Kouichi Hirata
    • Journal Title

      Proc.of Discovery Science 2009 LNAI5808

      Pages: 136-151

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration2008

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

      Lecture Notes in Computer Science 5012

      Pages: 357-368

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

      Lecture Notes in Computer Science 5433

      Pages: 13-25

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] LCM over ZBDDs : Fast Generation of Very Large-Scale Freq uent Itemsets Using a Compact Graph-Based Representation2008

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

      In Proc. of PAKDD 2008, LNAI 5012, Springer

      Pages: 234-246

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20300051
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data (invited talk)2008

    • Author(s)
      H. Arimura
    • Journal Title

      Lecture Notes in Computer Science 5012

      Pages: 2-13

    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] ウェブ閲覧における効率的なキーワード抽出とその利用2008

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

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

      Pages: 49-60

    • NAID

      110007990001

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

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

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

      Pages: 595-607

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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

      Lecture Notes in Computer Science 5012

      Pages: 234-246

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

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

      Proc.of PAKDD 2008(Springer)

      Pages: 234-246

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

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

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

      Volume: 38 Pages: 49-60

    • NAID

      110007990001

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Journal Article] プロパティ接尾辞木のオフライン線形時間構築アルゴリズム2008

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

      電子情報通信学会論文誌

      Volume: J91-D Pages: 595-607

    • NAID

      110007380997

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

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

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

    • NAID

      110007990001

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

      In Proc. of 12-th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2008), (LNAI 5012, Springer)

      Pages: 234-246

    • Data Source
      KAKENHI-PROJECT-20300051
  • [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

      Lecture Notes in Computer Science 5433

      Pages: 1-12

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] プロパティ接尾辞木のオフライン線形時間構築アルゴリズム2007

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

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

      Pages: 595-607

    • NAID

      110007380997

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] データインテンシブコンピューティングその2-頻出アイテム集合発見アルゴリズム-2007

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

      人工知能学会誌 Vol. 22

      Pages: 425-436

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

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

      人工知能学会誌 Vol.22

      Pages: 425-436

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] プロパティ接尾辞木のオフライン線形時間構築アルゴリズム2007

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

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

      Pages: 595-607

    • NAID

      110007380997

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] 単語幅を制約した接尾辞木の効率のよい構築アルゴリズム2006

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

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

      Pages: 5-8

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams2006

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

      Report from the 2004 Annual Meeting of japan Society for Artifical Intelligence (JSAI2004), JSAI, LNAI, Katsumi Nitta et al.(eds.), Springer-Verlag (in printng)

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

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

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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams2006

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

      Lecture Notes in Computer Science (To appear)

    • Data Source
      KAKENHI-PROJECT-15300036
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams2006

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

      Lecture Notes in Computer Science To appear

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

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

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

      Pages: 317-329

    • NAID

      120006019088

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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 Algorithms and Computation (ISAAC'05), LNCS 3827, Springer

    • NAID

      110003225066

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15300036
  • [Journal Article] Efficient Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs2005

    • Author(s)
      Sin-ichi Minato, Hiroki Arimura(H13-H16代表者)
    • Journal Title

      Proc.of IEEE/IEICE/IPSJ International Workshop on Challenges in Web Information Retrieval and Integration IEEE CS P2414

      Pages: 3-10

    • Data Source
      KAKENHI-PROJECT-16016266
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] データストリームのためのマイニング技術2005

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

      情報処理, 情報処理学会 46・1

      Pages: 4-11

    • NAID

      110002768327

    • Data Source
      KAKENHI-PROJECT-16650021
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] Special Issue on Algorithmic Learning Thoery2005

    • Author(s)
      Sanjay Jain, Hiroki Arimura
    • Journal Title

      Theoretical Computer Science 348・1-348・2

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15300036
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] 大規模データストリームのためのマイニング技術の動向2005

    • Author(s)
      有村博紀
    • Journal Title

      電子情報通信学会論文誌 J88-D-I・2(印刷中)

    • NAID

      110003207353

    • Data Source
      KAKENHI-PROJECT-16650021
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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 3827

      Pages: 724-737

    • NAID

      110003225066

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15300036
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] ゼロサプレス型二分決定グラフを用いたトランザクションデータベースの効率的解析手法2005

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

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

      Pages: 172-182

    • NAID

      110004669938

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] Special Issue on Algorithmic Learning Thoery2005

    • Author(s)
      Sanjay Jain, Hiroki Arimura
    • Journal Title

      Theoretical computer Science 348(1-2)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15300036
  • [Journal Article] ゼロサプレス型二分決定グラフを用いたトランザクションデータベースの効率的解析手法2005

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

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

      Pages: 172-182

    • NAID

      110004669938

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] 大規模データストリームのためのマイニング技術の動向2005

    • Author(s)
      有村博紀
    • Journal Title

      電子情報通信学会論文誌D-1 J88-D-1・3

      Pages: 563-575

    • NAID

      110003207353

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15300036
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] Recent Development of Stream Data Mining Algorithms (In Japanese)2005

    • Author(s)
      H.Arimura
    • Journal Title

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

      Pages: 172-183

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15300036
  • [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

    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] 大規模データストリームのためのマイニング技術の動向2005

    • Author(s)
      有村博紀
    • Journal Title

      電気情報通信学会論文誌 J88-D-I・2(印刷中)

    • NAID

      110003207353

    • Data Source
      KAKENHI-PROJECT-16016266
  • [Journal Article] 飽和集合列挙アルゴリズムを用いた大規模データベースからのルール発見手法2005

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

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

      Pages: 317-329

    • NAID

      120006019088

    • Data Source
      KAKENHI-PROJECT-17002008
  • [Journal Article] データストリームのためのマイニング技術2005

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

      情報処理,情報処理学会 46・1

      Pages: 4-11

    • NAID

      110002768327

    • Data Source
      KAKENHI-PROJECT-15300036
  • [Journal Article] 大規模データストリームのためのマイニング技術の動向2005

    • Author(s)
      有村博紀
    • Journal Title

      電子情報通信学会論文誌 J88-D-I・2(印刷中)

    • NAID

      110003207353

    • Data Source
      KAKENHI-PROJECT-15300036
  • [Journal Article] Pattern matching with taxonomic information2004

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

      Proc.Asia Information Retrieval Symposium (AIRS'04)

    • NAID

      120000959147

    • Data Source
      KAKENHI-PROJECT-15300036
  • [Journal Article] Efficient Substructure Discovery from Large Semi-structured Data2004

    • Author(s)
      H.Arimura, H.Sakamoto他4名
    • Journal Title

      IEICE Transactions on Information and Systems E87-D・12

      Pages: 2754-2763

    • NAID

      110003213885

    • Data Source
      KAKENHI-PROJECT-16650021
  • [Journal Article] An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases2004

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

      Proc.the 7th International Conference on Discovery Science (DS' 04) LNAI3245

      Pages: 16-30

    • Data Source
      KAKENHI-PROJECT-16016266
  • [Journal Article] An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases2004

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

      Proc.the 7th International Conference on Discovery Science (DS'04) LNAI3245

      Pages: 16-30

    • Data Source
      KAKENHI-PROJECT-15300036
  • [Journal Article] An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases2004

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

      Proc.the 7th International Conference on Discovery Science (DS'04) LNAI3245

      Pages: 16-30

    • Data Source
      KAKENHI-PROJECT-16650021
  • [Journal Article] Efficient Substructure Discovery from Large Semi-structured Data2004

    • Author(s)
      H.Arimura, H.Sakamoto他4名
    • Journal Title

      IEICE Transactions on Information and Systems E87-D・12

      Pages: 2754-2763

    • NAID

      110003213885

    • Data Source
      KAKENHI-PROJECT-15300036
  • [Journal Article] Efficient Substructure Discovery from Large Semi-structured Data2004

    • Author(s)
      H.Arimura, H.Sakamoto他4名
    • Journal Title

      IEICE Transactions on Information and Systems E87-D・12

      Pages: 2754-2763

    • NAID

      110003213885

    • Data Source
      KAKENHI-PROJECT-16016266
  • [Journal Article] Approximate point set pattern matching on sequences and planes2004

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

      Proc.the 15th Annual Symposium on Combinatorial Pattern Matching (CPM 2004) LNCS3109

      Pages: 218-229

    • Data Source
      KAKENHI-PROJECT-16016266
  • [Journal Article] WWWからの情報抽出-ウェブラッパーの自動構築-2004

    • Author(s)
      有村博紀, 坂本比呂志他2名
    • Journal Title

      人工知能学会誌 19・3

      Pages: 302-310

    • Data Source
      KAKENHI-PROJECT-16650021
  • [Presentation] Finding Diverse Strings and Longest Common Subsequences in a Graph2024

    • Author(s)
      Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
    • Organizer
      arXiv:2405.00131, 2024. (accpeted to: 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024), Leibniz International Proceedings in Informatics, Vol.296, pp.21:0-21:17, to appear)
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] グラフの中の多様な文字列と最長共通部分列の発見2024

    • Author(s)
      有村 博紀
    • Organizer
      フォレストワークショップ2024
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] 文字列集合に対する多様な最長共通部分列の発見2023

    • Author(s)
      志田祐仁,小林靖明,有村博紀
    • Organizer
      コンピュテーション研究会,電子情報通信学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph2023

    • Author(s)
      Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
    • Organizer
      Lecture Notes in Computer Science, 30th annual Symposium on String Processing and Information Retrieval (SPIRE2023), Vol.14240, pp.28-34
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] Minimum Consistent Subset for Trees Revisited2023

    • Author(s)
      Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi
    • Organizer
      The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] 文字列集合に対する多様な最長共通部分列の発見2023

    • Author(s)
      志田祐仁,小林靖明,有村博紀
    • Organizer
      コンピュテーション研究会,電子情報通信学会
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] 一般化階層をもつ関係データベース上の閉パターンの発見2022

    • Author(s)
      有村 博紀, 田口 尚生, 王 叶
    • Organizer
      人工知能学会 2022年度人工知能学会全国大会 (JSAI2022)
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] コンパクト非巡回語グラフに基づく連長圧縮Burrows-Wheeler変換の効率良い構築2022

    • Author(s)
      須江瑞樹,小林靖明,有村博紀,中島祐人,稲永俊介
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会,愛媛大学
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 半順序集合の弱埋め込み問題に対するパラメータ化アルゴリズム2022

    • Author(s)
      宮﨑怜子,有村博紀,小林靖明
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会,愛媛大学
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] デカルト木部分列照合問題の高速なアルゴリズム2022

    • Author(s)
      大泉 翼,有村博紀
    • Organizer
      アルゴリズム(AL)研究会情報処理学会, 2022-AL-186
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Computing the Collection of Good Models for Rule Lists2022

    • Author(s)
      Kota Mata,Kentaro Kanamori,Hiroki Arimura
    • Organizer
      18th International Conference on Machine Learning and Data Mining (MLDM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] Cartesian Tree Subsequence Matching2022

    • Author(s)
      Tsubasa Oizumi,Takeshi Kai,Takuya Mieno,Shunsuke Inenaga,Hiroki Arimura
    • Organizer
      33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), Leibniz International Proceedings in Informatics (LIPIcs)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] デカルト木部分列照合問題の高速なアルゴリズム2022

    • Author(s)
      大泉 翼,有村博紀
    • Organizer
      アルゴリズム(AL)研究会, 2022-AL-186, Vol.3, pp.1-8
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] 一般化階層をもつ関係データベース上の閉パターンの発見2022

    • Author(s)
      有村 博紀,田口 尚生,王 叶
    • Organizer
      人工知能学会 2022年度人工知能学会全国大会 (JSAI2022)
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] ルールリストに対するRashomon集合の厳密計算と予測多重性解析2021

    • Author(s)
      又 康太, 金森 憲太朗, 有村 博紀
    • Organizer
      第24回情報論的学習理論ワークショップ (IBIS 2021)
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization2021

    • Author(s)
      Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
    • Organizer
      35th Conference on Aritificial Intelligence (AAAI 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] Explainable Machine Learning for Trustworthy AI2021

    • Author(s)
      Hiroki Arimura
    • Organizer
      HU-DUT Workshop for Big data and AI, Hokkaido University
    • Invited
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] ルールリストに対するRashomon集合の厳密計算と予測多重性解析2021

    • Author(s)
      又 康太,金森 憲太朗,有村 博紀
    • Organizer
      第24回情報論的学習理論ワークショップ (IBIS 2021), 一般セッション, 2-3 モデル解釈・検証, 106
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] デカルト木照合の部分系列への拡張2021

    • Author(s)
      加井丈志,光吉健汰,古谷 勇,有村博紀
    • Organizer
      コンピュテーション(COMP)研究会電子情報通信学会, COMP2019-18
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] デカルト木照合の部分系列への拡張2021

    • Author(s)
      加井丈志,光吉健汰,古谷 勇,有村博紀
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 一貫性に基づいた特徴選択のための高速な列挙アルゴリズム2021

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第116回人工知能基本問題研究会(SIG-FPAI)人工知能学会
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] デカルト木照合の部分系列への拡張2021

    • Author(s)
      加井丈志,光吉健汰,古谷 勇,有村博紀
    • Organizer
      コンピュテーション(COMP)研究会, COMP2021-6
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] 決定木要約の効率良い構築法 -- 説明可能な人工知能の実現に向けて --2020

    • Author(s)
      有村 博紀, 金森 憲太朗, 王 叶
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020), オンライン, 2020年6月4-7日
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] 説明可能な機械学習のための拡張シャープレイ値の厳密指数時間アルゴリズム2020

    • Author(s)
      大泉翼,有村 博紀
    • Organizer
      第12回データ工学と情報マネジメントに関するフォーラム (DEIM2020), オンライン
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 一貫性に基づいた特徴選択のための高速な列挙アルゴリズム2020

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第116回人工知能基本問題研究会(SIG-FPAI), 人工知能学会, オンライン,March 2021
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] 混合整数線形計画法に基づく実現可能性を考慮した反事実的説明法2020

    • Author(s)
      金森 憲太朗, 高木 拓也, 小林 健, 有村 博紀
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020), オンライン, 2020年6月4-7日
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] 一貫性に基づいた特徴選択のための高速な列挙アルゴリズム2020

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第116回人工知能基本問題研究会(SIG-FPAI) 人工知能学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 決定木アンサンブルにおける出現頻度比に基づく変数重要度2020

    • Author(s)
      又 康太, 金森 憲太朗, 有村 博紀
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020) 人工知能学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Variable Importance Cloudの要約方法と決定木に対する実験的評価2020

    • Author(s)
      又 康太, 金森 憲太朗, 有村 博紀
    • Organizer
      第第23回情報論的学習理論ワークショップ (IBIS 2020)
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Variable Importance Cloudの要約方法と決定木に対する実験的評価2020

    • Author(s)
      又 康太, 金森 憲太朗, 有村 博紀
    • Organizer
      第23回情報論的学習理論ワークショップ (IBIS 2020)
    • Data Source
      KAKENHI-PLANNED-20H05963
  • [Presentation] 決定木アンサンブルにおける出現頻度比に基づく変数重要度2020

    • Author(s)
      又 康太, 金森 憲太朗, 有村 博紀
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020), オンライン, 2020年6月4-7日
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] Variable Importance Cloudの要約方法と決定木に対する実験的評価2020

    • Author(s)
      又 康太, 金森 憲太朗, 有村 博紀
    • Organizer
      第23回情報論的学習理論ワークショップ (IBIS 2020)
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] 決定木要約の効率良い構築法 -- 説明可能な人工知能の実現に向けて --2020

    • Author(s)
      有村 博紀, 金森 憲太朗, 王 叶
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020)
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 混合整数線形計画法に基づく実現可能性を考慮した反事実的説明法2020

    • Author(s)
      金森 憲太朗, 高木 拓也, 小林 健, 有村 博紀
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020)
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 説明可能な機械学習に向けて:整数計画法と列挙に基づく最適決定木の厳密学習アルゴリズムの実験的比較2019

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019), ウインクあいち, 名古屋市
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] A Constant Amortized Time Enumeration Algorithm for Independent Sets in Graphs with Bounded Clique Number2019

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      3rd International Workshop on Enumeration Problems and Applications (WEPA 2019), Awaji Island, Japan
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 大きな正規表現に対する系列二分決定グラフを用いた効率よい照合手法2019

    • Author(s)
      瀧澤涼介, 喜田拓也, 有村博紀, 瀧川一学
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会, COMP2019-18, 北海道大学, 札幌市
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] "イベント系列からの有意なエピソードの効率良いマイニング"2019

    • Author(s)
      谷 陽太,平田 耕一,有村 博紀
    • Organizer
      第11回データ工学と情報マネジメントに関するフォーラム (DEIM2019)
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] An Efficient Algorithm for Enumerating Chordal Bipartite Induced, Subgraphs in Sparse Graphs2019

    • Author(s)
      Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      Combinatorial Algorithms - 30th International Workshop, IWOCA 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] 最大クリークサイズが定数であるグラフに対する独立点集合のならし定数時間列挙2019

    • Author(s)
      栗田 和宏, 和佐 州洋, 宇野 毅明, 有村博紀
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] Fairness-aware Edit of Thresholds in a Learned Decision Tree Using a Mixed Integer Programming Formulatio2019

    • Author(s)
      金森 憲太朗, 有村 博紀
    • Organizer
      2019年度人工知能学会全国大会 (JSAI2019), 人工知能学会, インタラクティブセッション
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 説明可能な機械学習に向けて:整数計画法と列挙に基づく最適決定木の厳密学習アルゴリズムの実験的比較2019

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019)
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs2019

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      30th International Workshop (IWOCA 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] 混合整数計画法に基づく公平性を考慮した決定木編集法2019

    • Author(s)
      金森憲太朗, 有村博紀
    • Organizer
      RIMS研究集会「数理計画問題に対する理論とアルゴリズムの研究」, 京都大学 数理解析研究所
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] ランダム分割木に基づく勾配ブースティングの検証2019

    • Author(s)
      松田 祐汰, 瀧川 一学, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019), ウインクあいち, 名古屋市
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] A Constant Amortized Time Enumeration Algorithm for Independent Sets in Graphs with Bounded Clique Number2019

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      3rd International Workshop on Enumeration Problems and Applications (WEPA 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] 大きな正規表現に対する系列二分決定グラフを用いた効率よい照合手法2019

    • Author(s)
      瀧澤涼介, 喜田拓也, 有村博紀, 瀧川一学
    • Organizer
      コンピュテーション(COMP)研究会電子情報通信学会, COMP2019-18, 北海道大学, 札幌市
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] "イベント系列からの有意なエピソードの効率良いマイニング"2019

    • Author(s)
      谷 陽太,平田 耕一,有村 博紀
    • Organizer
      第11回データ工学と情報マネジメントに関するフォーラム (DEIM2019)
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] Fairness-aware Edit of Thresholds in a Learned Decision Tree Using a Mixed Integer Programming Formulation2019

    • Author(s)
      金森 憲太朗, 有村 博紀
    • Organizer
      2019年度人工知能学会全国大会 (JSAI2019), 人工知能学会, インタラクティブセッション
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] "An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs"2019

    • Author(s)
      栗田 和宏, 和佐 州洋, 宇野 毅明,有村 博紀
    • Organizer
      第171回アルゴリズム研究会, 情報処理学会
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 説明可能な機械学習に向けて:整数計画法と列挙に基づく最適決定木の厳密学習アルゴリズムの実験的比較2019

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019) , ウインクあいち
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] Enumeration of Distinct Support Vectors for Interactive Decision Making2019

    • Author(s)
      Kentaro Kanamori, Satoshi Hara, Masakazu Ishihata, Hiroki Arimura
    • Organizer
      2019 ICML Workshop on Human In the Loop Learning (HILL 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] "整数計画法に基づく学習済み決定木の公平性を考慮した編集法"2019

    • Author(s)
      金森 憲太朗,有村 博紀
    • Organizer
      第108回人工知能基本問題研究会(SIG-FPAI)
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] Fast Identification of Heavy Hitters by Cached and Packed Group Testing2019

    • Author(s)
      Yusaku Kaneta, Takeaki Uno and Hiroki Arimura
    • Organizer
      the 26th International Symposium on String Processing and Information Retrieva, SPIRE2019l
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] A Constant Amortized Time Enumeration Algorithm for Independent Sets in Graphs with Bounded Clique Number2019

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      3rd International Workshop on Enumeration Problems and Applications (WEPA 2019), Awaji Island, Japan
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] ランダム分割木に基づく勾配ブースティングの検証2019

    • Author(s)
      松田 祐汰, 瀧川 一学, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019), ウインクあいち
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] "An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs"2019

    • Author(s)
      栗田 和宏(北海道大学), 和佐 州洋, 宇野 毅明,有村 博紀
    • Organizer
      第171回アルゴリズム研究会, 情報処理学会
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] "整数計画法に基づく学習済み決定木の公平性を考慮した編集法"2019

    • Author(s)
      金森 憲太朗,有村 博紀
    • Organizer
      第108回人工知能基本問題研究会(SIG-FPAI)
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 最大クリークサイズが定数であるグラフに対する独立点集合のならし定数時間列挙2019

    • Author(s)
      栗田 和宏, 和佐 州洋, 宇野 毅明, 有村博紀
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会, COMP2019-19, 北海道大学, 札幌市
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 混合整数計画法に基づく公平性を考慮した決定木編集法2019

    • Author(s)
      金森憲太朗, 有村博紀
    • Organizer
      RIMS研究集会「数理計画問題に対する理論とアルゴリズムの研究」, 京都大学 数理解析研究所
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] ランダム分割木に基づく勾配ブースティングの検証2019

    • Author(s)
      松田 祐汰, 瀧川一学, 有村博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019)
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] 決定木アンサンブル予測器の効率的ハードウェア実装のための簡約化に関する研究2019

    • Author(s)
      26.松田 祐汰, 瀧川 一学, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019)
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] 大きな正規表現に対する系列二分決定グラフを用いた効率よい照合手法2019

    • Author(s)
      瀧澤涼介, 喜田拓也, 有村博紀, 瀧川一学
    • Organizer
      電子情報通信学会 コンピュテーション研究会(COMP)
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] イベント系列からの有意性を考慮した菱形エピソードマイニング2018

    • Author(s)
      谷 陽太, 古谷 勇, 平田 耕一, 有村 博紀
    • Organizer
      2018年度人工知能学会全国大会予稿集, 人工知能学会, インタラクティブセッション, 4Pin1-27
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] "イベント系列からの有意性を考慮した菱形エピソードマイニング"2018

    • Author(s)
      金森 憲太朗, 原 聡, 石畠 正和, 有村 博紀
    • Organizer
      2018度人工知能学会全国大会 (JSAI2018)
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] 決定化されたグラフパターントライの学習アルゴリズム2018

    • Author(s)
      坂上 陽規,栗田 和宏 ,瀧川 一学 ,有村 博紀
    • Organizer
      人工知能学会 第105回人工知能基本問題研究会 (SIG-FPAI) 予稿集, SIG-FPAI-B508, pp. 63-68
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] k-縮退グラフに含まれる支配集合の列挙アルゴリズム2018

    • Author(s)
      栗田 和宏, 和佐 州洋, 有村 博紀, 宇野毅明
    • Organizer
      2017年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] "グラフ断片決定木を用いたグラフ特徴抽出手法"2018

    • Author(s)
      坂上 陽規,瀧川 一学 ,有村 博紀
    • Organizer
      2018度人工知能学会全国大会 (JSAI2018)
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] "グラフ断片決定木を用いたグラフ特徴抽出手法"2018

    • Author(s)
      坂上 陽規,瀧川 一学 ,有村 博紀
    • Organizer
      2018度人工知能学会全国大会 (JSAI2018)
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] 順序決定木に対する正則化パラメータ推定の高速化2018

    • Author(s)
      金森 憲太朗, 石畠 正和, 湊 真一, 有村 博紀
    • Organizer
      第105回人工知能基本問題研究会(SIG-FPAI),SIG-FPAI-B508, 人工知能学会
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] グラフ断片決定木を用いたグラフ特徴抽出手法2018

    • Author(s)
      坂上 陽規,瀧川 一学 ,有村 博紀
    • Organizer
      人工知能学会全国大会予稿集, 人工知能学会, インタラクティブセッション, 3Pin1-10, 鹿児島市、2018年6月5-8日
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] モデル選択のためのサポートベクトル列挙2018

    • Author(s)
      金森 憲太朗, 原 聡, 石畠 正和, 有村 博紀
    • Organizer
      第29回IBISML研究会, 情報論的学習理論と機械学習研究会, 電子情報通信学会 情報・システムソサイエティ、沖縄科学技術大学院大学(OIST)
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] Efficient Enumeration Algorithms for Connected Induced Subgraphs with Large Girth2018

    • Author(s)
      Kazuhiro Kurita, Alessio Conte, Kunihiro Wasa, Takeaki Uno and Hiroki Arimura
    • Organizer
      The 20th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2017), Hanyang University, Seoul, Korea
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] グラフ断片決定木を用いたグラフ特徴抽出手法2018

    • Author(s)
      坂上 陽規,瀧川 一学 ,有村 博紀
    • Organizer
      2018年度人工知能学会全国大会予稿集, 人工知能学会, インタラクティブセッション, 3Pin1-10
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] グラフに含まれる大きな内周を持つ部分グラフの効率良い列挙2018

    • Author(s)
      栗田 和宏, Alessio Conte, 和佐 州洋, 宇野毅明, 有村博紀
    • Organizer
      情報処理学会第80回全国大会, 早稲田大学, 東京, 2018年3月
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] イベント系列からの有意性を考慮した菱形エピソードマイニング2018

    • Author(s)
      谷 陽太, 古谷 勇, 平田 耕一, 有村 博紀
    • Organizer
      人工知能学会全国大会予稿集, 人工知能学会, インタラクティブセッション, 4Pin1-27, 鹿児島市、2018年6月5-8日
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] "イベント系列からの有意性を考慮した菱形エピソードマイニング"2018

    • Author(s)
      谷 陽太, 古谷 勇, 平田 耕一, 有村 博紀
    • Organizer
      2018度人工知能学会全国大会 (JSAI2018)
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 決定化されたグラフパターントライの学習アルゴリズム2018

    • Author(s)
      坂上 陽規, 栗田 和宏, 瀧川 一学, 有村 博紀
    • Organizer
      第105回人工知能基本問題研究会(SIG-FPAI),SIG-FPAI-B508, 人工知能学会
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] "モデル選択のためのサポートベクトル列挙"2018

    • Author(s)
      金森 憲太朗, 原 聡, 石畠 正和, 有村 博紀
    • Organizer
      第29回情報論的学習理論と機械学習(IBISML)研究会
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] "モデル選択のためのサポートベクトル列挙"2018

    • Author(s)
      金森 憲太朗, 原 聡, 石畠 正和, 有村 博紀
    • Organizer
      第29回情報論的学習理論と機械学習(IBISML)研究会
    • Data Source
      KAKENHI-PROJECT-18K19771
  • [Presentation] Optimization and Enumeration of Decision Trees from Massive Data Sets2017

    • Author(s)
      Hiroki Arimura, Kazuhito Osabe, Takeaki Uno
    • Organizer
      Proc. 21st Conference of the International Federation of Operational Research Societies (IFORS 2017), ME-18, Quebec, Canada, July 16-21, 2017
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] 長さ4の閉路を含まないグラフにおける誘導マッチングのならし定数時間列挙2017

    • Author(s)
      栗田 和宏, 和佐 州洋, 宇野 毅明, 有村 博紀
    • Organizer
      2016年度冬のLAシンポジウム
    • Place of Presentation
      京都大学 数理解析研究所(京都市)
    • Year and Date
      2017-02-01
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] ラベル情報と構造情報の相関を用いた三次元点集合マッチングの高速化とそのインフルエンザウイルス解析への応用2017

    • Author(s)
      佐々木 耀一,渋谷 哲朗,大森 亮介,伊藤 公人,有村 博紀
    • Organizer
      第9回データ工学と情報マネジメントに関するフォーラム (DEIM 2017),電子情報通信学会,日本データベース学会,情報処理学会
    • Place of Presentation
      高山グリーンホテル(岐阜県高山市)
    • Year and Date
      2017-03-06
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 正規化ハミング距離を用いた三次元点集合マッチングの高速化とインフルエンザウイルス解析への応用2017

    • Author(s)
      佐々木耀一,渋谷哲朗,大森亮介,伊藤公人,有村博紀
    • Organizer
      情報処理学会第79回全国大会
    • Place of Presentation
      名古屋大学 東山キャンパス(名古屋市)
    • Year and Date
      2017-03-16
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] グラフに含まれる誘導マッチングの列挙2017

    • Author(s)
      栗田 和宏, 和佐 州洋, 喜田 拓也, 有村 博紀
    • Organizer
      情報処理学会 第157回アルゴリズム研究会
    • Place of Presentation
      電気通信大学(東京都調布市)
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] ラベル情報と構造情報の相関を用いた三次元点集合マッチングの高速化とそのインフルエンザウイルス解析への応用2017

    • Author(s)
      佐々木 耀一,渋谷 哲朗,大森 亮介,伊藤 公人, 有村 博紀
    • Organizer
      第9回データ工学と情報マネジメントに関するフォーラム (DEIM2017)
    • Place of Presentation
      高山グリーンホテル
    • Year and Date
      2017-03-06
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] 決定化されたグラフパターントライの学習アルゴリズム2017

    • Author(s)
      坂上 陽規, 栗田 和宏, 瀧川 一学, 有村 博紀
    • Organizer
      第105回人工知能基本問題研究会(SIG-FPAI),SIG-FPAI-B508, 人工知能学会, 沖縄県石垣市, 2018年1月28日-29日
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] An Efficient Enumeration Algorithm for Dominating Sets in K-Degenerate graphs2017

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      電子情報通信学会 コンピューテーション 研究会
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] 正規化ハミング距離を用いた三次元点集合マッチングの高速化とインフルエンザウイルス解析への応用2017

    • Author(s)
      佐々木耀一, 渋谷哲朗, 大森亮介, 伊藤公人, 有村博紀
    • Organizer
      情報処理学会第79回全国大会
    • Place of Presentation
      名古屋大学
    • Year and Date
      2017-03-16
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] グラフに含まれる内周k以上の連結誘導部分グラフの効率良い列挙2017

    • Author(s)
      栗田 和宏, Alessio Conte, 和佐 州洋, 宇野 毅明, 有村 博紀
    • Organizer
      2017年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] k-縮退グラフに含まれる支配集合の列挙アルゴリズム2017

    • Author(s)
      栗田 和宏, 和佐 州洋, 有村 博紀, 宇野 毅明
    • Organizer
      2018年度 冬のLAシンポジウム, 8, 京都大学数理解析研究所, 京都, 2018年2月
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 最適な順序付き決定木の高速発見とその文書分類への応用2017

    • Author(s)
      長部 和仁,宇野 毅明,有村 博紀
    • Organizer
      第9回データ工学と情報マネジメントに関するフォーラム (DEIM 2017),電子情報通信学会,日本データベース学会,情報処理学会
    • Place of Presentation
      高山グリーンホテル(岐阜県高山市)
    • Year and Date
      2017-03-06
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] An Efficient Enumeration Algorithm for Dominating Sets in K-Degenerate graphs2017

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      電子情報通信学会 コンピューテーション研究会, (18), 高知工科大学永国寺キャンパス, 高知, 2017年12月
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] Fast Enumeration Algorithms for Induced Trees in Graphs2017

    • Author(s)
      Hiroki Arimura, Kazuhito Osabe, Takeaki Uno
    • Organizer
      Proc. 21st Conference of the International Federation of Operational Research Societies (IFORS 2017), Quebec, Canada, July 16-21, 2017
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] DAGの簡潔表現について2017

    • Author(s)
      高木 拓也, 有村 博紀
    • Organizer
      第9回データ工学と情報マネジメントに関するフォーラム (DEIM2017)
    • Place of Presentation
      高山グリーンホテル(岐阜県高山市)
    • Year and Date
      2017-03-06
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] DAGの簡潔表現について2017

    • Author(s)
      高木 拓也,有村 博紀
    • Organizer
      第9回データ工学と情報マネジメントに関するフォーラム (DEIM 2017),電子情報通信学会,日本データベース学会,情報処理学会
    • Place of Presentation
      高山グリーンホテル(岐阜県高山市)
    • Year and Date
      2017-03-06
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 長さ4の閉路を含まないグラフ誘導マッチングのならし定数時間列挙2017

    • Author(s)
      栗田 和宏, 和佐 州洋, 宇野 毅明, 有村 博紀
    • Organizer
      京都大学数理解析研究所RIMS研究集会「理論計算機科学の最先端」(冬のLAシンポジウム)
    • Place of Presentation
      京都大学 数理解析研究所(京都市)
    • Year and Date
      2017-02-01
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] Optimization and Enumeration of Decision Trees from Massive Data Sets2017

    • Author(s)
      Hiroki Arimura, Kazuhito Osabe, Takeaki Uno
    • Organizer
      Proc. 21st Conference of the International Federation of Operational Research Societies (IFORS 2017), ME-18, Quebec, Canada, July 16-21, 2017
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] グラフに含まれる内周k以 上の連結誘導部分グラフの効率良い列挙2017

    • Author(s)
      栗田 和宏, Alessio Conte, 和佐 州洋, 宇野 毅明, 有村 博紀
    • Organizer
      2017年度 夏のLAシンポジウム, 12, 天童温泉, 山形, 2017年7月
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] 非同期に文字が入力される複数ストリームに対する一般化接尾辞木の線形時間構築アルゴリズム2016

    • Author(s)
      髙木拓也,稲永俊介,有村博紀
    • Organizer
      第8回データ工学と情報マネジメントに関するフォーラム (DEIM2016)
    • Place of Presentation
      ヒルトン福岡シーホーク,福岡市
    • Year and Date
      2016-02-29
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] 多次元点位置検索データ構造のGPUを用いた高速化とトラジェクトリパターン照合への応用2016

    • Author(s)
      山本 雅大,笹川 裕人,有村 博紀
    • Organizer
      第8回データ工学と情報マネジメントに関するフォーラム (DEIM2016)
    • Place of Presentation
      ヒルトン福岡シーホーク,福岡市
    • Year and Date
      2016-02-29
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] Efficient Enumeration of Induced Matchings in Graphs without Short Cycles2016

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      Japan Conference on Discrete and Computational Geometory, Graphs, and Games 2016 (JCDCG^3 2016)
    • Place of Presentation
      Tokyo University of Science (Kagurazaka Campus, Tokyo)
    • Year and Date
      2016-09-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] グラフに含まれる誘導マッチングの列挙2016

    • Author(s)
      栗田 和宏, 和佐 州洋, 喜田 拓也, 有村 博紀
    • Organizer
      第157回アルゴリズム研究会,情報処理学会
    • Place of Presentation
      電気通信大学,東京都
    • Year and Date
      2016-03-06
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] アイテム集合列挙に基づく最適な順序付き決定木の高速発見2016

    • Author(s)
      長部 和仁, 宇野 毅明, 有村 博紀
    • Organizer
      人工知能学会 第102回人工知能基本問題研究会 (第102回SIG-FPAI)
    • Place of Presentation
      JR博多シティ(福岡市)
    • Year and Date
      2016-12-12
    • Data Source
      KAKENHI-PROJECT-16H01743
  • [Presentation] Efficient Enumeration of Induced Matchings in Graphs without Short Cycles2016

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    • Organizer
      Japan Conference on Discrete and Computational Geometory, Graphs, and Games 2016 (JCDCG^3 2016)
    • Place of Presentation
      東京理科大学(東京都)
    • Year and Date
      2016-09-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H05711
  • [Presentation] アイテム集合の和のクラスに対する効率良い代表パターンマイニング2016

    • Author(s)
      長部 和仁, 平田 耕一, 宇野 毅明, 有村 博紀
    • Organizer
      第8回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2016), P4-2, 電子情報通信学会
    • Place of Presentation
      ヒルトン福岡シーホーク,福岡市
    • Year and Date
      2016-02-29
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 三次元空間におけるRMSD距離に基づく近似点集合マッチングの高速化2016

    • Author(s)
      佐々木 耀一,渋谷 哲朗,伊藤 公人,有村 博紀
    • Organizer
      第8回データ工学と情報マネジメントに関するフォーラム (DEIM2016)
    • Place of Presentation
      ヒルトン福岡シーホーク,福岡市
    • Year and Date
      2016-02-29
    • Data Source
      KAKENHI-PROJECT-15K12022
  • [Presentation] 三次元空間における効率良い近似点集合マッチングと分子パターン照合への応用,2015

    • Author(s)
      佐々木耀一, 渋谷哲朗, 伊藤公人, 有村博紀,
    • Organizer
      第42回バイオ情報学(BIO)研究会
    • Place of Presentation
      沖縄科学技術大学院大学, 沖縄県国頭郡
    • Year and Date
      2015-06-23
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 二部グラフ中に含まれる弦二部誘導グラフの列挙2015

    • Author(s)
      和佐州洋,有村博紀,宇野毅明,平田耕一
    • Organizer
      第154回アルゴリズム研究会,情報処理学会
    • Place of Presentation
      九大西新プラザ,福岡市
    • Year and Date
      2015-09-28
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 極大誘導木遷移問題2015

    • Author(s)
      和佐 州洋,山中 克久,有村 博紀
    • Organizer
      第153回 アルゴリズム研究会,情報処理学会
    • Place of Presentation
      定山渓ビューホテル,札幌市
    • Year and Date
      2015-06-12
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 超辺の縮約を許した非巡回部分超グラフの効率よい列挙2014

    • Author(s)
      和佐州洋,有村博紀,宇野毅明,平田耕一
    • Organizer
      第143回アルゴリズム研究会,IPSJ
    • Place of Presentation
      飯坂温泉伊勢谷, 福島市
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Towards data assimilation of Malaria in Zambia2014

    • Author(s)
      Mayumbo Nyirenda, Hiroki Arimura, Kimihito Ito
    • Organizer
      Mathematical Science on Big Data Assimilation in Meteorology, poster
    • Place of Presentation
      Kyoto University, Kyoto
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] DAGによる文字列集合の圧縮表現に対する効率的な索引アルゴリズム2014

    • Author(s)
      伝住周平, 津田宏治, 有村博紀, 湊真一
    • Organizer
      人工知能学会 第92回人工知能基本問題研究会
    • Place of Presentation
      函館市民会館,函館市
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories2013

    • Author(s)
      Xiaoliang Geng, Takeaki Uno and Hiroki Arimura
    • Organizer
      The 5th International Conference on Knowledge Discovery and Information Retrieval (IC3K KDIR`13)
    • Place of Presentation
      Hotel Vilamoura,ポルトガル
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 大規模軌跡データからの群パターン発見のための実用的アルゴリズム2013

    • Author(s)
      耿 暁亮,宇野毅明, 有村博紀
    • Organizer
      第12回情報科学技術フォーラム(FIT2013)
    • Place of Presentation
      鳥取大学,鳥取市
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams2013

    • Author(s)
      Shuhei Denzumi, Koji Tsuda, Hiroki Arimura and Shin-ichi Minato
    • Organizer
      Prague Stringology Conference 2013
    • Place of Presentation
      Czech Technical University, Prague
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Simple Variable-Length Encodings for GPS Trajectory Compression2013

    • Author(s)
      Hirohito Sasakawa, Hiroki Arimura
    • Organizer
      The 16th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2013)
    • Place of Presentation
      Kyonggi University, Suwon, Korea
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 大規模軌跡データからの群パターン発見のための実用的アルゴリズム2013

    • Author(s)
      耿 暁亮,宇野毅明, 有村博紀
    • Organizer
      第12回情報科学技術フォーラム(FIT2013)
    • Place of Presentation
      鳥取大学
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] An Enumeration Problem of Connected and Acyclic Sub-hypergraphs in Hypergraphs2013

    • Author(s)
      Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, and Hiroki Arimura
    • Organizer
      The 16th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2013)
    • Place of Presentation
      Kyonggi University, Suwon, Korea
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 大規模非構造データからの高速パターンマイニング~ 大規模・非定型な実世界データからの知識発見へ向けて ~2013

    • Author(s)
      有村博紀
    • Organizer
      第4回ビッグデータと統計学研究集会
    • Place of Presentation
      北海道大学
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] 構造パターンの検索,学習,マイニング ~「かたち」から「意味」へ2013

    • Author(s)
      有村博紀
    • Organizer
      JSTさきがけ「知の創生」領域 第8回領域会議(領域統括 中島英之)
    • Place of Presentation
      能登ロイヤルホテル
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] 大規模非構造データからの高速パターンマイニング~大規模・非定型な実世界データからの知識発見へ向けて~2013

    • Author(s)
      有村博紀
    • Organizer
      第4回ビッグデータと統計学研究集会
    • Place of Presentation
      北海道大学学術交流会館,札幌市
    • Invited
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, and Hiroki Arimura: "An Enumeration Problem of Connected and Acyclic Sub-hypergraphs in Hypergraphs2013

    • Author(s)
      Kunihiro Wasa, Hiroki Arimura, Kouichi Hirata, and Takeaki Uno
    • Organizer
      The 16th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2013)
    • Place of Presentation
      Kyonggi University, Korea
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] Faster Broadword Pattern Matching Algorithms for Regular Expressions and Trees2013

    • Author(s)
      Hiroki Arimura
    • Organizer
      NII Shonan Meeting on Compact Data Structures for Big Data, NII
    • Place of Presentation
      Shonan Village Center, Zushi, Kanagawa
    • Invited
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 大規模非構造データからの高速パターンマイニング:実世界からの知識発見へ向けて2013

    • Author(s)
      有村博紀
    • Organizer
      第26回情報伝送と信号処理ワークショップ,電子情報通信学会
    • Place of Presentation
      登別温泉第一滝本館,登別市
    • Invited
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 大規模非構造データからの高速パターンマイニング:実世界からの知識発見へ向けて2013

    • Author(s)
      有村博紀
    • Organizer
      第26回情報伝送と信号処理ワークショップ
    • Place of Presentation
      登別温泉第一滝本館
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] Faster Broadword Pattern Matching Algorithms for Regular Expressions and Trees2013

    • Author(s)
      Hiroki Arimura
    • Organizer
      NII Shonan Meeting
    • Place of Presentation
      Shonan Kokusai Village
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] 構造パターンの検索,学習,マイニング ~「かたち」から「意味」へ2013

    • Author(s)
      有村博紀
    • Organizer
      JSTさきがけ「知の創生」領域 第8回領域会議(領域統括 中島英之)
    • Place of Presentation
      能登ロイヤルホテル,石川県羽咋郡
    • Invited
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 半構造データに対する効率良い近接パターン照合アルゴリズム2012

    • Author(s)
      和佐州洋,金田悠作,宇野毅明,有村博紀
    • Organizer
      DEIM2012
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 半構造データに対する効率良い近接パターン照合アルゴリズム2012

    • Author(s)
      和佐州洋, 金田悠作, 宇野毅明, 有村博紀
    • Organizer
      第4回データ工学と情報マネジメントに関するフォーラム(DEIM2012)
    • Place of Presentation
      舞子ビラ神戸(神戸市)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 複合イベント系列処理のための効率良い窓付きパターン照合アルゴリズム2012

    • Author(s)
      細川威樹, 金田悠作, 有村博紀
    • Organizer
      第4回データ工学と情報マネジメントに関するフォーラム(DEIM2012)
    • Place of Presentation
      舞子ビラ神戸(神戸市)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 複合イベント系列処理のための効率良い窓付きパターン照合アルゴリズム2012

    • Author(s)
      細川威樹,金田悠作,有村博紀
    • Organizer
      DEIM2012,B8-1
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Trajectory Pattern Matching Based on Bit-Prallelism for Large GPS Data2012

    • Author(s)
      Hirohito Sasakawa, Hiroki Arimura
    • Organizer
      Proc. 3rd IIAI International Conference on e-Services and Knowledge Management (IIAI ESKM 2012) , pp.66-71, 2012
    • Place of Presentation
      九州大学 (福岡市)
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 長大な拡張文字列パターンに対する大規模文字列照合の高速化2012

    • Author(s)
      笹川裕人, 金田悠作, 有村博紀
    • Organizer
      第4回データ工学と情報マネジメントに関するフォーラム(DEIM2012)
    • Place of Presentation
      舞子ビラ神戸(神戸市)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Pattern Mining from Trajectory GPS Data2012

    • Author(s)
      Xiaoliang Geng, Hiroki Arimura, Takeaki Uno
    • Organizer
      Proc. 3rd IIAI International Conference on e-Services and Knowledge Management (IIAI ESKM 2012) , pp.60-65, 2012
    • Place of Presentation
      九州大学 (福岡市)
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Pattern Mining from Trajectory GPS Data2012

    • Author(s)
      Xiaoliang Geng, Hiroki Arimura, Takeaki Uno
    • Organizer
      Proc. the 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), pp.60-65, 2012
    • Place of Presentation
      情報学研究所(東京都)
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] データマイニングにおける離散構造の列挙2012

    • Author(s)
      有村博紀
    • Organizer
      学習理論における組合せ論,研究集会
    • Place of Presentation
      九州大学 (福岡市)
    • Invited
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application2012

    • Author(s)
      Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
    • Organizer
      Proc. 18th Annual International Computing and Combinatorics Conference (COCOON2012), pp.347-359, Lecture Notes in Computer Science, Vol.7434, Springer, 2012
    • Place of Presentation
      Novotel Sydney on Darling Harbour (Australia)
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Notes on Sequence Binary Decision Diagrams : Relationship to Acyclic Automata and Complexities of Binary Set Operations2011

    • Author(s)
      Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura and Shin-ichi Minato
    • Organizer
      Prague Stringology Conference 2011 (PSC2011)
    • Place of Presentation
      Czech Technical Univ., Prague (Czech)
    • Year and Date
      2011-08-30
    • Data Source
      KAKENHI-PROJECT-20300051
  • [Presentation] Notes on Sequence Binary Decision Diagrams : Relationship to Acyclic Automata and Complexities of Binary Set Operations2011

    • Author(s)
      Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-Ichi Minato
    • Organizer
      Proc.Prague Stringology Conference 2011 (PSC'11)
    • Place of Presentation
      Czech Technical University in Prague (Czech Republic)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Implementation of Sequence BDDs in Erlang2011

    • Author(s)
      S. Denzumi, H. Arimura, S. Minato
    • Organizer
      Proc ACM ERLANG
    • Place of Presentation
      ACM
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] オンラインXMLストリーム処理のための効率良い木正規表現パターン照合アルゴリズム2011

    • Author(s)
      藤兼靖之, 金田悠作, 有村博紀
    • Organizer
      電子情報通信学会2011総合大会,予稿集
    • Place of Presentation
      オンライン
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Implementation of Sequence BDDs in Erlang2011

    • Author(s)
      Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato
    • Organizer
      Proc of Tenth ACM SIGPLAN Erlang Workshop
    • Place of Presentation
      Hitotsubashi Memorial Hall (東京都)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 木構造のランダム生成と学習2011

    • Author(s)
      和佐州洋, 有村博紀, 伊藤公人
    • Organizer
      第10回情報科学技術フォーラム(FIT2011)
    • Place of Presentation
      函館大学(函館市)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 大規模並列文字列照合のGPUによる高速化2011

    • Author(s)
      笹川裕人, 金田悠作, 有村博紀
    • Organizer
      第10回情報科学技術フォーラム(FIT2011)
    • Place of Presentation
      函館大学(函館市)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] High-speed String and Regular Expression Matching on FPGA2011

    • Author(s)
      Yusaku Kaneta, Shingo oshizawa, Shin-ichi Minato, Hiroki Arimura
    • Organizer
      Proc of Asia Pacific Signal and Information Processing Association Annual Summit and Conference 2011 (APSIPA ASC 2011)
    • Place of Presentation
      Grand New World Hotel, Xi'an (China)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] High-speed String and Regular Expression Matching on FPGA2011

    • Author(s)
      Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, and Hiroki Arimura
    • Organizer
      Asia Pacific Signal and Information Processing Association Annual Summit and Conference 2011 (APSIPA ASC 2011)
    • Place of Presentation
      Grand New World Hotel Xi'an (China)
    • Year and Date
      2011-10-18
    • Data Source
      KAKENHI-PROJECT-20300051
  • [Presentation] Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data2010

    • Author(s)
      Hiroki Arimuraa
    • Organizer
      Proc. 25th Int'l Symp. on Computer & Info. Sciences (ISCIS' 10), Lecture Notes in Electrical Engineering, Vol.62, Springer, 353-358(invited)
    • Place of Presentation
      London, UK
    • Year and Date
      2010-09-25
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Aligned Bipartite Episodes Between the Genera of Bacteria2010

    • Author(s)
      Takashi Katoh, Kouichi Hirata, Hiroki Arimura, Shigeki Yokoyama, Kimiko Matsuoka
    • Organizer
      2010 IEEE/ICME International Conference on Complex Medical Engineering (CME'10)
    • Place of Presentation
      Gold Coast, Australia
    • Year and Date
      2010-07-14
    • Data Source
      KAKENHI-PUBLICLY-21013001
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Fast Bit-Parallel Matching for Network and Regular Expressions2010

    • Author(s)
      Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
    • Organizer
      the 17th Symposium on String Processing and Information Retrieval (SPIRE2010)
    • Place of Presentation
      Los Cabos, Mexico
    • Year and Date
      2010-10-13
    • Data Source
      KAKENHI-PUBLICLY-21013001
  • [Presentation] Efficient Multiple Regular Expression Matching on FPGAs based on Extended SHIFT-AND Method2010

    • Author(s)
      Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
    • Organizer
      Proc. the 16th Workshop on Synthesis And System Integration of Mixed Information Technologies
    • Place of Presentation
      Taipei
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 効率良い正規表現照合のための並列ビット分配にもとづいたハードウェア指向アルゴリズム2010

    • Author(s)
      金田悠作, 吉澤真吾, 湊真一, 有村博紀, 宮永喜一
    • Organizer
      電子情報通信学会,リコンフィギャラブルシステム研究会,RECONF2009-75
    • Place of Presentation
      慶應大学理工学部(東京都)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Faster Bit-Parallel Algorithms for Unordered Pseudo-Tree Matching and Tree Homeomorphism2010

    • Author(s)
      Yusaku Kaneta, Hiroki Arimura
    • Organizer
      21st International Workshop on Combinatorial Algorithms (IWOCA2010)
    • Place of Presentation
      London, UK
    • Year and Date
      2010-07-27
    • Data Source
      KAKENHI-PUBLICLY-21013001
  • [Presentation] 系列二分決定グラフを用いた部分文字列索引の構築2010

    • Author(s)
      伝住周平,有村博紀,湊真一
    • Organizer
      第2回データ工学と情報マネジメントに関するフォーラム(DEIM 2010)
    • Place of Presentation
      淡路夢舞台国際会議場(兵庫県)
    • Year and Date
      2010-02-28
    • Data Source
      KAKENHI-PROJECT-20300051
  • [Presentation] Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data2010

    • Author(s)
      Hiroki Arimura
    • Organizer
      the 25th International Symposium on Computer and Information Sciences (ISCIS'10)
    • Place of Presentation
      London, UK(招待講演)
    • Year and Date
      2010-09-24
    • Data Source
      KAKENHI-PUBLICLY-21013001
  • [Presentation] オンラインパターン照合と並行オブジェクトに基づくイベントストリーム処理サーバの設計と実装2010

    • Author(s)
      細川威樹, 金田悠作, 有村博紀
    • Organizer
      第2回データ工学と情報マネジメントに関するフォーラム,DEIM2010,I-2
    • Place of Presentation
      淡路夢舞台国際会議場(兵庫県)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Dynamic Reconfigurable Bit-Parallel Architecture for Large-Scale Regular Expression Matching2010

    • Author(s)
      Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga
    • Organizer
      the 2010 IEEE International Conference on Field-Programmable Technology (FPT'10)
    • Place of Presentation
      Beijing, China
    • Year and Date
      2010-12-08
    • Data Source
      KAKENHI-PUBLICLY-21013001
  • [Presentation] 系列二分決定グラフを用いた部分文字列索引の構築2010

    • Author(s)
      伝住周平, 有村博紀, 湊真一
    • Organizer
      第2回データ工学と情報マネジメントに関するフォーラム(DEIM 2010)
    • Place of Presentation
      淡路夢舞台国際会議場
    • Year and Date
      2010-02-28
    • Data Source
      KAKENHI-PROJECT-20300051
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 非巡回正規表現に対する効率的なパターン照合2010

    • Author(s)
      金田悠作, 湊真一, 有村博紀
    • Organizer
      コンピュテーション研究会,電子情報通信学会,COMP
    • Place of Presentation
      北陸先端大
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Large-scale Pattern Matching on Reconfigurable Hardware2010

    • Author(s)
      Yusaku Kaneta, Hiroki Arimura
    • Organizer
      5th Workshop on Compression, Text, and Algorithms (WCTA'10)
    • Place of Presentation
      Los Cabos, Mexico
    • Year and Date
      2010-10-14
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 直列エピソードから構成可能なエピソードの単純な特徴づけ2009

    • Author(s)
      河東孝, 有村博紀, 平田耕一
    • Organizer
      LAシンポジウム
    • Place of Presentation
      京都大学, 数理解析研究所
    • Year and Date
      2009-02-03
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 動的刈り込み接尾辞木を用いた圧縮尺度計算によるスパム検出2009

    • Author(s)
      上村卓史, 池田大輔, 有村博紀
    • Organizer
      電子情報通信学会2009年総合大会
    • Place of Presentation
      松山大学
    • Year and Date
      2009-03-19
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Mining Frequent $k$-Partite Episodes from Event Sequences2009

    • Author(s)
      Takashi Katoh, Hiroki Arimura, Koichi Hirata
    • Organizer
      Sixth Workshop on Learning with Logics and Logics for Learning(LLLL 2009)
    • Place of Presentation
      京大会館(京都府)
    • Year and Date
      2009-07-06
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 木の最適ラベリング問題とその進化系統樹への応用2009

    • Author(s)
      柳橋史成,伊藤公人,有村博紀
    • Organizer
      第16回SIGBIO
    • Place of Presentation
      中央大学後楽園キャンパス
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 木の最適ラベリング問題とその進化系統樹への応用2009

    • Author(s)
      柳橋史成, 伊藤公人, 有村博紀
    • Organizer
      第16回バイオ情報学研究会(SIG BIO), 情報処理学会
    • Place of Presentation
      中央大学後楽園キャンパス
    • Year and Date
      2009-03-06
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 文字列ストリームのための近似的な索引構造2009

    • Author(s)
      上村卓史, 喜田拓也, 有村博紀
    • Organizer
      DEIM Forum 2008, DE研究会
    • Place of Presentation
      静岡県掛川市ヤマハリゾートつま恋
    • Year and Date
      2009-03-10
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Mining Frequent $k$-Partite Episodes from Event Sequences2009

    • Author(s)
      Takashi Katoh, Hiroki Arimura, Koichi Hirata
    • Organizer
      Sixth Workshop on Learning with Logics and Logics for Learning(LLLL 2009)
    • Place of Presentation
      京大会館(京都府)
    • Year and Date
      2009-07-06
    • Data Source
      KAKENHI-PUBLICLY-21013001
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 高速ストリーム処理のための文字列パターン照合手法とそのFPGA設計2009

    • Author(s)
      金田悠作, 吉澤真吾, 湊真一, 有村博紀, 宮永喜一
    • Organizer
      電子情報通信学会2009年総合大会
    • Place of Presentation
      松山大学
    • Year and Date
      2009-03-20
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Inference of Geographic Transmission Probability of In uenza Viruses from a Large Phylogenetic Tree2009

    • Author(s)
      Fumiaki Yanagihashi, Kimihito Ito, Hiroki Arimura
    • Organizer
      The Twentieth International Conference on Genome Informatics(GIW 2009)
    • Place of Presentation
      Pacifico Yokohama(Yokohama)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Presentation] 極小出現区間を用いた頻出エピソード発見アルゴリズムの高速化2008

    • Author(s)
      大谷英行,喜田拓也,宇野毅明,有村博紀
    • Organizer
      情報処理学会jDBフォーラムDBS研
    • Place of Presentation
      小樽市民会館
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] ブラウジング支援のための一覧性の高いキーワードリストの抽出2008

    • Author(s)
      上村卓史・喜田拓也・有村博紀
    • Organizer
      情報処理学会第70回全国大会
    • Place of Presentation
      筑波
    • Year and Date
      2008-03-14
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Presentation] XQUBE:具体例と演示からのXQuery問合せ構築のための視覚言語2008

    • Author(s)
      筒井淳平,有村博紀
    • Organizer
      iDBフォーラム2008
    • Place of Presentation
      福島,飯坂ホテル聚楽
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] ラベル付きグラフからのウォークの多項式時間学習2008

    • Author(s)
      筒井淳平, 有村博紀
    • Organizer
      電子情報通信学会, コンピュテーション研究会
    • Place of Presentation
      大阪府立大学
    • Year and Date
      2008-04-18
    • Data Source
      KAKENHI-PROJECT-20240014
  • [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
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] 極小出現区間を用いた頻出エピソード発見アルゴリズムの高速化2008

    • Author(s)
      大谷英行, 喜田拓也, 宇野毅明, 有村博紀
    • Organizer
      情報処理学会jDBフォーラムDBS研/FI研合同研究会
    • Place of Presentation
      小樽市民会館
    • Year and Date
      2008-06-12
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] XQUBE : 具体例と演示からのXQuery問合せ構築のための視覚言語2008

    • Author(s)
      筒井淳平, 有村博紀
    • Organizer
      iDBフォーラム2008, 情報処理学会DBS研
    • Place of Presentation
      福島, 飯坂ホテル聚楽
    • Year and Date
      2008-09-14
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data2008

    • Author(s)
      H.Arimura
    • Organizer
      Proc.12th Pacific-Asia Conf.on Knowledge Discovery and Data Mining (PAKDD2008)(Springer)
    • Place of Presentation
      LNCS, Vo1.5012(招待講演)
    • Data Source
      KAKENHI-PROJECT-20240014
  • [Presentation] ブラウジング支援のための一覧性の高いキーワードリストの抽出2008

    • Author(s)
      上村卓史, 喜田拓也, 有村博紀
    • Organizer
      情報処理学会第70回全国大会
    • Place of Presentation
      筑波・筑波大学
    • Year and Date
      2008-03-14
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Presentation] 特別推進研究-知識基盤形成のための大規模半構造データからの超高速パターン発見-2006

    • Author(s)
      有村博紀
    • Organizer
      情報学シンポジウム(日本学術会議, 情報処理学会, 国際学術連合科学技術データ委員会他)
    • Place of Presentation
      東京
    • Year and Date
      2006-01-17
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [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
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17002008
  • [Presentation] Bit-patallel Approximate Trajectory Matching for 2-dimensional Trajectory Data

    • Author(s)
      Hirohito Sasakawa, Masahiro Yamamoto, Kazuhiro Kurita, and Hiroki Arimura
    • Organizer
      The 17th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2014)
    • Place of Presentation
      Tokyo Science University(Tokyo)
    • Year and Date
      2014-09-15 – 2014-09-16
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] 二次元軌跡データに対する高速なパターン照合アルゴリズム

    • Author(s)
      山本雅大、栗田和宏、笹川裕人、有村博紀
    • Organizer
      第13回情報科学技術フォーラム講演論文集(FIT2014), 情報処理学会・電子情報通信学会
    • Place of Presentation
      筑波大学(筑波市)
    • Year and Date
      2014-09-04 – 2014-09-06
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] 実世界非構造データからの高速マイニング ~エネルギーデータの高度利用に向けて~

    • Author(s)
      有村博紀
    • Organizer
      シンポジウムセッションTC「エネルギービッグデータの解析と利用」, 平成26年電気学会電子・情報・システム部門大会
    • Place of Presentation
      島根大学松江キャンパス(松江市)
    • Year and Date
      2014-09-03 – 2014-09-05
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] 二次元軌跡データに対する高速なパターン照合アルゴリズム

    • Author(s)
      山本雅大、栗田和宏、笹川裕人、有村博紀
    • Organizer
      第13回情報科学技術フォーラム講演論文集(FIT2014), 情報処理学会・電子情報通信学会
    • Place of Presentation
      筑波大学 (筑波市)
    • Year and Date
      2014-09-03 – 2014-09-05
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 大規模トラジェクトリ照合のためのビット並列計算を用いた省メモリアルゴリズム

    • Author(s)
      笹川 裕人, 山本 雅大, 栗田 和宏, 有村 博紀
    • Organizer
      第7回Webとデータベースに関するフォーラム (WebDB Forum 2014) (2014年11月20日に情報処理学会データベースシステム研究会「学生奨励賞」を受賞)
    • Place of Presentation
      芝浦工業大 (Tokyo, Japan)
    • Year and Date
      2014-11-19 – 2014-11-20
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] K-縮退グラフに含まれる誘導木の列挙

    • Author(s)
      和佐州洋,有村博紀,宇野毅明
    • Organizer
      第148回 アルゴリズム研究会,情報処理学会
    • Place of Presentation
      大和屋 (松山市,愛媛)
    • Year and Date
      2014-06-13 – 2014-06-14
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Fast Regular Expression Matching Based on Dual Glushkov NFA

    • Author(s)
      Ryutaro Kurai, Norihito Yasuda, Hiroki Arimura, Shinobu Nagayama, Shin-ichi Minato
    • Organizer
      Prague Stringology Conference 2014 (PSC'14)
    • Place of Presentation
      Czech Technical University (Prague, Czech)
    • Year and Date
      2014-09-01 – 2014-09-03
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] Bit-parallel Approximate Trajectory Matching for 2-dimensional Trajectory Data

    • Author(s)
      Hirohito Sasakawa, Masahiro Yamamoto, Kazuhiro Kurita, and Hiroki Arimura
    • Organizer
      The 17th Japan Conference on Discrete and Computatoinal Geometry and Graphs (JCDCGG 2014)
    • Place of Presentation
      Tokyo Science University (Kagurazaka, Tokyo)
    • Year and Date
      2014-09-15 – 2014-09-16
    • Data Source
      KAKENHI-PROJECT-24240021
  • [Presentation] 大規模トラジェクトリ照合のためのビット並列計算を用いた省メモリアルゴリズム

    • Author(s)
      笹川裕人、山本雅大、栗田和宏、有村博紀
    • Organizer
      第7回Webとデータベースに関するForum(WebDB Forum 2014)(情報処理学会データベースシステム研究会学生奨励賞を2014年11月20日に受賞)
    • Place of Presentation
      芝浦工業大学(東京)
    • Year and Date
      2014-11-19 – 2014-11-20
    • Data Source
      KAKENHI-PUBLICLY-25120501
  • [Presentation] 実世界非構造データからの高速マイニング ~エネルギーデータの高度利用に向けて~

    • Author(s)
      有村博紀
    • Organizer
      シンポジウムセッションTC「エネルギービッグデータの解析と利用」, 平成26年電気学会電子・情報・システム部門大会
    • Place of Presentation
      島根大学松江キャンパス(松江市)
    • Year and Date
      2014-09-03 – 2014-09-05
    • Invited
    • Data Source
      KAKENHI-PROJECT-24240021
  • 1.  KIDA Takuya (70343316)
    # of Collaborated Projects: 10 results
    # of Collaborated Products: 37 results
  • 2.  SHIMOZONO S. (70243988)
    # of Collaborated Projects: 8 results
    # of Collaborated Products: 0 results
  • 3.  MINATO Shin-ichi (10374612)
    # of Collaborated Projects: 8 results
    # of Collaborated Products: 55 results
  • 4.  SHINOHARA Ayumi (00226151)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 0 results
  • 5.  TAKEDA Masayuki (50216909)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 0 results
  • 6.  SAKAMOTO Hiroshi (50315123)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 3 results
  • 7.  UNO Takeaki (00302977)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 58 results
  • 8.  ZEUGMANN Thomas (60374609)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 0 results
  • 9.  HIRATA Kouichi (20274558)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 22 results
  • 10.  ITO Kimihito (60396314)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 27 results
  • 11.  SHOUDAI Takayoshi (50226304)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 12.  SHINOHARA Takeshi (60154225)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 13.  ISHINO Akira (10315129)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 14.  JORDAN Charles (60647577)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 15.  竹内 章 (00117152)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 16.  OKUBO Yoshiaki (40271639)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  SHIN Yoshihiro (60523587)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 18.  OKAMOTO Hiroshi (00374067)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 19.  KUBOYAMA Tetsuji (80302660)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 20.  CUTURI Marco (80597344)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 21.  FUKAMACHI Shuichi (30274559)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 22.  ISHIZAKA Hiroki (70260726)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 23.  SATO Taisuke (90272690)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 24.  HARAGUCHI Makoto (40128450)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 25.  IMAI Mutsumi (60255601)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 26.  SATO Masako (50081419)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 27.  IKEDA Daisuke (00294992)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 28.  KASAHARA Yoshiaki (60284577)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 29.  Motomura Masato (90574286)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 30.  有川 節夫 (40037221)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 31.  高木 剛 (60404802)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 32.  杉本 典子 (80271120)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 33.  古川 康一 (10245615)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 34.  瀧川 一学 (10374597)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 4 results
  • 35.  堀山 貴史 (60314530)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 36.  津田 宏治 (90357517)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 2 results
  • 37.  鷲尾 隆 (00192815)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 38.  安田 宜仁 (50396149)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 39.  鍋島 英知 (10334848)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 40.  井上 武 (70873678)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 41.  美添 一樹 (80449115)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 42.  西野 正彬 (90794529)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 43.  山本 章博 (30230535)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 44.  小林 靖明 (60735083)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 7 results
  • 45.  Ishihata Masakazu
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 46.  Nishibayashi Takashi
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 47.  小宮山 純平
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 48.  和佐 州洋
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi