Polynomial-time inference of unions of tree pattern languages. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki (ALT, 1991)

A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki (Nonmonotonic and Inductive Logic, 1991)

Completeness of Depth-bounded Resolution for Weakly Reducing Programs. - Hiroki Arimura (Software Science and Engineering, 1991)

Efficient Inductive Inference of Primitive Prologs from Positive Data. - Hiroki Ishizaka; Hiroki Arimura; Takeshi Shinohara (ALT, 1992)

Polynomial Time Inference of a Subclass of Context-Free Transformations. - Hiroki Arimura; Hiroki Ishizaka; Takeshi Shinohara (COLT, 1992)

A Generalization of the Least General Generalization. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki; Hiroki Ishizaka (Machine Intelligence 13, 1992)

Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki (STACS, 1994)

Learning Acyclic First-Order Horn Sentences from Entailment. - Hiroki Arimura (ALT, 1997)

On the Complexity of Languages Definable by Hereditary Elementary Formal Systems. - Daisuke Ikeda; Hiroki Arimura (Developments in Language Theory, 1997)

Learning Unions of Tree Patterns Using Queries. - Hiroki Arimura; Hiroki Ishizaka; Takeshi Shinohara (Theor. Comput. Sci., 1997)

A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. - Hiroki Arimura; Atsushi Wataki; Ryoichi Fujino; Setsuo Arikawa (ALT, 1998)

An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. - Hiroki Arimura; Atsushi Wataki; Ryoichi Fujino; Shinichi Shimozono; Setsuo Arikawa (Discovery Science, 1998)

Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. - Hiroki Arimura; Shinichi Shimozono (ISAAC, 1998)

Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. - Hiroki Ishizaka; Hiroki Arimura; Takeshi Shinohara (Ann. Math. Artif. Intell., 1998)

Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. - Toru Takae; Minoru Chikamune; Hiroki Arimura; Ayumi Shinohara; Hitoshi Inoue; Shun-ichi Takeya; Keiko Uezono; Terukazu Kawasaki (Discovery Science, 1999)

Automatic Detection of Geomagnetic Sudden Commencement Using Lifting Wavelet Filters. - Shigeru Takano; Teruya Minamoto; Hiroki Arimura; Koichi Niijima; Toshihiko Iyemori; Tohru Araki (Discovery Science, 1999)

Identification of Tree Translation Rules from Examples. - Hiroshi Sakamoto; Hiroki Arimura; Setsuo Arikawa (ICGI, 2000)

Learning Term Rewriting Systems from Entailment . - Hiroki Arimura; Hiroshi Sakamoto; Setsuo Arikawa (ILP Work-in-progress reports, 2000)

Text Data Mining: Discovery of Important Keywords in the Cyberspace. - Hiroki Arimura; Jun-ichiro Abe; Hiroshi Sakamoto; Setsuo Arikawa; Ryoichi Fujino; Shinichi Shimozono (Kyoto International Conference on Digital Libraries, 2000)

Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. - Ryoichi Fujino; Hiroki Arimura; Setsuo Arikawa (PAKDD, 2000)

On approximation algorithms for local multiple alignment. - Tatsuya Akutsu; Hiroki Arimura; Shinichi Shimozono (RECOMB, 2000)

Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. - Shinichi Shimozono; Hiroki Arimura; Setsuo Arikawa (New Gener. Comput., 2000)

Inductive inference of unbounded unions of pattern languages from positive data. - Takeshi Shinohara; Hiroki Arimura (Theor. Comput. Sci., 2000)

Efficient Learning of Semi-structured Data from Queries. - Hiroki Arimura; Hiroshi Sakamoto; Setsuo Arikawa (ALT, 2001)

Efficient Discovery of Proximity Patterns with Suffix Arrays. - Hiroki Arimura; Hiroki Asaka; Hiroshi Sakamoto; Setsuo Arikawa (CPM, 2001)

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. - Toru Kasai; Gunho Lee; Hiroki Arimura; Setsuo Arikawa; Kunsoo Park (CPM, 2001)

Mining Semi-structured Data by Path Expressions. - Katsuaki Taniguchi; Hiroshi Sakamoto; Hiroki Arimura; Shinichi Shimozono; Setsuo Arikawa (Discovery Science, 2001)

Extracting Partial Structures from HTML Documents. - Hiroshi Sakamoto; Yoshitsugu Murakami; Hiroki Arimura; Setsuo Arikawa (FLAIRS, 2001)

Modelling Semi-structured Documents with Hedges for Deduction and Induction. - Akihiro Yamamoto; Kimihito Ito; Akira Ishino; Hiroki Arimura (ILP, 2001)

