Hiroki Arimura

发表

2Pb4-6 Generation of Rotary Motion by Circular/Elliptic Drive Synthesized with Straight-Move Ultrasonic Motors(Poster Session)

Hiroki Arimura, Mitsutaka Hikita, 2011 .

LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining

Hiroki Arimura, Takeaki Uno, Masashi Kiyomi, 2005 .

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

Hiroki Arimura, Rajeev Raman, Yusaku Kaneta, 2012, J. Discrete Algorithms.

High-speed string and regular expression matching on FPGA

Hiroki Arimura, Shingo Yoshizawa, Shin-ichi Minato, 2011 .

Modelling Semi-structured Documents with Hedges for Deduction and Induction

Akihiro Yamamoto, Hiroki Arimura, Akira Ishino, 2001, ILP.

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

Hiroki Arimura, Yusaku Kaneta, Hiroki Arimura, 2010, J. Discrete Algorithms.

Pattern Matching with Taxonomic Information

Hiroki Arimura, Takuya Kida, 2004 .

Inductive Inference of Prolog Programs with Linear Data Dependency from Positive Data

Hiroki Arimura, 篠原武, Takeshi Shinohara, 1993 .

Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data

Hiroki Arimura, Hirohito Sasakawa, 2012, 2012 IIAI International Conference on Advanced Applied Informatics.

Key semantics extraction by dependency tree mining

Hiroki Arimura, Satoshi Morinaga, Susumu Akamine, 2005, KDD '05.

Knowledge Discovery from Large Semi-structured Data Streams

Hiroki Arimura, Setsuo Arikawa, Kenji Abe, 2003 .

Inductive inference of unbounded unions of pattern languages from positive data

Hiroki Arimura, Takeshi Shinohara, 2000, Theor. Comput. Sci..

Sparse and Truncated Suffix Trees on Variable-Length Codes

Hiroki Arimura, Takashi Uemura, 2011, CPM.

Polynomial time inference of a subclass of context-free transformations

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka, 1992, COLT '92.

Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words

Hiroki Arimura, Shinichi Shimozono, 1998, ISAAC.

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining

Hiroki Arimura, Takeaki Uno, Hiroki Arimura, 2007, Discovery Science.

Efficient Substring Traversal with Suffix Arrays

Hiroki Arimura, Toru Kasai, Setsuo Arikawa, 2001 .

D-4-2 An Efficient Stream Pattern Matching Algorithm for Tree Regular Expressions

Hiroki Arimura, Yusaku Kaneta, Yasuyuki Fujikane, 2011 .

Efficient Data Mining from Large Text Databases

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2002, Progress in Discovery Science.

Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams

Hiroki Arimura, Setsuo Arikawa, Kenji Abe, 2003, JSAI Workshops.

Discovering Co-Cluster Structure from Relationships between Biased Objects

Hiroki Arimura, Takuya Kida, Iku Ohama, 2018, IEICE Trans. Inf. Syst..

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices pdf

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2019, ArXiv.

Discovering Relevance-Dependent Bicluster Structure from Relational Data: A Model and Algorithm

Hiroki Arimura, Takuya Kida, Iku Ohama, 2018, Transactions of the Japanese Society for Artificial Intelligence.

Web Information Extraction Based on Generalized User Navigation Path

Hiroki Arimura, Kimihito Ito, Junpei Tsutsui, 2007 .

DenseZDD: A Compact and Fast Index for Families of Sets

Hiroki Arimura, Kunihiko Sadakane, Koji Tsuda, 2018, Algorithms.

Learning of first-Order Formulas and Inductive Logic Programming ( "Recent Dvelopments in the Theory and Applications of Machine Learning")

Hiroki Arimura, Kouichi Hirata, 1999 .

Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees

Hiroki Arimura, Kouichi Hirata, Takeaki Uno, 2013, SISAP.

Learning Unions of Tree Patterns Using Queries

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka, 1995, ALT.

A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences

Hiroki Arimura, Kouichi Hirata, Takashi Katoh, 2009, PAKDD.

Statistical Emerging Pattern Mining with Multiple Testing Correction

Hiroki Arimura, Junpei Komiyama, Shin-ichi Minato, 2017, KDD.

Faster Multiple Pattern Matching System on GPU based on Bit-Parallelism

Hiroki Arimura, Hirohito Sasakawa, 2013 .

A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases

