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

Expansion of efficient search and discovery technology for processing massive data stream in the real world

Research Project

Project/Area Number 18K19771
Research Category

Grant-in-Aid for Challenging Research (Exploratory)

Allocation TypeMulti-year Fund
Review Section Medium-sized Section 60:Information science, computer engineering, and related fields
Research InstitutionHokkaido University

Principal Investigator

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

Co-Investigator(Kenkyū-buntansha) トーマス ツォイクマン  北海道大学, 情報科学研究院, 教授 (60374609)
喜田 拓也  北海学園大学, 工学部, 教授 (70343316)
Project Period (FY) 2018-06-29 – 2021-03-31
Project Status Completed (Fiscal Year 2020)
Budget Amount *help
¥6,240,000 (Direct Cost: ¥4,800,000、Indirect Cost: ¥1,440,000)
Fiscal Year 2020: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2019: ¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2018: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Keywordsストリームデータ処理 / データマイニング / 情報検索 / 多重性 / 文脈性 / 複雑パターン / 並列ソルバー / 大規模並列列挙 / 大規模知識処理 / 大規模列挙
Outline of Final Research Achievements

In this research, we study efficient methods for search, count, and discovery of complex patterns and rules from multiple, massive, changing, uncertain, unstructured stream data as a basis of large-scale time-space data stream processing in the real world. In this research project, Hiroki Arimura conducted research and take part in R & D of fast pattern search and discovery, Thomas Zeugmann with Arimura studied the theory of multi-stream data processing and knowledge discovery, and Charles Jordan with Arimura devised efficient massively parallel and stochastic search methods for combinatorial structures as patterns. We focus on multiplicity, adaptivity, context-sensitiveness, and low-memory footprint of the algorithms, and built implementations and theretical and empirical analyses of the devised algorithms as libraries for real world data processing.

Academic Significance and Societal Importance of the Research Achievements

2020年代に到来すると予測される「1兆センサー社会」に向けて、大量非構造データの効率良い処理は、重要な課題となっている。本研究では、離散構造処理と大規模ストリーム処理技術を融合することで、実応用で求められる複雑な構造パターンに対する検索・発見処理のための超高速アルゴリズムの実現に挑戦し,その構成原理と可能性を明らかにする。これは、多数センサーからの生成と、ネットワーク上の流通とオンライン処理、人工知能技術をもちいた高度知識処理による人間・社会・組織に有用な知識の生成に至る大量非構造データのライフサイクル全体を支える基盤技術の開発につながるものであり、今後の高度情報社会に貢献する。

Report

(4 results)
  • 2020 Annual Research Report   Final Research Report ( PDF )
  • 2019 Research-status Report
  • 2018 Research-status Report
  • Research Products

    (38 results)

All 2020 2019 2018 Other