Efficient Text Mining with Optimized Pattern Discovery. - Hiroki Arimura (CPM, 2002)

Efficient Data Mining from Large Text Databases. - Hiroki Arimura; Hiroshi Sakamoto; Setsuo Arikawa (Progress in Discovery Science, 2002)

Knowledge Discovery from Semistructured Texts. - Hiroshi Sakamoto; Hiroki Arimura; Setsuo Arikawa (Progress in Discovery Science, 2002)

Online Algorithms for Mining Semi-structured Data Stream. - Tatsuya Asai; Hiroki Arimura; Kenji Abe; Shinji Kawasoe; Setsuo Arikawa (ICDM, 2002)

Optimized Substructure Discovery for Semi-structured Data. - Kenji Abe; Shinji Kawasoe; Tatsuya Asai; Hiroki Arimura; Setsuo Arikawa (PKDD, 2002)

Discovering Frequent Substructures in Large Unordered Trees. - Tatsuya Asai; Hiroki Arimura; Takeaki Uno; Shin-Ichi Nakano (Discovery Science, 2003)

LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. - Takeaki Uno; Tatsuya Asai; Yuzo Uchida; Hiroki Arimura (FIMI, 2003)

Learning elementary formal systems with queries. - Hiroshi Sakamoto; Kouichi Hirata; Hiroki Arimura (Theor. Comput. Sci., 2003)

An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. - Takeaki Uno; Tatsuya Asai; Yuzo Uchida; Hiroki Arimura (Discovery Science, 2004)

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets - Takeaki Uno; Masashi Kiyomi; Hiroki Arimura (FIMI, 2004)

Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams. - Tatsuya Asai; Kenji Abe; Shinji Kawasoe; Hiroki Arimura; Setsuo Arikawa (JSAI Workshops, 2004)

Efficient Substructure Discovery from Large Semi-Structured Data. - Tatsuya Asai; Kenji Abe; Shinji Kawasoe; Hiroshi Sakamoto; Hiroki Arimura; Setsuo Arikawa (IEICE Trans. Inf. Syst., 2004)

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. - Hiroki Arimura; Takeaki Uno (ILP, 2005)

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. - Hiroki Arimura; Takeaki Uno (ISAAC, 2005)

Key semantics extraction by dependency tree mining. - Satoshi Morinaga; Hiroki Arimura; Takahiro Ikeda; Yosuke Sakao; Susumu Akamine (KDD, 2005)

Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. - Shin-ichi Minato; Hiroki Arimura (WIRI, 2005)

Preface. - Hiroki Arimura; Sanjay Jain 001 (Theor. Comput. Sci., 2005)

Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. - Shin-ichi Minato; Hiroki Arimura (KDID, 2006)

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 (J. Univers. Comput. Sci., 2006)

Time and Space Efficient Discovery of Maximal Geometric Graphs. - Hiroki Arimura; Takeaki Uno; Shinichi Shimozono (Discovery Science, 2007)

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. - Takeaki Uno; Hiroki Arimura (Discovery Science, 2007)

Mining Maximal Flexible Patterns in a Sequence. - Hiroki Arimura; Takeaki Uno (JSAI, 2007)

Hardness Results on Local Multiple Alignment of Biological Sequences. - Tatsuya Akutsu; Hiroki Arimura; Shinichi Shimozono (Inf. Media Technol., 2007)

Frequent Closed Item Set Mining Based on Zero-suppressed BDDs. - Shin-ichi Minato; Hiroki Arimura (Inf. Media Technol., 2007)

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. - Hiroki Arimura; Takeaki Uno (J. Comb. Optim., 2007)

Unsupervised Spam Detection by Document Complexity Estimation. - Takashi Uemura; Daisuke Ikeda; Hiroki Arimura (Discovery Science, 2008)

Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. - Hiroki Arimura (PAKDD, 2008)

An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting. - Tatsuya Asai; Seishi Okamoto; Hiroki Arimura (PAKDD Workshops, 2008)

Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. - Takuya Kida; Tomoya Saito; Hiroki Arimura (PAKDD Workshops, 2008)

LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. - Shin-ichi Minato; Takeaki Uno; Hiroki Arimura (PAKDD, 2008)

Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. - Takeaki Uno; Hiroki Arimura (PAKDD, 2008)

Mining Frequent Bipartite Episode from Event Sequences. - Takashi Katoh; Hiroki Arimura; Kouichi Hirata (Discovery Science, 2009)

Efficient serial episode mining with minimal occurrences. - Hideyuki Ohtani; Takuya Kida; Takeaki Uno; Hiroki Arimura (ICUIMC, 2009)

