| 2011 |
|---|
| 69 | Sparse and Truncated Suffix Trees on Variable-Length Codes. Takashi Uemura, Hiroki Arimura. CPM 2011, 246-260. Web SearchBibTeXDownload |
| 2010 |
|---|
| 68 | Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching. Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga. FPT 2010, 21-28. Web SearchBibTeXDownload |
| 67 | Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data. Hiroki Arimura. ISCIS 2010, 353-358. Web SearchBibTeXDownload |
| 66 | Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. Yusaku Kaneta, Hiroki Arimura. IWOCA 2010, 68-81. Web SearchBibTeXDownload |
| 65 | Fast Bit-Parallel Matching for Network and Regular Expressions. Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura. SPIRE 2010, 372-384. Web SearchBibTeXDownload |
| 2009 |
|---|
| 64 | Mining Frequent Bipartite Episode from Event Sequences. Takashi Katoh, Hiroki Arimura, Kouichi Hirata. Discovery Science 2009, 136-151. Web SearchBibTeXDownload |
| 63 | Efficient serial episode mining with minimal occurrences. Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura. ICUIMC 2009, 457-464. Web SearchBibTeXDownload |
| 62 | Mining Frequent k-Partite Episodes from Event Sequences. Takashi Katoh, Hiroki Arimura, Kouichi Hirata. JSAI-isAI Workshops 2009, 331-344. Web SearchBibTeXDownload |
| 61 | A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. Takashi Katoh, Hiroki Arimura, Kouichi Hirata. PAKDD 2009, 172-183. Web SearchBibTeXDownload |
| 60 | Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. Hiroki Arimura, Takeaki Uno. SDM 2009, 1087-1098. Web SearchBibTeXDownload |
| 2008 |
|---|
| 59 | Unsupervised Spam Detection by Document Complexity Estimation. Takashi Uemura, Daisuke Ikeda, Hiroki Arimura. Discovery Science 2008, 319-331. Web SearchBibTeXDownload |
| 58 | Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. Hiroki Arimura. PAKDD 2008, 2-13. Web SearchBibTeXDownload |
| 57 | LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. Shin-ichi Minato, Takeaki Uno, Hiroki Arimura. PAKDD 2008, 234-246. Web SearchBibTeXDownload |
| 56 | Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. Takeaki Uno, Hiroki Arimura. PAKDD 2008, 357-368. Web SearchBibTeXDownload |
| 55 | Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. Takuya Kida, Tomoya Saito, Hiroki Arimura. PAKDD Workshops 2008, 1-12. Web SearchBibTeXDownload |
| 54 | An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting. Tatsuya Asai, Seishi Okamoto, Hiroki Arimura. PAKDD Workshops 2008, 13-25. Web SearchBibTeXDownload |
| 2007 |
|---|
| 53 | An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Takeaki Uno, Hiroki Arimura. Discovery Science 2007, 219-230. Web SearchBibTeXDownload |
| 52 | Time and Space Efficient Discovery of Maximal Geometric Graphs. Hiroki Arimura, Takeaki Uno, Shinichi Shimozono. Discovery Science 2007, 42-55. Web SearchBibTeXDownload |
| 51 | An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. Hiroki Arimura, Takeaki Uno. J. Comb. Optim. (13): 243-262 (2007). Web SearchBibTeXDownload |
| 50 | Mining Maximal Flexible Patterns in a Sequence. Hiroki Arimura, Takeaki Uno. JSAI 2007, 307-317. Web SearchBibTeXDownload |
| 2006 |
|---|
| 49 | 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örg Rothe, Hiroki Arimura. J. UCS (12): 579-580 (2006). Web SearchBibTeXDownload |
| 48 | Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. Shin-ichi Minato, Hiroki Arimura. KDID 2006, 152-169. Web SearchBibTeXDownload |
| 2005 |
|---|
| 47 | An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. Hiroki Arimura, Takeaki Uno. ILP 2005, 1-19. Web SearchBibTeXDownload |
| 46 | A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. Hiroki Arimura, Takeaki Uno. ISAAC 2005, 724-737. Web SearchBibTeXDownload |
| 45 | Key semantics extraction by dependency tree mining. Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine. KDD 2005, 666-671. Web SearchBibTeXDownload |
| 44 | Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. Shin-ichi Minato, Hiroki Arimura. WIRI 2005, 4-11. Web SearchBibTeXDownload |
| 2004 |
|---|
| 43 | An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura. Discovery Science 2004, 16-31. Web SearchBibTeXDownload |
| 42 | LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. Takeaki Uno, Masashi Kiyomi, Hiroki Arimura. FIMI 2004. Web SearchBibTeXDownload |
| 41 | Efficient Substructure Discovery from Large Semi-Structured Data. Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa. IEICE Transactions (87-D): 2754-2763 (2004). Web SearchBibTeXDownload |
| 40 | Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams. Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Setsuo Arikawa. JSAI Workshops 2004, 29-45. Web SearchBibTeXDownload |
| 2003 |
|---|
| 39 | Discovering Frequent Substructures in Large Unordered Trees. Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano. Discovery Science 2003, 47-61. Web SearchBibTeXDownload |
| 38 | LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura. FIMI 2003. Web SearchBibTeXDownload |
| 37 | Learning elementary formal systems with queries. Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura. Theor. Comput. Sci. (1): 21-50 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 36 | Efficient Text Mining with Optimized Pattern Discovery. Hiroki Arimura. CPM 2002, 17-19. Web SearchBibTeXDownload |
| 35 | Online Algorithms for Mining Semi-structured Data Stream. Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa. ICDM 2002, 27-34. Web SearchBibTeXDownload |
| 34 | Optimized Substructure Discovery for Semi-structured Data. Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa. PKDD 2002, 1-14. Web SearchBibTeXDownload |
| 33 | Efficient Data Mining from Large Text Databases. Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa. Progress in Discovery Science 2002, 123-139. Web SearchBibTeXDownload |
| 32 | Knowledge Discovery from Semistructured Texts. Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa. Progress in Discovery Science 2002, 586-599. Web SearchBibTeXDownload |
| 31 | Efficient Substructure Discovery from Large Semi-structured Data. Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa. SDM 2002. Web SearchBibTeXDownload |
| 2001 |
|---|
| 30 | Efficient Learning of Semi-structured Data from Queries. Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa. ALT 2001, 315-331. Web SearchBibTeXDownload |
| 29 | Efficient Discovery of Proximity Patterns with Suffix Arrays. Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa. CPM 2001, 152-156. Web SearchBibTeXDownload |
| 28 | Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park. CPM 2001, 181-192. Web SearchBibTeXDownload |
| 27 | Mining Semi-structured Data by Path Expressions. Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa. Discovery Science 2001, 378-388. Web SearchBibTeXDownload |
| 26 | Extracting Partial Structures from HTML Documents. Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa. FLAIRS Conference 2001, 264-268. Web SearchBibTeX |
| 25 | Modelling Semi-structured Documents with Hedges for Deduction and Induction. Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura. ILP 2001, 240-247. Web SearchBibTeXDownload |
| 2000 |
|---|
| 24 | Identification of Tree Translation Rules from Examples. Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa. ICGI 2000, 241-255. Web SearchBibTeXDownload |
| 23 | Learning Term Rewriting Systems from Entailment . Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa. ILP Work-in-progress reports 2000. Web SearchBibTeXDownload |
| 22 | Text Data Mining: Discovery of Important Keywords in the Cyberspace. Hiroki Arimura, Jun-ichiro Abe, Hiroshi Sakamoto, Setsuo Arikawa, Ryoichi Fujino, Shinichi Shimozono. Kyoto International Conference on Digital Libraries 2000, 121-126. Web SearchBibTeX |
| 21 | Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. Shinichi Shimozono, Hiroki Arimura, Setsuo Arikawa. New Generation Comput. (18): 49-60 (2000). Web SearchBibTeXDownload |
| 20 | Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa. PAKDD 2000, 281-293. Web SearchBibTeXDownload |
| 19 | On approximation algorithms for local multiple alignment. Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono. RECOMB 2000, 1-7. Web SearchBibTeXDownload |
| 18 | Inductive inference of unbounded unions of pattern languages from positive data. Takeshi Shinohara, Hiroki Arimura. Theor. Comput. Sci. (241): 191-209 (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 17 | Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki. Discovery Science 1999, 359-361. Web SearchBibTeXDownload |
| 16 | Automatic Detection of Geomagnetic Sudden Commencement Using Lifting Wavelet Filters. Shigeru Takano, Teruya Minamoto, Hiroki Arimura, Koichi Niijima, Toshihiko Iyemori, Tohru Araki. Discovery Science 1999, 242-251. Web SearchBibTeXDownload |
| 1998 |
|---|
| 15 | A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa. ALT 1998, 247-261. Web SearchBibTeXDownload |
| 14 | Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara. Ann. Math. Artif. Intell. (23): 101-115 (1998). Web SearchBibTeXDownload |
| 13 | An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Shinichi Shimozono, Setsuo Arikawa. Discovery Science 1998, 393-394. Web SearchBibTeXDownload |
| 12 | Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. Hiroki Arimura, Shinichi Shimozono. ISAAC 1998, 39-48. Web SearchBibTeXDownload |
| 1997 |
|---|
| 11 | Learning Acyclic First-Order Horn Sentences from Entailment. Hiroki Arimura. ALT 1997, 432-445. Web SearchBibTeXDownload |
| 10 | On the Complexity of Languages Definable by Hereditary Elementary Formal Systems. Daisuke Ikeda, Hiroki Arimura. Developments in Language Theory 1997, 223-235. Web SearchBibTeX |
| 9 | Learning Unions of Tree Patterns Using Queries. Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara. Theor. Comput. Sci. (185): 47-62 (1997). Web SearchBibTeXDownload |
| 1996 |
|---|
| 8 | Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data. Takeshi Shinohara, Hiroki Arimura. ALT 1996, 256-271. Web SearchBibTeXDownload |
| 1995 |
|---|
| 7 | Learning Unions of Tree Patterns Using Queries. Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara. ALT 1995, 66-79. Web SearchBibTeXDownload |
| 1994 |
|---|
| 6 | Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara. AII/ALT 1994, 317-332. Web SearchBibTeXDownload |
| 5 | A Generalization of the Least General Generalization. Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, Hiroki Ishizaka. Machine Intelligence 13 1994, 59-85. Web SearchBibTeX |
| 4 | Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki. STACS 1994, 649-660. Web SearchBibTeXDownload |
| 1992 |
|---|
| 3 | Efficient Inductive Inference of Primitive Prologs from Positive Data. Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara. ALT 1992, 135-146. Web SearchBibTeXDownload |
| 2 | Polynomial Time Inference of a Subclass of Context-Free Transformations. Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara. COLT 1992, 136-143. Web SearchBibTeXDownload |
| 1991 |
|---|
| 1 | A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages. Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki. Nonmonotonic and Inductive Logic 1991, 118-131. Web SearchBibTeXDownload |
