Hiroki Arimura

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 45

Top Venues

CoRR

IWOCA

IEICE Trans. Inf. Syst.

CPM

Publications

Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA (2024)
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR (2024)
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM (2024)
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR (2024)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR (2023)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE (2023)
Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi
Minimum Consistent Subset for Trees Revisited. CoRR (2023)
Kota Mata, Kentaro Kanamori, Hiroki Arimura
Computing the Collection of Good Models for Rule Lists. CoRR (2022)
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
Cartesian Tree Subsequence Matching. CoRR (2022)
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
Cartesian Tree Subsequence Matching. CPM (2022)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. Theor. Comput. Sci. 874 (2021)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. 303 (2021)
Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. AAAI (2021)
Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura
DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. IJCAI (2020)
Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica 82 (5) (2020)
Hiroaki Iwashita, Takuya Takagi, Hirofumi Suzuki, Keisuke Goto, Kotaro Ohori, Hiroki Arimura
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification. CoRR (2020)
Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. CoRR (2020)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR (2019)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. CoRR (2019)
Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura
Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
The Complexity of Induced Tree Reconfiguration Problems. IEICE Trans. Inf. Syst. (3) (2019)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA (2019)
Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
Fast Identification of Heavy Hitters by Cached and Packed Group Testing. SPIRE (2019)
Kentaro Kanamori, Satoshi Hara, Masakazu Ishihata, Hiroki Arimura
Enumeration of Distinct Support Vectors for Interactive Decision Making. CoRR (2019)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR (2018)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA (2018)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms 11 (8) (2018)
Iku Ohama, Takuya Kida, Hiroki Arimura
Discovering Co-Cluster Structure from Relationships between Biased Objects. IEICE Trans. Inf. Syst. (12) (2018)
Iku Ohama, Takuya Kida, Hiroki Arimura
Discovering Relevance-Dependent Bicluster Structure from Relational Data. IJCAI (2017)
Iku Ohama, Issei Sato, Takuya Kida, Hiroki Arimura
On the Model Shrinkage Effect of Gamma Process Edge Partition Models. NIPS (2017)
Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura
Linear-size CDAWG: new repetition-aware indexing and grammar compression. CoRR (2017)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR (2017)
Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2017)
Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. SPIRE (2017)
Junpei Komiyama, Masakazu Ishihata, Hiroki Arimura, Takashi Nishibayashi, Shin-ichi Minato
Statistical Emerging Pattern Mining with Multiple Testing Correction. KDD (2017)
Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA (2016)
Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura
The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise. IEICE Trans. Inf. Syst. (4) (2016)
Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations. Discret. Appl. Math. 212 (2016)
Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR (2016)
Mayumbo Nyirenda, Hiroki Arimura, Kimihito Ito
Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees. ICMCS (2016)
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
The Complexity of Induced Tree Reconfiguration Problems. LATA (2016)
Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura
Fully-online Construction of Suffix Trees for Multiple Texts. CPM (2016)
Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura
Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. SISAP (2015)
Iku Ohama, Takuya Kida, Hiroki Arimura
Multi-Layered Framework for Modeling Relationships between Biased Objects. SDM (2015)
Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura
Fully-online construction of suffix trees and DAWGs for multiple texts. CoRR (2015)
Ryutaro Kurai, Norihito Yasuda, Hiroki Arimura, Shinobu Nagayama, Shin-ichi Minato
Fast Regular Expression Matching Based On Dual Glushkov NFA. Stringology (2014)
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. ISAAC (2014)
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. CoRR (2014)
Hirohito Sasakawa, Hiroki Harada, David duVerle, Hiroki Arimura, Koji Tsuda, Jun Sakuma
Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection. WPES (2014)
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
Nodes in a Tree. IEICE Trans. Inf. Syst. (3) (2014)
Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
DenseZDD: A Compact and Fast Index for Families of Sets. SEA (2014)
Xiaoliang Geng, Takuya Takagi, Hiroki Arimura, Takeaki Uno
Enumeration of complete set of flock patterns in trajectories. IWGS (2014)
Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura
An Extension of the Infinite Relational Model Incorporating Interaction between Objects. PAKDD (2) (2013)
Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. SISAP (2013)
Xiaoliang Geng, Takeaki Uno, Hiroki Arimura
Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. KDIR/KMIS (2013)
Shuhei Denzumi, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato
Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams . Stringology (2013)
Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura
Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. Discovery Science (2013)
Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Inf. Process. Lett. 112 (16) (2012)
Yusaku Kaneta, Hiroki Arimura, Rajeev Raman
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. J. Discrete Algorithms 14 (2012)
Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga
A Dynamically Reconfigurable FPGA-Based Pattern Matching Hardware for Subclasses of Regular Expressions. IEICE Trans. Inf. Syst. (7) (2012)
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. COCOON (2012)
Hirohito Sasakawa, Hiroki Arimura
Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data. IIAI-AAI (2012)
Xiaoliang Geng, Hiroki Arimura, Takeaki Uno
Pattern Mining from Trajectory GPS Data. IIAI-AAI (2012)
Takashi Uemura, Daisuke Ikeda, Takuya Kida, Hiroki Arimura
Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method. Inf. Media Technol. 6 (1) (2011)
Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato
Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations. Stringology (2011)
Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato
Implementation of sequence BDDs in Erlang. Erlang Workshop (2011)
Takashi Uemura, Hiroki Arimura
Sparse and Truncated Suffix Trees on Variable-Length Codes. CPM (2011)
Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga
Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching. FPT (2010)
Hiroki Arimura
Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data. ISCIS (2010)
Yusaku Kaneta, Hiroki Arimura
Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. IWOCA (2010)
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
Fast Bit-Parallel Matching for Network and Regular Expressions. SPIRE (2010)
Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura
Efficient serial episode mining with minimal occurrences. ICUIMC (2009)
Takashi Katoh, Hiroki Arimura, Kouichi Hirata
-Partite Episodes from Event Sequences. JSAI-isAI Workshops (2009)
Takashi Katoh, Hiroki Arimura, Kouichi Hirata
A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. PAKDD (2009)
Hiroki Arimura, Takeaki Uno
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. SDM (2009)
Takashi Katoh, Hiroki Arimura, Kouichi Hirata
Mining Frequent Bipartite Episode from Event Sequences. Discovery Science (2009)
Takeaki Uno, Hiroki Arimura
Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD (2008)
Takuya Kida, Tomoya Saito, Hiroki Arimura
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. PAKDD Workshops (2008)
Tatsuya Asai, Seishi Okamoto, Hiroki Arimura
An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting. PAKDD Workshops (2008)
Takashi Uemura, Daisuke Ikeda, Hiroki Arimura
Unsupervised Spam Detection by Document Complexity Estimation. Discovery Science (2008)
Hiroki Arimura
Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. PAKDD (2008)
Shin-ichi Minato, Takeaki Uno, Hiroki Arimura
LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. PAKDD (2008)
Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono
Hardness Results on Local Multiple Alignment of Biological Sequences. Inf. Media Technol. 2 (2) (2007)
Shin-ichi Minato, Hiroki Arimura
Frequent Closed Item Set Mining Based on Zero-suppressed BDDs. Inf. Media Technol. 2 (1) (2007)
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science (2007)
Hiroki Arimura, Takeaki Uno
Mining Maximal Flexible Patterns in a Sequence. JSAI (2007)
Takeaki Uno, Hiroki Arimura
An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science (2007)
Hiroki Arimura, Takeaki Uno
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. J. Comb. Optim. 13 (3) (2007)
Shin-ichi Minato, Hiroki Arimura
Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. KDID (2006)
Jörg Rothe, Hiroki Arimura
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. 12 (6) (2006)
Shin-ichi Minato, Hiroki Arimura
Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. WIRI (2005)
Hiroki Arimura, Takeaki Uno
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC (2005)
Hiroki Arimura, Takeaki Uno
An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP (2005)
Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine
Key semantics extraction by dependency tree mining. KDD (2005)
Hiroki Arimura, Sanjay Jain
Preface. Theor. Comput. Sci. 348 (1) (2005)
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science (2004)
Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa
Efficient Substructure Discovery from Large Semi-Structured Data. IEICE Trans. Inf. Syst. (12) (2004)

Hiroki Arimura.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hiroki Arimura