Mining Frequent k-Partite Episodes from Event Sequences. - Takashi Katoh; Hiroki Arimura; Kouichi Hirata (JSAI-isAI Workshops, 2009)

A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. - Takashi Katoh; Hiroki Arimura; Kouichi Hirata (PAKDD, 2009)

Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. - Hiroki Arimura; Takeaki Uno (SDM, 2009)

Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching. - Yusaku Kaneta; Shingo Yoshizawa; Shin-ichi Minato; Hiroki Arimura; Yoshikazu Miyanaga (FPT, 2010)

Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data. - Hiroki Arimura (ISCIS, 2010)

Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. - Yusaku Kaneta; Hiroki Arimura (IWOCA, 2010)

Fast Bit-Parallel Matching for Network and Regular Expressions. - Yusaku Kaneta; Shin-ichi Minato; Hiroki Arimura (SPIRE, 2010)

An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. - Takashi Katoh; Hiroki Arimura; Kouichi Hirata (Inf. Media Technol., 2010)

Sparse and Truncated Suffix Trees on Variable-Length Codes. - Takashi Uemura; Hiroki Arimura (CPM, 2011)

Implementation of sequence BDDs in Erlang. - Shuhei Denzumi; Hiroki Arimura; Shin-ichi Minato (Erlang Workshop, 2011)

Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations. - Shuhei Denzumi; Ryo Yoshinaka; Hiroki Arimura; Shin-ichi Minato (Stringology, 2011)

Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method. - Takashi Uemura; Daisuke Ikeda; Takuya Kida; Hiroki Arimura (Inf. Media Technol., 2011)

Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. - Kunihiro Wasa; Yusaku Kaneta; Takeaki Uno; Hiroki Arimura (COCOON, 2012)

Pattern Mining from Trajectory GPS Data. - Xiaoliang Geng; Hiroki Arimura; Takeaki Uno (IIAI-AAI, 2012)

Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data. - Hirohito Sasakawa; Hiroki Arimura (IIAI-AAI, 2012)

A Dynamically Reconfigurable FPGA-Based Pattern Matching Hardware for Subclasses of Regular Expressions. - Yusaku Kaneta; Shingo Yoshizawa; Shin-ichi Minato; Hiroki Arimura; Yoshikazu Miyanaga (IEICE Trans. Inf. Syst., 2012)

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. - Ryo Yoshinaka; Jun Kawahara; Shuhei Denzumi; Hiroki Arimura; Shin-ichi Minato (Inf. Process. Lett., 2012)

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. - Yusaku Kaneta; Hiroki Arimura; Rajeev Raman (J. Discrete Algorithms, 2012)

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. - Kunihiro Wasa; Takeaki Uno; Kouichi Hirata; Hiroki Arimura (Discovery Science, 2013)

Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. - Xiaoliang Geng; Takeaki Uno; Hiroki Arimura (KDIR/KMIS, 2013)

An Extension of the Infinite Relational Model Incorporating Interaction between Objects. - Iku Ohama; Hiromi Iida; Takuya Kida; Hiroki Arimura (PAKDD (2), 2013)

Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. - Kunihiro Wasa; Kouichi Hirata; Takeaki Uno; Hiroki Arimura (SISAP, 2013)

Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams . - Shuhei Denzumi; Koji Tsuda; Hiroki Arimura; Shin-ichi Minato (Stringology, 2013)

Enumeration of complete set of flock patterns in trajectories. - Xiaoliang Geng; Takuya Takagi; Hiroki Arimura; Takeaki Uno (IWGS, 2014)

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. - Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (ISAAC, 2014)

Fast Regular Expression Matching Based On Dual Glushkov NFA. - Ryutaro Kurai; Norihito Yasuda; Hiroki Arimura; Shinobu Nagayama; Shin-ichi Minato (Stringology, 2014)

Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection. - Hirohito Sasakawa; Hiroki Harada; David duVerle; Hiroki Arimura; Koji Tsuda; Jun Sakuma (WPES, 2014)

Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree. - Kunihiro Wasa; Yusaku Kaneta; Takeaki Uno; Hiroki Arimura (IEICE Trans. Inf. Syst., 2014)

Multi-Layered Framework for Modeling Relationships between Biased Objects. - Iku Ohama; Takuya Kida; Hiroki Arimura (SDM, 2015)

Fully-online construction of suffix trees and DAWGs for multiple texts. - Takuya Takagi; Shunsuke Inenaga; Hiroki Arimura (CoRR, 2015)

