Hiroki Arimura

145 papers A* 7A 4B 41C 11Misc 5Journal 46Unranked 30

Year	Rank	Type	Title / Venue / Authors
2024	C	`conf`	Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
2024	J	`jnl`	Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
2024	B	`conf`	Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
2024	J	`jnl`	Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
2023	J	`jnl`	Minimum Consistent Subset for Trees Revisited. CoRR Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi
2023	C	`conf`	Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
2023	J	`jnl`	Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
2022	B	`conf`	Cartesian Tree Subsequence Matching. CPM Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
2022	J	`jnl`	Cartesian Tree Subsequence Matching. CoRR Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
2022	J	`jnl`	Computing the Collection of Good Models for Rule Lists. CoRR Kota Mata, Kentaro Kanamori, Hiroki Arimura
2021	J	`jnl`	A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. Theor. Comput. Sci. Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2021	J	`jnl`	Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2021	A*	`conf`	Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. AAAI Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
2020	A*	`conf`	DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. IJCAI Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura
2020	J	`jnl`	Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification. CoRR Hiroaki Iwashita, Takuya Takagi, Hirofumi Suzuki, Keisuke Goto, Kotaro Ohori, Hiroki Arimura
2020	J	`jnl`	Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
2020	J	`jnl`	Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. CoRR Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
2019	C	`conf`	An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2019	J	`jnl`	An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2019	J	`jnl`	Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. CoRR Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2019	J	`jnl`	Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura
2019	J	`jnl`	Enumeration of Distinct Support Vectors for Interactive Decision Making. CoRR Kentaro Kanamori, Satoshi Hara, Masakazu Ishihata, Hiroki Arimura
2019	C	`conf`	Fast Identification of Heavy Hitters by Cached and Packed Group Testing. SPIRE Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
2019	J	`jnl`	The Complexity of Induced Tree Reconfiguration Problems. IEICE Trans. Inf. Syst. Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
2018	J	`jnl`	DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
2018	J	`jnl`	Discovering Co-Cluster Structure from Relationships between Biased Objects. IEICE Trans. Inf. Syst. Iku Ohama, Takuya Kida, Hiroki Arimura
2018	B	`conf`	Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2018	J	`jnl`	Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2018	J	`jnl`	Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2018	C	`conf`	Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
2018	J	`jnl`	Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
2017	A*	`conf`	Discovering Relevance-Dependent Bicluster Structure from Relational Data. IJCAI Iku Ohama, Takuya Kida, Hiroki Arimura
2017	J	`jnl`	Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2017	C	`conf`	Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. SPIRE Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura
2017	J	`jnl`	Linear-size CDAWG: new repetition-aware indexing and grammar compression. CoRR Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura
2017	—	`conf`	On the Model Shrinkage Effect of Gamma Process Edge Partition Models. NIPS Iku Ohama, Issei Sato, Takuya Kida, Hiroki Arimura
2017	J	`jnl`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2017	A*	`conf`	Statistical Emerging Pattern Mining with Multiple Testing Correction. KDD Junpei Komiyama, Masakazu Ishihata, Hiroki Arimura, Takashi Nishibayashi, Shin-ichi Minato
2016	B	`conf`	Fully-online Construction of Suffix Trees for Multiple Texts. CPM Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura
2016	C	`conf`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016	J	`jnl`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016	—	`conf`	Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees. ICMCS Mayumbo Nyirenda, Hiroki Arimura, Kimihito Ito
2016	J	`jnl`	Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations. Discret. Appl. Math. Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato
2016	C	`conf`	The Complexity of Induced Tree Reconfiguration Problems. LATA Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
2016	J	`jnl`	The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise. IEICE Trans. Inf. Syst. Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura
2015	B	`conf`	Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. SISAP Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura
2015	J	`jnl`	Fully-online construction of suffix trees and DAWGs for multiple texts. CoRR Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura
2015	A	`conf`	Multi-Layered Framework for Modeling Relationships between Biased Objects. SDM Iku Ohama, Takuya Kida, Hiroki Arimura
2014	J	`jnl`	Constant Time Enumeration of Subtrees with Exactly IEICE Trans. Inf. Syst. Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
2014	B	`conf`	DenseZDD: A Compact and Fast Index for Families of Sets. SEA Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
2014	B	`conf`	Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. ISAAC Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2014	J	`jnl`	Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. CoRR Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2014	—	`conf`	Enumeration of complete set of flock patterns in trajectories. IWGS Xiaoliang Geng, Takuya Takagi, Hiroki Arimura, Takeaki Uno
2014	Misc	`conf`	Fast Regular Expression Matching Based On Dual Glushkov NFA. PSC Ryutaro Kurai, Norihito Yasuda, Hiroki Arimura, Shinobu Nagayama, Shin-ichi Minato
2014	—	`conf`	Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection. WPES Hirohito Sasakawa, Hiroki Harada, David duVerle, Hiroki Arimura, Koji Tsuda, Jun Sakuma
2013	—	`conf`	An Extension of the Infinite Relational Model Incorporating Interaction between Objects. PAKDD (2) Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura
2013	Misc	`conf`	Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams . PSC Shuhei Denzumi, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato
2013	B	`conf`	Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. SISAP Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura
2013	B	`conf`	Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. Discovery Science Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura
2013	—	`conf`	Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. KDIR/KMIS Xiaoliang Geng, Takeaki Uno, Hiroki Arimura
2012	J	`jnl`	A Dynamically Reconfigurable FPGA-Based Pattern Matching Hardware for Subclasses of Regular Expressions. IEICE Trans. Inf. Syst. Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga
2012	Misc	`conf`	Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. COCOON Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
2012	J	`jnl`	Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Inf. Process. Lett. Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato
2012	J	`jnl`	Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. J. Discrete Algorithms Yusaku Kaneta, Hiroki Arimura, Rajeev Raman
2012	—	`conf`	Pattern Mining from Trajectory GPS Data. IIAI-AAI Xiaoliang Geng, Hiroki Arimura, Takeaki Uno
2012	—	`conf`	Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data. IIAI-AAI Hirohito Sasakawa, Hiroki Arimura
2011	—	`conf`	Implementation of sequence BDDs in Erlang. Erlang Workshop Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato
2011	Misc	`conf`	Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations. PSC Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato
2011	B	`conf`	Sparse and Truncated Suffix Trees on Variable-Length Codes. CPM Takashi Uemura, Hiroki Arimura
2011	J	`jnl`	Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method. Inf. Media Technol. Takashi Uemura, Daisuke Ikeda, Takuya Kida, Hiroki Arimura
2010	J	`jnl`	An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. Inf. Media Technol. Takashi Katoh, Hiroki Arimura, Kouichi Hirata
2010	—	`conf`	Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching. FPT Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga
2010	—	`conf`	Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data. ISCIS Hiroki Arimura
2010	C	`conf`	Fast Bit-Parallel Matching for Network and Regular Expressions. SPIRE Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
2010	C	`conf`	Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. IWOCA Yusaku Kaneta, Hiroki Arimura
2009	B	`conf`	A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. PAKDD Takashi Katoh, Hiroki Arimura, Kouichi Hirata
2009	—	`conf`	Efficient serial episode mining with minimal occurrences. ICUIMC Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura
2009	—	`conf`	Mining Frequent JSAI-isAI Workshops Takashi Katoh, Hiroki Arimura, Kouichi Hirata
2009	B	`conf`	Mining Frequent Bipartite Episode from Event Sequences. Discovery Science Takashi Katoh, Hiroki Arimura, Kouichi Hirata
2009	A	`conf`	Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. SDM Hiroki Arimura, Takeaki Uno
2008	B	`conf`	Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD Takeaki Uno, Hiroki Arimura
2008	—	`conf`	An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting. PAKDD Workshops Tatsuya Asai, Seishi Okamoto, Hiroki Arimura
2008	B	`conf`	Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. PAKDD Hiroki Arimura
2008	—	`conf`	Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. PAKDD Workshops Takuya Kida, Tomoya Saito, Hiroki Arimura
2008	B	`conf`	LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. PAKDD Shin-ichi Minato, Takeaki Uno, Hiroki Arimura
2008	B	`conf`	Unsupervised Spam Detection by Document Complexity Estimation. Discovery Science Takashi Uemura, Daisuke Ikeda, Hiroki Arimura
2007	B	`conf`	An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science Takeaki Uno, Hiroki Arimura
2007	J	`jnl`	An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. J. Comb. Optim. Hiroki Arimura, Takeaki Uno
2007	J	`jnl`	Frequent Closed Item Set Mining Based on Zero-suppressed BDDs. Inf. Media Technol. Shin-ichi Minato, Hiroki Arimura
2007	J	`jnl`	Hardness Results on Local Multiple Alignment of Biological Sequences. Inf. Media Technol. Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono
2007	—	`conf`	Mining Maximal Flexible Patterns in a Sequence. JSAI Hiroki Arimura, Takeaki Uno
2007	B	`conf`	Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
2006	J	`jnl`	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. Jörg Rothe, Hiroki Arimura
2006	—	`conf`	Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. KDID Shin-ichi Minato, Hiroki Arimura
2005	B	`conf`	A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC Hiroki Arimura, Takeaki Uno
2005	B	`conf`	An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP Hiroki Arimura, Takeaki Uno
2005	—	`conf`	Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. WIRI Shin-ichi Minato, Hiroki Arimura
2005	A*	`conf`	Key semantics extraction by dependency tree mining. KDD Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine
2005	J	`jnl`	Preface. Theor. Comput. Sci. Hiroki Arimura, Sanjay Jain
2004	B	`conf`	An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
2004	—	`conf`	Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams. JSAI Workshops Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Setsuo Arikawa
2004	J	`jnl`	Efficient Substructure Discovery from Large Semi-Structured Data. IEICE Trans. Inf. Syst. Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa
2004	—	`conf`	LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets FIMI Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
2003	B	`conf`	Discovering Frequent Substructures in Large Unordered Trees. Discovery Science Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano
2003	—	`conf`	LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
2003	J	`jnl`	Learning elementary formal systems with queries. Theor. Comput. Sci. Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura
2002	—	`conf`	Efficient Data Mining from Large Text Databases. Progress in Discovery Science Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa
2002	A	`conf`	Efficient Substructure Discovery from Large Semi-structured Data. SDM Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa
2002	B	`conf`	Efficient Text Mining with Optimized Pattern Discovery. CPM Hiroki Arimura
2002	—	`conf`	Knowledge Discovery from Semistructured Texts. Progress in Discovery Science Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa
2002	A*	`conf`	Online Algorithms for Mining Semi-structured Data Stream. ICDM Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa
2002	—	`conf`	Optimized Substructure Discovery for Semi-structured Data. PKDD Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa
2001	B	`conf`	Efficient Discovery of Proximity Patterns with Suffix Arrays. CPM Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa
2001	B	`conf`	Efficient Learning of Semi-structured Data from Queries. ALT Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa
2001	Misc	`conf`	Extracting Partial Structures from HTML Documents. FLAIRS Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa
2001	B	`conf`	Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. CPM Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park
2001	B	`conf`	Mining Semi-structured Data by Path Expressions. Discovery Science Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa
2001	B	`conf`	Modelling Semi-structured Documents with Hedges for Deduction and Induction. ILP Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura
2000	B	`ed.`	Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 11-13, 2000, Proceedings ALT Hiroki Arimura, Sanjay Jain, Arun Sharma
2000	B	`conf`	Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. PAKDD Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa
2000	J	`jnl`	Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Gener. Comput. Shinichi Shimozono, Hiroki Arimura, Setsuo Arikawa
2000	—	`conf`	Identification of Tree Translation Rules from Examples. ICGI Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa
2000	J	`jnl`	Inductive inference of unbounded unions of pattern languages from positive data. Theor. Comput. Sci. Takeshi Shinohara, Hiroki Arimura
2000	—	`conf`	Learning Term Rewriting Systems from Entailment . ILP Work-in-progress reports Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa
2000	B	`conf`	On approximation algorithms for local multiple alignment. RECOMB Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono
2000	—	`conf`	Text Data Mining: Discovery of Important Keywords in the Cyberspace. Kyoto International Conference on Digital Libraries Hiroki Arimura, Jun-ichiro Abe, Hiroshi Sakamoto, Setsuo Arikawa, Ryoichi Fujino, Shinichi Shimozono
1999	B	`conf`	Automatic Detection of Geomagnetic Sudden Commencement Using Lifting Wavelet Filters. Discovery Science Shigeru Takano, Teruya Minamoto, Hiroki Arimura, Koichi Niijima, Toshihiko Iyemori, Tohru Araki
1999	B	`conf`	Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. Discovery Science Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki
1998	B	`conf`	A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. ALT Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa
1998	B	`conf`	An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. Discovery Science Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Shinichi Shimozono, Setsuo Arikawa
1998	J	`jnl`	Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. Ann. Math. Artif. Intell. Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara
1998	B	`conf`	Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. ISAAC Hiroki Arimura, Shinichi Shimozono
1997	B	`conf`	Learning Acyclic First-Order Horn Sentences from Entailment. ALT Hiroki Arimura
1997	J	`jnl`	Learning Unions of Tree Patterns Using Queries. Theor. Comput. Sci. Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
1997	C	`conf`	On the Complexity of Languages Definable by Hereditary Elementary Formal Systems. Developments in Language Theory Daisuke Ikeda, Hiroki Arimura
1996	B	`conf`	Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data. ALT Takeshi Shinohara, Hiroki Arimura
1995	B	`conf`	Learning Unions of Tree Patterns Using Queries. ALT Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
1994	A	`conf`	Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. STACS Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki
1994	—	`conf`	Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. AII/ALT Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara
1992	—	`conf`	A Generalization of the Least General Generalization. Machine Intelligence 13 Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, Hiroki Ishizaka
1992	B	`conf`	Efficient Inductive Inference of Primitive Prologs from Positive Data. ALT Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara
1992	A*	`conf`	Polynomial Time Inference of a Subclass of Context-Free Transformations. COLT Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
1991	—	`conf`	A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages. Nonmonotonic and Inductive Logic Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki
1991	—	`ch.`	Completeness of Depth-bounded Resolution for Weakly Reducing Programs. Software Science and Engineering Hiroki Arimura
1991	B	`conf`	Polynomial-time inference of unions of tree pattern languages. ALT Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki