Hiroki Arimura

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

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 Transactions 95-D(7): 1847-1857 (2012)

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)

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)

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

Takashi Uemura, Hiroki Arimura: Sparse and Truncated Suffix Trees on Variable-Length Codes. CPM 2011: 246-260

Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato: Implementation of sequence BDDs in Erlang. Erlang Workshop 2011: 90-91

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

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

Hiroki Arimura: Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data. ISCIS 2010: 353-358

Yusaku Kaneta, Hiroki Arimura: Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. IWOCA 2010: 68-81

Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura: Fast Bit-Parallel Matching for Network and Regular Expressions. SPIRE 2010: 372-384

Takashi Katoh, Hiroki Arimura, Kouichi Hirata: Mining Frequent Bipartite Episode from Event Sequences. Discovery Science 2009: 136-151

Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura: Efficient serial episode mining with minimal occurrences. ICUIMC 2009: 457-464

Takashi Katoh, Hiroki Arimura, Kouichi Hirata: Mining Frequent k-Partite Episodes from Event Sequences. JSAI-isAI Workshops 2009: 331-344

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

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

Takashi Uemura, Daisuke Ikeda, Hiroki Arimura: Unsupervised Spam Detection by Document Complexity Estimation. Discovery Science 2008: 319-331

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

Hiroki Arimura: Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. PAKDD 2008: 2-13

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

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

Takeaki Uno, Hiroki Arimura: Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD 2008: 357-368

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)

Hiroki Arimura, Takeaki Uno, Shinichi Shimozono: Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55

Takeaki Uno, Hiroki Arimura: An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science 2007: 219-230

Hiroki Arimura, Takeaki Uno: Mining Maximal Flexible Patterns in a Sequence. JSAI 2007: 307-317

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. UCS 12(6): 579-580 (2006)

Shin-ichi Minato, Hiroki Arimura: Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. KDID 2006: 152-169

Hiroki Arimura, Sanjay Jain: Preface. Theor. Comput. Sci. 348(1): 1-2 (2005)

Hiroki Arimura, Takeaki Uno: An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP 2005: 1-19

Hiroki Arimura, Takeaki Uno: A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC 2005: 724-737

Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine: Key semantics extraction by dependency tree mining. KDD 2005: 666-671

Shin-ichi Minato, Hiroki Arimura: Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. WIRI 2005: 4-11

Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Efficient Substructure Discovery from Large Semi-Structured Data. IEICE Transactions 87-D(12): 2754-2763 (2004)

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

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

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

Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura: Learning elementary formal systems with queries. Theor. Comput. Sci. 1(298): 21-50 (2003)

Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano: Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61

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

Hiroki Arimura: Efficient Text Mining with Optimized Pattern Discovery. CPM 2002: 17-19

Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Data Mining from Large Text Databases. Progress in Discovery Science 2002: 123-139

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Knowledge Discovery from Semistructured Texts. Progress in Discovery Science 2002: 586-599

Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa: Online Algorithms for Mining Semi-structured Data Stream. ICDM 2002: 27-34

Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa: Optimized Substructure Discovery for Semi-structured Data. PKDD 2002: 1-14

Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Substructure Discovery from Large Semi-structured Data. SDM 2002

Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Learning of Semi-structured Data from Queries. ALT 2001: 315-331

Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Discovery of Proximity Patterns with Suffix Arrays. CPM 2001: 152-156

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

Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa: Mining Semi-structured Data by Path Expressions. Discovery Science 2001: 378-388

Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa: Extracting Partial Structures from HTML Documents. FLAIRS Conference 2001: 264-268

Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura: Modelling Semi-structured Documents with Hedges for Deduction and Induction. ILP 2001: 240-247

Shinichi Shimozono, Hiroki Arimura, Setsuo Arikawa: Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Generation Comput. 18(1): 49-60 (2000)

Takeshi Shinohara, Hiroki Arimura: Inductive inference of unbounded unions of pattern languages from positive data. Theor. Comput. Sci. 241(1-2): 191-209 (2000)

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Identification of Tree Translation Rules from Examples. ICGI 2000: 241-255

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

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

Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa: Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. PAKDD 2000: 281-293

Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono: On approximation algorithms for local multiple alignment. RECOMB 2000: 1-7

Hiroki Arimura, Sanjay Jain, Arun Sharma (Eds.): 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

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

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

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)

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

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

Hiroki Arimura, Shinichi Shimozono: Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. ISAAC 1998: 39-48

Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara: Learning Unions of Tree Patterns Using Queries. Theor. Comput. Sci. 185(1): 47-62 (1997)

Hiroki Arimura: Learning Acyclic First-Order Horn Sentences from Entailment. ALT 1997: 432-445

Daisuke Ikeda, Hiroki Arimura: On the Complexity of Languages Definable by Hereditary Elementary Formal Systems. Developments in Language Theory 1997: 223-235

Takeshi Shinohara, Hiroki Arimura: Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data. ALT 1996: 256-271

Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara: Learning Unions of Tree Patterns Using Queries. ALT 1995: 66-79

Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara: Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. AII/ALT 1994: 317-332

Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, Hiroki Ishizaka: A Generalization of the Least General Generalization. Machine Intelligence 13 1994: 59-85

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

Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara: Efficient Inductive Inference of Primitive Prologs from Positive Data. ALT 1992: 135-146

Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara: Polynomial Time Inference of a Subclass of Context-Free Transformations. COLT 1992: 136-143

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