Hiroki Arimura, Setsuo Arikawa, Atsushi Wataki, 1998, ALT.

Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data

Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, 1994, STACS.

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations

Hiroki Arimura, Ryo Yoshinaka, Shin-ichi Minato, 2016, Discret. Appl. Math..

Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs

Hiroki Arimura, Shin-ichi Minato, S. Minato, 2006, KDID.

Frequent closed item set mining based on zero-suppressed BDDs (論文特集:データマイニングと統計数理)

Hiroki Arimura, Shin-ichi Minato, Hiroki Arimura, 2007 .

Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization pdf

Hiroki Arimura, Kento Uemura, Yuichi Ike, 2020, ArXiv.

Implementation of sequence BDDs in Erlang

Hiroki Arimura, Shin-ichi Minato, Shuhei Denzumi, 2011, Erlang '11.

Extracting Partial Structures from HTML Documents

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2000, FLAIRS.

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts

Hiroki Arimura, Shunsuke Inenaga, Dany Breslauer, 2015, Algorithmica.

Efficient Construction of a Summary Data Structure for Decision Trees

Hiroki Arimura, 2020 .

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing pdf

Hiroki Arimura, Kunihiko Sadakane, Shunsuke Inenaga, 2017, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Data Intensive Computing : No.2 Frequent Itemset Mining Algorithms( Intelligent Computing and Related Issues (2))

Hiroki Arimura, Takeaki Uno, 2007 .

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2018, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Enumeration of complete set of flock patterns in trajectories

Hiroki Arimura, Takeaki Uno, Takuya Takagi, 2014, IWGS.

Unsupervised Spam Detection by Document Complexity Estimation

Hiroki Arimura, Daisuke Ikeda, Takashi Uemura, 2008, Discovery Science.

Enumeration of Distinct Support Vectors for Interactive Decision Making pdf

Hiroki Arimura, Satoshi Hara, Masakazu Ishihata, 2019, ArXiv.

LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets

Hiroki Arimura, Takeaki Uno, Tatsuya Asai, 2003, FIMI.

Efficient Substructure Discovery from Large Semi-Structured Data

Hiroki Arimura, Setsuo Arikawa, Kenji Abe, 2001, IEICE Trans. Inf. Syst..

Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data

Hiroki Arimura, Hiroki Arimura, 2008, PAKDD.

Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression

Hiroki Arimura, Shunsuke Inenaga, Takuya Takagi, 2017, SPIRE.

Computational Challenges of Massive Data Sets and Randomness in Computation (J.UCS Special Issue on the First and Second Japanese-German Frontiers of Science Symposia)

Jörg Rothe, Hiroki Arimura, 2006, J. Univers. Comput. Sci..

Efficient Enumeration of Dominating Sets for Sparse Graphs pdf

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2018, ISAAC.

Efficient Inductive Inference of Primitive Prologs from Positive Data

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka, 1992, ALT.

Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching

Hiroki Arimura, Yoshikazu Miyanaga, Shingo Yoshizawa, 2010, 2010 International Conference on Field-Programmable Technology.

Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method

Hiroki Arimura, Daisuke Ikeda, Takuya Kida, 2011 .

Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2014, IEICE Trans. Inf. Syst..

Finding tree patterns consistent with positive and negative examples using queries

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka, 2004, Annals of Mathematics and Artificial Intelligence.

An Extension of the Infinite Relational Model Incorporating Interaction between Objects

Hiroki Arimura, Takuya Kida, Iku Ohama, 2013, PAKDD.

A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages

Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, 1991, Nonmonotonic and Inductive Logic.

Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score

Hiroki Arimura, Tetsuo Shibuya, Kimihito Ito, 2015, SISAP.

Discovering Relevance-Dependent Bicluster Structure from Relational Data

Hiroki Arimura, Takuya Kida, Iku Ohama, 2017, IJCAI.

Identification of Tree Translation Rules from Examples

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2000, ICGI.

Knowledge Discovery from Semistructured Texts

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2002, Progress in Discovery Science.

Text Data Mining with Optimized Pattern Discovery

Hiroki Arimura, Hiroki Arimura, 2000 .

Unsupervised spam detection by document complexity estimation

Hiroki Arimura, Daisuke Ikeda, Takashi Uemura, 2008 .

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

Hiroki Arimura, Toru Kasai, Setsuo Arikawa, 2001, CPM.

Fast Regular Expression Matching Based On Dual Glushkov NFA

Hiroki Arimura, Shinobu Nagayama, Norihito Yasuda, 2014, Stringology.

Efficient discovery of optimal word-association patterns in large text databases

Hiroki Arimura, Setsuo Arikawa, Shinichi Shimozono, 2009, New Generation Computing.

Learning Acyclic First-Order Horn Sentences from Entailment

Hiroki Arimura, Hiroki Arimura, 1997, ALT.

Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data

Hiroki Arimura, Takeshi Shinohara, 1996, ALT.

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2019, IWOCA.

Protein Motif Discovery from Positive Examples by Minimal Multiple Generalization over Regular Patterns

Hiroki Arimura, Setsuo Arikawa, Takeshi Shinohara, 1994 .

Fast Bit-Parallel Matching for Network and Regular Expressions

Hiroki Arimura, Shin-ichi Minato, Yusaku Kaneta, 2010, SPIRE.

A Dynamically Reconfigurable FPGA-Based Pattern Matching Hardware for Subclasses of Regular Expressions

Hiroki Arimura, Yoshikazu Miyanaga, Shingo Yoshizawa, 2012, IEICE Trans. Inf. Syst..

Online Prediction of Semi-structured Data Streams and Its Application to XML Data Compression

Hiroki Arimura, Setsuo Arikawa, Shotaro Kawano, 2003 .

Depth-Bounded Inference for Nonterminating Prologs

Hiroki Arimura, 1990 .

Online algorithms for mining semi-structured data stream

Hiroki Arimura, Setsuo Arikawa, Kenji Abe, 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

Optimized Substructure Discovery for Semi-structured Data

Hiroki Arimura, Setsuo Arikawa, Kenji Abe, 2002, PKDD.

On approximation algorithms for local multiple alignment

Hiroki Arimura, Tatsuya Akutsu, Shinichi Shimozono, 2000, RECOMB '00.

Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs

Hiroki Arimura, Shin-ichi Minato, Hiroki Arimura, 2005, International Workshop on Challenges in Web Information Retrieval and Integration.

Inductive Logic Programming: From Logic of Discovery to Machine Learning

Akihiro Yamamoto, Hiroki Arimura, 2000 .

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations

Hiroki Arimura, Ryo Yoshinaka, Shin-ichi Minato, 2012, Inf. Process. Lett..

Mining Maximal Flexible Patterns in a Sequence

Hiroki Arimura, Takeaki Uno, 2007, JSAI.

Discovering Frequent Substructures in Large Unordered Trees

Hiroki Arimura, Shin-Ichi Nakano, Takeaki Uno, 2003, Discovery Science.

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

Hiroki Arimura, Kunihiko Sadakane, Shunsuke Inenaga, 2016, IWOCA.

Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data

Hiroki Arimura, Hiroki Arimura, 2010, ISCIS.

Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2012, COCOON.

Fast Identification of Heavy Hitters by Cached and Packed Group Testing

Hiroki Arimura, Takeaki Uno, Yusaku Kaneta, 2019, SPIRE.

Multi-Layered Framework for Modeling Relationships between Biased Objects

Hiroki Arimura, Takuya Kida, Iku Ohama, 2015, SDM.

Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection

Hiroki Arimura, Jun Sakuma, Koji Tsuda, 2014, WPES.

Automatic Detection of Geomagnetic Sudden Commencement Using Lifting Wavelet Filters

Hiroki Arimura, Teruya Minamoto, Toshihiko Iyemori, 1999, Discovery Science.

Text data mining: discovery of important keywords in the cyberspace

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2000, Proceedings 2000 Kyoto International Conference on Digital Libraries: Research and Practice.

Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories

Hiroki Arimura, Takeaki Uno, Xiaoliang Geng, 2013, KDIR/KMIS.

Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations

Hiroki Arimura, Ryo Yoshinaka, Shin-ichi Minato, 2011, Stringology.

Fully-online Construction of Suffix Trees for Multiple Texts

Hiroki Arimura, Shunsuke Inenaga, Takuya Takagi, 2016, CPM.

Mining Semi-structured Data by Path Expressions

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2001, Discovery Science.

Mining Frequent k-Partite Episodes from Event Sequences

Hiroki Arimura, Kouichi Hirata, Takashi Katoh, 2009, JSAI-isAI Workshops.

An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases

Hiroki Arimura, Takeaki Uno, Tatsuya Asai, 2004, Discovery Science.

An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences

Hiroki Arimura, Kouichi Hirata, Takashi Katoh, 2010 .

Learning Unions of Tree Patterns Using Queries

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka, 1995, Theor. Comput. Sci..

DenseZDD: A Compact and Fast Index for Families of Sets

Hiroki Arimura, Kunihiko Sadakane, Koji Tsuda, 2014, SEA.

Completeness of Depth-bounded Resolution for Weakly Reducing Programs

Hiroki Arimura, 1991, Software Science and Engineering.

Linear-Time Longest-Common-Prex Computation in Sux Arrays and Its Applications

Hiroki Arimura, Toru Kasai, Setsuo Arikawa, 2001 .

Knowledge Discovery from Semistructed Texts

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2001 .

Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers

Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, 1999, Discovery Science.

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2018, IWOCA.

On the Model Shrinkage Effect of Gamma Process Edge Partition Models

Hiroki Arimura, Takuya Kida, Issei Sato, 2017, NIPS.

An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases

Hiroki Arimura, Setsuo Arikawa, Shinichi Shimozono, 1998, Discovery Science.

Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams

Hiroki Arimura, Koji Tsuda, Shin-ichi Minato, 2013, Stringology.

Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems

Hiroki Arimura, Takeaki Uno, Hiroki Arimura, 2009, SDM.

LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation

Hiroki Arimura, Takeaki Uno, Shin-ichi Minato, 2008, PAKDD.

Time and Space Efficient Discovery of Maximal Geometric Graphs

Hiroki Arimura, Takeaki Uno, Shinichi Shimozono, 2007, Discovery Science.

Efficient Learning of Semi-structured Data from Queries

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2001, ALT.

An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting

Hiroki Arimura, Tatsuya Asai, Seishi Okamoto, 2008, PAKDD Workshops.

Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration

Hiroki Arimura, Takeaki Uno, Hiroki Arimura, 2008, PAKDD.

The Complexity of Induced Tree Reconfiguration Problems

Hiroki Arimura, Kunihiro Wasa, Katsuhisa Yamanaka, 2016, LATA.

Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees

Hiroki Arimura, Mayumbo Nyirenda, Kimihito Ito, 2016, 2016 5th International Conference on Multimedia Computing and Systems (ICMCS).

XQUBE : A Visual Language for XQuery Construction from Interaction and Examples

Hiroki Arimura, Junpei Tsutsui, 2008 .

Discovery of Regularized Areas with Maximal Confidence from Location Data

Hiroki Arimura, Takuya Kida, Hiroya Inakoshi, 2019 .

A Catalog for Prediction-Preserving Reducibility with Membership Queries on Formal Languages (New Developments of Theory of Computation and Algorithms)

Hiroshi Sakamoto, Hiroki Arimura, Kouichi Hirata, 2001 .

Semi-structured Data Mining Based on Frequent and Optimal Pattern Discovery

Hiroki Arimura, Setsuo Arikawa, Kenji Abe, 2002 .

Substring Selectivity Estimation for Massive Text

Hiroki Arimura, Takuya Kida, Yusaku Kaneta, 2008 .

Efficient serial episode mining with minimal occurrences

Hiroki Arimura, Takeaki Uno, Takuya Kida, 2009, ICUIMC '09.

DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization

Hiroki Arimura, Takuya Takagi, Ken Kobayashi, 2020, IJCAI.

The Complexity of Induced Tree Reconfiguration Problems

Hiroki Arimura, Kunihiro Wasa, Katsuhisa Yamanaka, 2019 .

A Mixed-Integer Linear Programming Approach to Realistic Counterfactual Explanations

Hiroki Arimura, Ken Kobayashi, Kentaro Kanamori, 2020 .

Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream

Hiroki Arimura, Takuya Kida, Tomoya Saito, 2008, PAKDD Workshops.

Learning From Entailment: An Application to Propositional Horn Sentences

Hiroshi Sakamoto, Hiroki Arimura, Kouichi Hirata, 1993, ICML.

Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka, 1994, AII/ALT.

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees

Hiroki Arimura, Takeaki Uno, Hiroki Arimura, 2005, ILP.

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence

Hiroki Arimura, Takeaki Uno, T. Uno, 2005, ISAAC.

Learning Term Rewriting Systems from Entailment

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2000, ILP Work-in-progress reports.

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph pdf

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2014, ISAAC.

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets

Hiroki Arimura, Takeaki Uno, Masashi Kiyomi, 2004, FIMI.

D-1-6 Efficient Spam Detection by Compression-based Measure Using Dynamic Pruned Suffix Trees

Hiroki Arimura, Daisuke Ikeda, Takashi Uemura, 2009 .

Hardness Results on Local Multiple Alignment of Biological Sequences

Hiroki Arimura, Tatsuya Akutsu, Shinichi Shimozono, 2007 .

Construction of Substring Indices Using Sequence BDDs

Hiroki Arimura, Shin-ichi Minato, Shuhei Denzumi, 2011 .

Efficient Discovery of Proximity Patterns with Suffix Arrays

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa, 2001, CPM.

Polynomial Time Inference of Unions of Two Tree Pattern Languages

Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, 1992 .

A Generalization of the Least General Generalization

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka, 1994, Machine Intelligence 13.

Discovering Unordered and Ordered Phrase Association Patterns for Text Mining

Hiroki Arimura, Setsuo Arikawa, Ryoichi Fujino, 2000, PAKDD.

On the Complexity of Languages Definable by Hereditary Elementary Formal Systems

Hiroki Arimura, Daisuke Ikeda, 1997, Developments in Language Theory.

Pattern Mining from Trajectory GPS Data

Hiroki Arimura, Takeaki Uno, Xiaoliang Geng, 2012, 2012 IIAI International Conference on Advanced Applied Informatics.

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph

Hiroki Arimura, Kouichi Hirata, Takeaki Uno, 2013, Discovery Science.

Learning subsequence languages

Hiroki Arimura, Ayumi Shinohara, Satoshi Matsumoto, 1998 .

Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification pdf

Hirofumi Suzuki, Hiroki Arimura, Kotaro Ohori, 2020, ArXiv.

Finding Unexpected Regression Association Rules from Numeric Database

Hiroshi Sakamoto, Hiroki Arimura, Hitoshi Inoue, 2000 .

Efficient Text Mining with Optimized Pattern Discovery

Hiroki Arimura, Hiroki Arimura, 2002, CPM.

The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise

Hiroki Arimura, Takuya Kida, Iku Ohama, 2016, IEICE Trans. Inf. Syst..

Mining Frequent Bipartite Episode from Event Sequences

Hiroki Arimura, Kouichi Hirata, Takashi Katoh, 2009, Discovery Science.

Fully-online construction of suffix trees and DAWGs for multiple texts pdf

Hiroki Arimura, Shunsuke Inenaga, Takuya Takagi, 2015, ArXiv.

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

Hiroki Arimura, Takeaki Uno, Hiroki Arimura, 2007, J. Comb. Optim..

Efficient enumeration of dominating sets for sparse graphs

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2021, Discret. Appl. Math..

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2021, Theor. Comput. Sci..

Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization

Hiroki Arimura, Takuya Takagi, Yuichi Ike, 2021, AAAI.

Effcient Algorithms for Mining Maximal Flexible Patterns in Texts and Sequences

Hiroki Arimura, Takeaki Uno, 2006 .

Efficient Algorithms on Sequence Binary Decision Diagrams for Manipulating Sets of Strings by

Hiroki Arimura, Ryo Yoshinaka, Shin-ichi Minato, 2011 .

Time and Space Efficient Discovery of Maximal Geometric Subgraphs May 7 , 2007

Hiroki Arimura, Takeaki Uno, Shinichi Shimozono, 2007 .

Finding All Maximal Duration Flock Patterns in High-dimensional Trajectories

Hiroki Arimura, Takeaki Uno, Takuya Takagi, 2014 .

TCS Technical Report ZBDD-growth: An Eﬃcient Method for Frequent Pattern Mining and Knowledge Indexing

Hiroki Arimura, S. Minato, H. Arimura, 2006 .

An Efficient Matching Algorithm for Acyclic Regular Expressions with Bounded Depth by

Hiroki Arimura, Shin-ichi Minato, Yusaku Kaneta, 2010 .

An E cient Algorithm for Text Data Mining with Optimal String Patterns

Hiroki Arimura, Setsuo Arikawa, Atsushi Wataki, 1998 .

Online Algorithms for Mining Semi-structured Data

Hiroki Arimura, Setsuo Arikawa, Shinji Kawasoe, 2022 .

Efficient Tree Mining Using Reverse Search

Hiroki Arimura, Takeaki Uno, Ken Satoh, 2003 .