Fully-online Construction of Suffix Trees for Multiple Texts. - Takuya Takagi; Shunsuke Inenaga; Hiroki Arimura (CPM, 2016)

Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees. - Mayumbo Nyirenda; Hiroki Arimura; Kimihito Ito (ICMCS, 2016)

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations. - Shuhei Denzumi; Ryo Yoshinaka; Hiroki Arimura; Shin-ichi Minato (Discret. Appl. Math., 2016)

The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise. - Iku Ohama; Hiromi Iida; Takuya Kida; Hiroki Arimura (IEICE Trans. Inf. Syst., 2016)

Discovering Relevance-Dependent Bicluster Structure from Relational Data. - Iku Ohama; Takuya Kida; Hiroki Arimura (IJCAI, 2017)

Statistical Emerging Pattern Mining with Multiple Testing Correction. - Junpei Komiyama; Masakazu Ishihata; Hiroki Arimura; Takashi Nishibayashi; Shin-ichi Minato (KDD, 2017)

On the Model Shrinkage Effect of Gamma Process Edge Partition Models. - Iku Ohama; Issei Sato; Takuya Kida; Hiroki Arimura (NIPS, 2017)

Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. - Takuya Takagi; Keisuke Goto 001; Yuta Fujishige; Shunsuke Inenaga; Hiroki Arimura (SPIRE, 2017)

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. - Takuya Takagi; Shunsuke Inenaga; Kunihiko Sadakane; Hiroki Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. - Kazuhiro Kurita; Kunihiro Wasa; Alessio Conte; Takeaki Uno; Hiroki Arimura (IWOCA, 2018)

DenseZDD: A Compact and Fast Index for Families of Sets. - Shuhei Denzumi; Jun Kawahara; Koji Tsuda; Hiroki Arimura; Shin-ichi Minato; Kunihiko Sadakane (Algorithms, 2018)

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Discovering Co-Cluster Structure from Relationships between Biased Objects. - Iku Ohama; Takuya Kida; Hiroki Arimura (IEICE Trans. Inf. Syst., 2018)

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (IWOCA, 2019)

Fast Identification of Heavy Hitters by Cached and Packed Group Testing. - Yusaku Kaneta; Takeaki Uno; Hiroki Arimura (SPIRE, 2019)

Enumeration of Distinct Support Vectors for Interactive Decision Making. - Kentaro Kanamori; Satoshi Hara 001; Masakazu Ishihata; Hiroki Arimura (CoRR, 2019)

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. - Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (CoRR, 2019)

Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. - Yoichi Sasaki 002; Tetsuo Shibuya; Kimihito Ito; Hiroki Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

The Complexity of Induced Tree Reconfiguration Problems. - Kunihiro Wasa; Katsuhisa Yamanaka; Hiroki Arimura (IEICE Trans. Inf. Syst., 2019)

DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. - Kentaro Kanamori; Takuya Takagi; Ken Kobayashi; Hiroki Arimura (IJCAI, 2020)

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. - Takuya Takagi; Shunsuke Inenaga; Hiroki Arimura; Dany Breslauer; Diptarama Hendrian (Algorithmica, 2020)

Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification. - Hiroaki Iwashita; Takuya Takagi; Hirofumi Suzuki; Keisuke Goto 001; Kotaro Ohori; Hiroki Arimura (CoRR, 2020)

Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. - Kentaro Kanamori; Takuya Takagi; Ken Kobayashi; Yuichi Ike; Kento Uemura; Hiroki Arimura (AAAI, 2021)

Efficient enumeration of dominating sets for sparse graphs. - Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (Discret. Appl. Math., 2021)

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (Theor. Comput. Sci., 2021)

Cartesian Tree Subsequence Matching. - Tsubasa Oizumi; Takeshi Kai; Takuya Mieno; Shunsuke Inenaga; Hiroki Arimura (CPM, 2022)

Computing the Collection of Good Models for Rule Lists. - Kota Mata; Kentaro Kanamori; Hiroki Arimura (CoRR, 2022)

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. - Hiroki Arimura; Shunsuke Inenaga; Yasuaki Kobayashi; Yuto Nakashima 001; Mizuki Sue (SPIRE, 2023)

Minimum Consistent Subset for Trees Revisited. - Hiroki Arimura; Tatsuya Gima; Yasuaki Kobayashi; Hiroomi Nochide; Yota Otachi (CoRR, 2023)

Finding Diverse Strings and Longest Common Subsequences in a Graph. - Yuto Shida; Giulia Punzi; Yasuaki Kobayashi; Takeaki Uno; Hiroki Arimura (CPM, 2024)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. - Shunsuke Inenaga; Takuya Mieno; Hiroki Arimura; Mitsuru Funakoshi; Yuta Fujishige (IWOCA, 2024)