Hiroki Arimura

Orcid: 0000-0002-2701-0271

According to our database1, Hiroki Arimura authored at least 123 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Finding Diverse Strings and Longest Common Subsequences in a Graph.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023
Minimum Consistent Subset for Trees Revisited.
CoRR, 2023

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph.
Proceedings of the String Processing and Information Retrieval, 2023

2022
Computing the Collection of Good Models for Rule Lists.
CoRR, 2022

Cartesian Tree Subsequence Matching.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number.
Theor. Comput. Sci., 2021

Efficient enumeration of dominating sets for sparse graphs.
Discret. Appl. Math., 2021

Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification.
CoRR, 2020

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts.
Algorithmica, 2020

DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
The Complexity of Induced Tree Reconfiguration Problems.
IEICE Trans. Inf. Syst., 2019

Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices.
CoRR, 2019

Enumeration of Distinct Support Vectors for Interactive Decision Making.
CoRR, 2019

Fast Identification of Heavy Hitters by Cached and Packed Group Testing.
Proceedings of the String Processing and Information Retrieval, 2019

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018
Discovering Co-Cluster Structure from Relationships between Biased Objects.
IEICE Trans. Inf. Syst., 2018

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

DenseZDD: A Compact and Fast Index for Families of Sets.
Algorithms, 2018

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression.
Proceedings of the String Processing and Information Retrieval, 2017

On the Model Shrinkage Effect of Gamma Process Edge Partition Models.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Statistical Emerging Pattern Mining with Multiple Testing Correction.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Discovering Relevance-Dependent Bicluster Structure from Relational Data.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise.
IEICE Trans. Inf. Syst., 2016

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations.
Discret. Appl. Math., 2016

Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees.
Proceedings of the 5th International Conference on Multimedia Computing and Systems, 2016

Fully-online Construction of Suffix Trees for Multiple Texts.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Fully-online construction of suffix trees and DAWGs for multiple texts.
CoRR, 2015

Multi-Layered Framework for Modeling Relationships between Biased Objects.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

2014
Constant Time Enumeration of Subtrees with Exactly <i>k</i> Nodes in a Tree.
IEICE Trans. Inf. Syst., 2014

Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection.
Proceedings of the 13th Workshop on Privacy in the Electronic Society, 2014

Fast Regular Expression Matching Based On Dual Glushkov NFA.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Enumeration of complete set of flock patterns in trajectories.
Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming, 2014

2013
Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams .
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees.
Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

An Extension of the Infinite Relational Model Incorporating Interaction between Objects.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2013

Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories.
Proceedings of the KDIR/KMIS 2013 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval and the International Conference on Knowledge Management and Information Sharing, Vilamoura, Algarve, Portugal, 19, 2013

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph.
Proceedings of the Discovery Science - 16th International Conference, 2013

2012
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism.
J. Discrete Algorithms, 2012

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations.
Inf. Process. Lett., 2012

A Dynamically Reconfigurable FPGA-Based Pattern Matching Hardware for Subclasses of Regular Expressions.
IEICE Trans. Inf. Syst., 2012

Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data.
Proceedings of the IIAI International Conference on Advanced Applied Informatics, 2012

Pattern Mining from Trajectory GPS Data.
Proceedings of the IIAI International Conference on Advanced Applied Informatics, 2012

Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method.
Inf. Media Technol., 2011

Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations.
Proceedings of the Prague Stringology Conference 2011, 2011

Implementation of sequence BDDs in Erlang.
Proceedings of the 10th ACM SIGPLAN workshop on Erlang, Tokyo, Japan, September 23, 2011, 2011

Sparse and Truncated Suffix Trees on Variable-Length Codes.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences.
Inf. Media Technol., 2010

Fast Bit-Parallel Matching for Network and Regular Expressions.
Proceedings of the String Processing and Information Retrieval, 2010

Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data.
Proceedings of the Computer and Information Sciences, 2010

Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching.
Proceedings of the International Conference on Field-Programmable Technology, 2010

2009
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
Proceedings of the SIAM International Conference on Data Mining, 2009

A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2009

Mining Frequent <i>k</i>-Partite Episodes from Event Sequences.
Proceedings of the New Frontiers in Artificial Intelligence, 2009

Efficient serial episode mining with minimal occurrences.
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, 2009

Mining Frequent Bipartite Episode from Event Sequences.
Proceedings of the Discovery Science, 12th International Conference, 2009

2008
Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream.
Proceedings of the New Frontiers in Applied Data Mining, 2008