All Int'l Joint Research (1 results) Journal Article (19 results) (of which Int'l Joint Research: 7 results,  Peer Reviewed: 19 results,  Open Access: 4 results) Presentation (16 results) (of which Int'l Joint Research: 1 results) Book (1 results) Remarks (1 results)

  • [Int'l Joint Research] National University of Singapore(シンガポール)

    • Related Report
      2020 Annual Research Report
  • [Journal Article] On the amount of nonconstructivity in learning formal languages from text2020

    • Author(s)
      Jain Sanjay、Stephan Frank、Zeugmann Thomas
    • Journal Title

      Information and Computation

      Volume: 104668 Pages: 104668-104668

    • DOI

      10.1016/j.ic.2020.104668

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings2020

    • Author(s)
      Zeugmann Thomas
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12098 Pages: 124-136

    • DOI

      10.1007/978-3-030-51466-2_11

    • ISBN
      9783030514655, 9783030514662
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed
  • [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: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed
  • [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 Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      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
    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [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
    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] The Complexity of Induced Tree Reconfiguration Problems2019

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

      IEICE Transactions on Information and Systems

      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
    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2020 Annual Research Report 2019 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [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

    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] mts: a light framework for parallelizing tree search codes2019

    • Author(s)
      David Avis, Charles Jordan
    • Journal Title

      Optimization Methods and Software

      Volume: online Issue: 2-3 Pages: 1-22

    • DOI

      10.1080/10556788.2019.1692344

    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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
    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] Taking discrete roots in the field Zp and in the ring Zpe2019

    • Author(s)
      Thomas Zeugmann
    • Journal Title

      Technical Report, Division of Computer Science, Hokkaido University,

      Volume: TCS-TR-A-19-83 Pages: 1-38

    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [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

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [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

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [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
    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference.2018

    • Author(s)
      Ziyuan Gao, Sanjay Jain, Frank Stephan, Thomas Zeugmann
    • Journal Title

      ALT 2018

      Volume: aaa Pages: 413-437

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Parallel Enumeration of Triangulations2018

    • Author(s)
      Charles Jordan, Michael Joswig, Lars Kastner
    • Journal Title

      Electr. J. Comb.

      Volume: Vol.25, No.3

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] mplrs: A scalable parallel vertex/facet enumeration code.2018

    • Author(s)
      David Avis, Charles Jordan
    • Journal Title

      Math. Program. Comput.

      Volume: Vol.10, No.2 Pages: 267-302

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Presentation] デカルト木照合の部分系列への拡張2020

    • Author(s)
      加井丈志,光吉健汰,古谷 勇
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会(発表決定)
    • Related Report
      2020 Annual Research Report
  • [Presentation] 一貫性に基づいた特徴選択のための高速な列挙アルゴリズム2020

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第116回人工知能基本問題研究会(SIG-FPAI), 人工知能学会, オンライン,March 2021
    • Related Report
      2020 Annual Research Report
  • [Presentation] Variable Importance Cloudの要約方法と決定木に対する実験的評価2020

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

    • Author(s)
      又 康太, 金森 憲太朗, 有村 博紀
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020), オンライン, 2020年6月4-7日
    • Related Report
      2020 Annual Research Report
  • [Presentation] 混合整数線形計画法に基づく実現可能性を考慮した反事実的説明法2020

    • Author(s)
      金森 憲太朗, 高木 拓也, 小林 健, 有村 博紀
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020), オンライン, 2020年6月4-7日
    • Related Report
      2020 Annual Research Report
  • [Presentation] 決定木要約の効率良い構築法 -- 説明可能な人工知能の実現に向けて --2020

    • Author(s)
      有村 博紀, 金森 憲太朗, 王 叶
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020), オンライン, 2020年6月4-7日
    • Related Report
      2020 Annual Research Report
  • [Presentation] ランダム分割木に基づく勾配ブースティングの検証2019

    • Author(s)
      松田 祐汰, 瀧川 一学, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019), ウインクあいち, 名古屋市
    • Related Report
      2019 Research-status Report
  • [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
    • Related Report
      2019 Research-status Report
    • Int'l Joint Research
  • [Presentation] 説明可能な機械学習に向けて:整数計画法と列挙に基づく最適決定木の厳密学習アルゴリズムの実験的比較2019

    • Author(s)
      王 叶, 有村 博紀
    • Organizer
      第22回情報論的学習理論ワークショップ (IBIS 2019), ウインクあいち, 名古屋市
    • Related Report
      2019 Research-status Report
  • [Presentation] 大きな正規表現に対する系列二分決定グラフを用いた効率よい照合手法2019

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

    • Author(s)
      谷 陽太,平田 耕一,有村 博紀
    • Organizer
      第11回データ工学と情報マネジメントに関するフォーラム (DEIM2019)
    • Related Report
      2018 Research-status Report
  • [Presentation] "An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs"2019

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

    • Author(s)
      金森 憲太朗,有村 博紀
    • Organizer
      第108回人工知能基本問題研究会(SIG-FPAI)
    • Related Report
      2018 Research-status Report
  • [Presentation] "モデル選択のためのサポートベクトル列挙"2018

    • Author(s)
      金森 憲太朗, 原 聡, 石畠 正和, 有村 博紀
    • Organizer
      第29回情報論的学習理論と機械学習(IBISML)研究会
    • Related Report
      2018 Research-status Report
  • [Presentation] "イベント系列からの有意性を考慮した菱形エピソードマイニング"2018

    • Author(s)
      金森 憲太朗, 原 聡, 石畠 正和, 有村 博紀
    • Organizer
      2018度人工知能学会全国大会 (JSAI2018)
    • Related Report
      2018 Research-status Report
  • [Presentation] "グラフ断片決定木を用いたグラフ特徴抽出手法"2018

    • Author(s)
      坂上 陽規,瀧川 一学 ,有村 博紀
    • Organizer
      2018度人工知能学会全国大会 (JSAI2018)
    • Related Report
      2018 Research-status Report
  • [Book] Guest Editor's Foreword. Special Issue on Learning Theory and Complexity, Theor. Comput. Sci. Vol.733, pp.1-32018

    • Author(s)
      Thomas Zeugmann
    • Total Pages
      98
    • Publisher
      Elsevier
    • Related Report
      2018 Research-status Report
  • [Remarks] Publications: Hiroki Arimura

    • URL

      http://www-ikn.ist.hokudai.ac.jp/~arim/publication.html

    • Related Report
      2020 Annual Research Report

URL: 

Published: 2018-07-25   Modified: 2022-01-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi