default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroki Arimura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c97]Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM 2024: 27:1-27:19- [c96]Shunsuke Inenaga
, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA 2024: 327-340 - [i18]Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR abs/2402.18090 (2024) - [i17]Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR abs/2405.00131 (2024) - 2023
- [c95]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: 28-34 - [i16]Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi:
Minimum Consistent Subset for Trees Revisited. CoRR abs/2305.07259 (2023) - [i15]Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue:
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR abs/2308.02269 (2023) - 2022
- [c94]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CPM 2022: 14:1-14:18 - [i14]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CoRR abs/2202.04349 (2022) - [i13]Kota Mata, Kentaro Kanamori, Hiroki Arimura:
Computing the Collection of Good Models for Rule Lists. CoRR abs/2204.11285 (2022) - 2021
- [j28]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. 303: 283-295 (2021) - [j27]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: 32-41 (2021) - [c93]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura:
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. AAAI 2021: 11564-11574 - 2020
- [j26]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): 1346-1377 (2020) - [c92]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura:
DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. IJCAI 2020: 2855-2862 - [i12]Hiroaki Iwashita, Takuya Takagi, Hirofumi Suzuki, Keisuke Goto, Kotaro Ohori, Hiroki Arimura:
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification. CoRR abs/2004.08015 (2020) - [i11]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura:
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. CoRR abs/2012.11782 (2020)
2010 – 2019
- 2019
- [j25]Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura:
The Complexity of Induced Tree Reconfiguration Problems. IEICE Trans. Inf. Syst. 102-D(3): 464-469 (2019) - [j24]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. 102-A(9): 1159-1170 (2019) - [c91]Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA 2019: 339-351 - [c90]Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Fast Identification of Heavy Hitters by Cached and Packed Group Testing. SPIRE 2019: 241-257 - [i10]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR abs/1903.02161 (2019) - [i9]Kentaro Kanamori, Satoshi Hara, Masakazu Ishihata, Hiroki Arimura:
Enumeration of Distinct Support Vectors for Interactive Decision Making. CoRR abs/1906.01876 (2019) - [i8]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 abs/1906.09680 (2019) - 2018
- [j23]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): 128 (2018) - [j22]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. 101-A(9): 1383-1391 (2018) - [j21]Iku Ohama, Takuya Kida, Hiroki Arimura:
Discovering Co-Cluster Structure from Relationships between Biased Objects. IEICE Trans. Inf. Syst. 101-D(12): 3108-3122 (2018) - [c89]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC 2018: 8:1-8:13 - [c88]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA 2018: 201-213 - [i7]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR abs/1802.07863 (2018) - [i6]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR abs/1806.04307 (2018) - 2017
- [j20]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. 100-A(9): 1785-1793 (2017) - [c87]Iku Ohama, Takuya Kida, Hiroki Arimura:
Discovering Relevance-Dependent Bicluster Structure from Relational Data. IJCAI 2017: 2578-2584 - [c86]Junpei Komiyama, Masakazu Ishihata, Hiroki Arimura, Takashi Nishibayashi, Shin-ichi Minato:
Statistical Emerging Pattern Mining with Multiple Testing Correction. KDD 2017: 897-906 - [c85]Iku Ohama, Issei Sato, Takuya Kida, Hiroki Arimura:
On the Model Shrinkage Effect of Gamma Process Edge Partition Models. NIPS 2017: 397-405 - [c84]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. SPIRE 2017: 304-316 - [i5]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-size CDAWG: new repetition-aware indexing and grammar compression. CoRR abs/1705.09779 (2017) - [i4]Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR abs/1707.02740 (2017) - 2016
- [j19]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: 61-80 (2016) - [j18]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. 99-D(4): 1139-1152 (2016) - [c83]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
Fully-online Construction of Suffix Trees for Multiple Texts. CPM 2016: 22:1-22:13 - [c82]Mayumbo Nyirenda, Hiroki Arimura, Kimihito Ito:
Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees. ICMCS 2016: 189-195 - [c81]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA 2016: 213-225 - [c80]Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura:
The Complexity of Induced Tree Reconfiguration Problems. LATA 2016: 330-342 - [i3]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR abs/1602.00422 (2016) - 2015
- [c79]Iku Ohama, Takuya Kida, Hiroki Arimura:
Multi-Layered Framework for Modeling Relationships between Biased Objects. SDM 2015: 819-827 - [c78]Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura:
Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. SISAP 2015: 191-203 - [i2]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
Fully-online construction of suffix trees and DAWGs for multiple texts. CoRR abs/1507.07622 (2015) - 2014
- [j17]Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree. IEICE Trans. Inf. Syst. 97-D(3): 421-430 (2014) - [c77]Xiaoliang Geng, Takuya Takagi, Hiroki Arimura, Takeaki Uno:
Enumeration of complete set of flock patterns in trajectories. IWGS 2014: 53-61 - [c76]Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. ISAAC 2014: 94-102 - [c75]Ryutaro Kurai, Norihito Yasuda, Hiroki Arimura, Shinobu Nagayama, Shin-ichi Minato:
Fast Regular Expression Matching Based On Dual Glushkov NFA. Stringology 2014: 3-16 - [c74]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: 187-198 - [c73]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: 21-30 - [i1]Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. CoRR abs/1407.6140 (2014) - 2013
- [c72]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: 308-323 - [c71]Xiaoliang Geng, Takeaki Uno, Hiroki Arimura:
Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. KDIR/KMIS 2013: 143-151 - [c70]Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura:
An Extension of the Infinite Relational Model Incorporating Interaction between Objects. PAKDD (2) 2013: 147-159 - [c69]Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura:
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. SISAP 2013: 73-84 - [c68]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: 157-167 - 2012
- [j16]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. 95-D(7): 1847-1857 (2012) - [j15]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): 636-640 (2012) - [j14]Yusaku Kaneta, Hiroki Arimura, Rajeev Raman:
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. J. Discrete Algorithms 14: 119-135 (2012) - [c67]Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. COCOON 2012: 347-359 - [c66]Xiaoliang Geng, Hiroki Arimura, Takeaki Uno:
Pattern Mining from Trajectory GPS Data. IIAI-AAI 2012: 60-65 - [c65]Hirohito Sasakawa, Hiroki Arimura:
Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data. IIAI-AAI 2012: 66-71 - 2011
- [j13]Takashi Uemura, Daisuke Ikeda, Takuya Kida, Hiroki Arimura:
Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method. Inf. Media Technol. 6(1): 231-240 (2011) - [c64]Takashi Uemura, Hiroki Arimura:
Sparse and Truncated Suffix Trees on Variable-Length Codes. CPM 2011: 246-260 - [c63]Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato:
Implementation of sequence BDDs in Erlang. Erlang Workshop 2011: 90-91 - [c62]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: 147-161 - 2010
- [j12]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. Inf. Media Technol. 5(2): 459-470 (2010) - [c61]Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga:
Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching. FPT 2010: 21-28 - [c60]Hiroki Arimura:
Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data. ISCIS 2010: 353-358 - [c59]Yusaku Kaneta, Hiroki Arimura:
Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. IWOCA 2010: 68-81 - [c58]Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura:
Fast Bit-Parallel Matching for Network and Regular Expressions. SPIRE 2010: 372-384
2000 – 2009
- 2009
- [c57]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
Mining Frequent Bipartite Episode from Event Sequences. Discovery Science 2009: 136-151 - [c56]Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura:
Efficient serial episode mining with minimal occurrences. ICUIMC 2009: 457-464 - [c55]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
Mining Frequent k-Partite Episodes from Event Sequences. JSAI-isAI Workshops 2009: 331-344 - [c54]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. PAKDD 2009: 172-183 - [c53]Hiroki Arimura, Takeaki Uno:
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. SDM 2009: 1088-1099 - 2008
- [c52]Takashi Uemura, Daisuke Ikeda, Hiroki Arimura:
Unsupervised Spam Detection by Document Complexity Estimation. Discovery Science 2008: 319-331 - [c51]Takuya Kida, Tomoya Saito, Hiroki Arimura:
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. PAKDD Workshops 2008: 1-12 - [c50]Hiroki Arimura:
Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. PAKDD 2008: 2-13 - [c49]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: 13-25 - [c48]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: 234-246 - [c47]Takeaki Uno, Hiroki Arimura:
Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD 2008: 357-368 - 2007
- [j11]Shin-ichi Minato, Hiroki Arimura:
Frequent Closed Item Set Mining Based on Zero-suppressed BDDs. Inf. Media Technol. 2(1): 309-316 (2007) - [j10]Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono:
Hardness Results on Local Multiple Alignment of Biological Sequences. Inf. Media Technol. 2(2): 514-522 (2007) - [j9]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): 243-262 (2007) - [c46]Hiroki Arimura, Takeaki Uno, Shinichi Shimozono:
Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55 - [c45]Takeaki Uno, Hiroki Arimura:
An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science 2007: 219-230 - [c44]Hiroki Arimura, Takeaki Uno:
Mining Maximal Flexible Patterns in a Sequence. JSAI 2007: 307-317 - 2006
- [j8]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): 579-580 (2006) - [c43]Shin-ichi Minato, Hiroki Arimura:
Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. KDID 2006: 152-169 - 2005
- [j7]Hiroki Arimura, Sanjay Jain:
Preface. Theor. Comput. Sci. 348(1): 1-2 (2005) - [c42]Hiroki Arimura, Takeaki Uno:
An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP 2005: 1-19 - [c41]Hiroki Arimura, Takeaki Uno:
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC 2005: 724-737 - [c40]Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine:
Key semantics extraction by dependency tree mining. KDD 2005: 666-671 - [c39]Shin-ichi Minato, Hiroki Arimura:
Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. WIRI 2005: 4-11 - 2004
- [j6]Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa:
Efficient Substructure Discovery from Large Semi-Structured Data. IEICE Trans. Inf. Syst. 87-D(12): 2754-2763 (2004) - [c38]Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura:
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science 2004: 16-31 - [c37]Takeaki Uno, Masashi Kiyomi, Hiroki Arimura:
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. FIMI 2004 - [c36]Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Setsuo Arikawa:
Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams. JSAI Workshops 2004: 29-45 - 2003
- [j5]Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura:
Learning elementary formal systems with queries. Theor. Comput. Sci. 298(1): 21-50 (2003) - [c35]Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano:
Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61 - [c34]Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura:
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI 2003 - 2002
- [c33]Hiroki Arimura:
Efficient Text Mining with Optimized Pattern Discovery. CPM 2002: 17-19 - [c32]Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Data Mining from Large Text Databases. Progress in Discovery Science 2002: 123-139 - [c31]Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa:
Knowledge Discovery from Semistructured Texts. Progress in Discovery Science 2002: 586-599 - [c30]Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa:
Online Algorithms for Mining Semi-structured Data Stream. ICDM 2002: 27-34 - [c29]Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa:
Optimized Substructure Discovery for Semi-structured Data. PKDD 2002: 1-14 - [c28]Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Substructure Discovery from Large Semi-structured Data. SDM 2002: 158-174 - 2001
- [c27]Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Learning of Semi-structured Data from Queries. ALT 2001: 315-331 - [c26]Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Discovery of Proximity Patterns with Suffix Arrays. CPM 2001: 152-156 - [c25]Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park:
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. CPM 2001: 181-192 - [c24]Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa:
Mining Semi-structured Data by Path Expressions. Discovery Science 2001: 378-388 - [c23]Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa:
Extracting Partial Structures from HTML Documents. FLAIRS 2001: 264-268 - [c22]Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura:
Modelling Semi-structured Documents with Hedges for Deduction and Induction. ILP 2001: 240-247 - 2000
- [j4]Shinichi Shimozono, Hiroki Arimura, Setsuo Arikawa:
Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Gener. Comput. 18(1): 49-60 (2000) - [j3]Takeshi Shinohara, Hiroki Arimura:
Inductive inference of unbounded unions of pattern languages from positive data. Theor. Comput. Sci. 241(1-2): 191-209 (2000) - [c21]Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa:
Identification of Tree Translation Rules from Examples. ICGI 2000: 241-255 - [c20]Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Learning Term Rewriting Systems from Entailment . ILP Work-in-progress reports 2000 - [c19]Hiroki Arimura, Jun-ichiro Abe, Hiroshi Sakamoto, Setsuo Arikawa, Ryoichi Fujino, Shinichi Shimozono:
Text Data Mining: Discovery of Important Keywords in the Cyberspace. Kyoto International Conference on Digital Libraries 2000: 121-126 - [c18]Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa:
Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. PAKDD 2000: 281-293 - [c17]Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono:
On approximation algorithms for local multiple alignment. RECOMB 2000: 1-7 - [e1]Hiroki Arimura, Sanjay Jain, Arun Sharma:
Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 11-13, 2000, Proceedings. Lecture Notes in Computer Science 1968, Springer 2000, ISBN 3-540-41237-9 [contents]
1990 – 1999
- 1999
- [c16]Shigeru Takano, Teruya Minamoto, Hiroki Arimura, Koichi Niijima, Toshihiko Iyemori, Tohru Araki:
Automatic Detection of Geomagnetic Sudden Commencement Using Lifting Wavelet Filters. Discovery Science 1999: 242-251 - [c15]Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki:
Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. Discovery Science 1999: 359-361 - 1998
- [j2]Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara:
Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. Ann. Math. Artif. Intell. 23(1-2): 101-115 (1998) - [c14]Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa:
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. ALT 1998: 247-261 - [c13]Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Shinichi Shimozono, Setsuo Arikawa:
An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. Discovery Science 1998: 393-394 - [c12]Hiroki Arimura, Shinichi Shimozono:
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. ISAAC 1998: 39-48 - 1997
- [j1]Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara:
Learning Unions of Tree Patterns Using Queries. Theor. Comput. Sci. 185(1): 47-62 (1997) - [c11]Hiroki Arimura:
Learning Acyclic First-Order Horn Sentences from Entailment. ALT 1997: 432-445 - [c10]Daisuke Ikeda, Hiroki Arimura:
On the Complexity of Languages Definable by Hereditary Elementary Formal Systems. Developments in Language Theory 1997: 223-235 - 1996
- [c9]Takeshi Shinohara, Hiroki Arimura:
Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data. ALT 1996: 256-271 - 1995
- [c8]Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara:
Learning Unions of Tree Patterns Using Queries. ALT 1995: 66-79 - 1994
- [c7]Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara:
Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. AII/ALT 1994: 317-332 - [c6]Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki:
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. STACS 1994: 649-660 - 1992
- [c5]Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara:
Efficient Inductive Inference of Primitive Prologs from Positive Data. ALT 1992: 135-146 - [c4]Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara:
Polynomial Time Inference of a Subclass of Context-Free Transformations. COLT 1992: 136-143 - [c3]Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, Hiroki Ishizaka:
A Generalization of the Least General Generalization. Machine Intelligence 13 1992: 59-85 - 1991
- [c2]Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki:
Polynomial-time inference of unions of tree pattern languages. ALT 1991: 105-114 - [c1]Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki:
A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages. Nonmonotonic and Inductive Logic 1991: 118-131 - [p1]Hiroki Arimura:
Completeness of Depth-bounded Resolution for Weakly Reducing Programs. Software Science and Engineering 1991: 227-245
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