An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting.
Proceedings of the New Frontiers in Applied Data Mining, 2008

Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

Unsupervised Spam Detection by Document Complexity Estimation.
Proceedings of the Discovery Science, 11th International Conference, 2008

2007
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence.
J. Comb. Optim., 2007

Frequent Closed Item Set Mining Based on Zero-suppressed BDDs.
Inf. Media Technol., 2007

Hardness Results on Local Multiple Alignment of Biological Sequences.
Inf. Media Technol., 2007

Mining Maximal Flexible Patterns in a Sequence.
Proceedings of the New Frontiers in Artificial Intelligence, 2007

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining.
Proceedings of the Discovery Science, 10th International Conference, 2007

Time and Space Efficient Discovery of Maximal Geometric Graphs.
Proceedings of the Discovery Science, 10th International Conference, 2007

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

Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs.
Proceedings of the Knowledge Discovery in Inductive Databases, 5th International Workshop, 2006

2005
Preface.
Theor. Comput. Sci., 2005

Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs.
Proceedings of the 2005 International Workshop on Challenges in Web Information Retrieval and Integration (WIRI 2005), 2005

Key semantics extraction by dependency tree mining.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.
Proceedings of the Inductive Logic Programming, 15th International Conference, 2005

2004
Efficient Substructure Discovery from Large Semi-Structured Data.
IEICE Trans. Inf. Syst., 2004

Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams.
Proceedings of the New Frontiers in Artificial Intelligence - JSAI 2003 and JSAI 2004 Conferences and Workshops, Niigata, Japan, June 23-27, 2003 and Kanazawa, Japan, May 31, 2004

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
Proceedings of the FIMI '04, 2004

An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases.
Proceedings of the Discovery Science, 7th International Conference, 2004

2003
Learning elementary formal systems with queries.
Theor. Comput. Sci., 2003

LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.
Proceedings of the FIMI '03, 2003

Discovering Frequent Substructures in Large Unordered Trees.
Proceedings of the Discovery Science, 6th International Conference, 2003

2002
Optimized Substructure Discovery for Semi-structured Data.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2002

Online Algorithms for Mining Semi-structured Data Stream.
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002

Knowledge Discovery from Semistructured Texts.
Proceedings of the Progress in Discovery Science, 2002

Efficient Data Mining from Large Text Databases.
Proceedings of the Progress in Discovery Science, 2002

Efficient Text Mining with Optimized Pattern Discovery.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Modelling Semi-structured Documents with Hedges for Deduction and Induction.
Proceedings of the Inductive Logic Programming, 11th International Conference, 2001

Extracting Partial Structures from HTML Documents.
Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference, 2001

Mining Semi-structured Data by Path Expressions.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Efficient Discovery of Proximity Patterns with Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Efficient Learning of Semi-structured Data from Queries.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000
Inductive inference of unbounded unions of pattern languages from positive data.
Theor. Comput. Sci., 2000

Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases.
New Gener. Comput., 2000

On approximation algorithms for local multiple alignment.
Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, 2000

Discovering Unordered and Ordered Phrase Association Patterns for Text Mining.
Proceedings of the Knowledge Discovery and Data Mining, 2000

Text Data Mining: Discovery of Important Keywords in the Cyberspace.
Proceedings of the 2000 Kyoto International Conference on Digital Libraries: Research and Practice, 2000

Learning Term Rewriting Systems from Entailment .
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Identification of Tree Translation Rules from Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1999
Automatic Detection of Geomagnetic Sudden Commencement Using Lifting Wavelet Filters.
Proceedings of the Discovery Science, 1999

Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers.
Proceedings of the Discovery Science, 1999

1998
Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries.
Ann. Math. Artif. Intell., 1998

Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases.
Proceedings of the Discovery Science, 1998

A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Learning Unions of Tree Patterns Using Queries.
Theor. Comput. Sci., 1997

On the Complexity of Languages Definable by Hereditary Elementary Formal Systems.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Learning Acyclic First-Order Horn Sentences from Entailment.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1994
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data.
Proceedings of the STACS 94, 1994

1992
A Generalization of the Least General Generalization.
Proceedings of the Machine Intelligence 13, 1992

Polynomial Time Inference of a Subclass of Context-Free Transformations.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Efficient Inductive Inference of Primitive Prologs from Positive Data.
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991
Completeness of Depth-bounded Resolution for Weakly Reducing Programs.
Proceedings of the Software Science and Engineering: Selected Papers from the Kyoto Symposia, 1991

A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

Polynomial-time inference of unions of tree pattern languages.
Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991


  Loading...