Hiroki Arimura

	2011
72		Takashi Uemura, Hiroki Arimura: Sparse and Truncated Suffix Trees on Variable-Length Codes. CPM 2011: 246-260
71		Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato: Implementation of sequence BDDs in Erlang. Erlang Workshop 2011: 90-91
	2010
70		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
69		Hiroki Arimura: Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data. ISCIS 2010: 353-358
68		Yusaku Kaneta, Hiroki Arimura: Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. IWOCA 2010: 68-81
67		Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura: Fast Bit-Parallel Matching for Network and Regular Expressions. SPIRE 2010: 372-384
	2009
66		Takashi Katoh, Hiroki Arimura, Kouichi Hirata: Mining Frequent Bipartite Episode from Event Sequences. Discovery Science 2009: 136-151
65		Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura: Efficient serial episode mining with minimal occurrences. ICUIMC 2009: 457-464
64		Takashi Katoh, Hiroki Arimura, Kouichi Hirata: Mining Frequent k-Partite Episodes from Event Sequences. JSAI-isAI Workshops 2009: 331-344
63		Takashi Katoh, Hiroki Arimura, Kouichi Hirata: A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. PAKDD 2009: 172-183
62		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
	2008
61		Takashi Uemura, Daisuke Ikeda, Hiroki Arimura: Unsupervised Spam Detection by Document Complexity Estimation. Discovery Science 2008: 319-331
60		Hiroki Arimura: Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. PAKDD 2008: 2-13
59		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
58		Takeaki Uno, Hiroki Arimura: Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD 2008: 357-368
57		Takuya Kida, Tomoya Saito, Hiroki Arimura: Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. PAKDD Workshops 2008: 1-12
56		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
	2007
55		Takeaki Uno, Hiroki Arimura: An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science 2007: 219-230
54		Hiroki Arimura, Takeaki Uno, Shinichi Shimozono: Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55
53		Hiroki Arimura, Takeaki Uno: Mining Maximal Flexible Patterns in a Sequence. JSAI 2007: 307-317
52		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)
	2006
51		Shin-ichi Minato, Hiroki Arimura: Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. KDID 2006: 152-169
50		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)
	2005
49		Hiroki Arimura, Takeaki Uno: An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP 2005: 1-19
48		Hiroki Arimura, Takeaki Uno: A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC 2005: 724-737
47		Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine: Key semantics extraction by dependency tree mining. KDD 2005: 666-671
46		Shin-ichi Minato, Hiroki Arimura: Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. WIRI 2005: 4-11
45		Hiroki Arimura, Sanjay Jain: Preface. Theor. Comput. Sci. 348(1): 1-2 (2005)
	2004
44		Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura: An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science 2004: 16-31
43		Takeaki Uno, Masashi Kiyomi, Hiroki Arimura: LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets FIMI 2004
42		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
41		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)
	2003
40		Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano: Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61
39		Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura: LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI 2003
38		Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura: Learning elementary formal systems with queries. Theor. Comput. Sci. 1(298): 21-50 (2003)
	2002
37		Hiroki Arimura: Efficient Text Mining with Optimized Pattern Discovery. CPM 2002: 17-19
36		Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa: Online Algorithms for Mining Semi-structured Data Stream. ICDM 2002: 27-34
35		Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa: Optimized Substructure Discovery for Semi-structured Data. PKDD 2002: 1-14
34		Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Data Mining from Large Text Databases. Progress in Discovery Science 2002: 123-139
33		Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Knowledge Discovery from Semistructured Texts. Progress in Discovery Science 2002: 586-599
32		Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Substructure Discovery from Large Semi-structured Data. SDM 2002
	2001
31		Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Learning of Semi-structured Data from Queries. ALT 2001: 315-331
30		Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Discovery of Proximity Patterns with Suffix Arrays. CPM 2001: 152-156
29		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
28		Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa: Mining Semi-structured Data by Path Expressions. Discovery Science 2001: 378-388
27		Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa: Extracting Partial Structures from HTML Documents. FLAIRS Conference 2001: 264-268
26		Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura: Modelling Semi-structured Documents with Hedges for Deduction and Induction. ILP 2001: 240-247
	2000
25		Hiroki Arimura, Sanjay Jain, Arun Sharma: Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 11-13, 2000, Proceedings Springer 2000
24		Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Identification of Tree Translation Rules from Examples. ICGI 2000: 241-255
23		Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Learning Term Rewriting Systems from Entailment . ILP Work-in-progress reports 2000
22		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
21		Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa: Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. PAKDD 2000: 281-293
20		Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono: On approximation algorithms for local multiple alignment. RECOMB 2000: 1-7
19		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)
18		Takeshi Shinohara, Hiroki Arimura: Inductive inference of unbounded unions of pattern languages from positive data. Theor. Comput. Sci. 241(1-2): 191-209 (2000)
	1999
17		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
16		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
15		Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa: A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. ALT 1998: 247-261
14		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
13		Hiroki Arimura, Shinichi Shimozono: Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. ISAAC 1998: 39-48
12		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)
	1997
11		Hiroki Arimura: Learning Acyclic First-Order Horn Sentences from Entailment. ALT 1997: 432-445
10		Daisuke Ikeda, Hiroki Arimura: On the Complexity of Languages Definable by Hereditary Elementary Formal Systems. Developments in Language Theory 1997: 223-235
9		Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara: Learning Unions of Tree Patterns Using Queries. Theor. Comput. Sci. 185(1): 47-62 (1997)
	1996
8		Takeshi Shinohara, Hiroki Arimura: Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data. ALT 1996: 256-271
	1995
7		Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara: Learning Unions of Tree Patterns Using Queries. ALT 1995: 66-79
	1994
6		Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara: Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. AII/ALT 1994: 317-332
5		Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki, Hiroki Ishizaka: A Generalization of the Least General Generalization. Machine Intelligence 13 1994: 59-85
4		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
3		Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara: Efficient Inductive Inference of Primitive Prologs from Positive Data. ALT 1992: 135-146
2		Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara: Polynomial Time Inference of a Subclass of Context-Free Transformations. COLT 1992: 136-143
	1991
1		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

Coauthor Index

1	Jun-ichiro Abe	[22]
2	Kenji Abe	[32] [35] [36] [41] [42]
3	Susumu Akamine	[47]
4	Tatsuya Akutsu	[20]
5	Tohru Araki	[17]
6	Setsuo Arikawa	[14] [15] [19] [21] [22] [23] [24] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [41] [42]
7	Tatsuya Asai	[32] [35] [36] [39] [40] [41] [42] [44] [56]
8	Hiroki Asaka	[30]
9	Minoru Chikamune	[16]
10	Shuhei Denzumi	[71]
11	Ryoichi Fujino	[14] [15] [21] [22]
12	Kouichi Hirata	[38] [63] [64] [66]
13	Daisuke Ikeda	[10] [61]
14	Takahiro Ikeda	[47]
15	Hitoshi Inoue	[16]
16	Akira Ishino	[26]
17	Hiroki Ishizaka	[2] [3] [5] [6] [7] [9] [12]
18	Kimihito Ito	[26]
19	Toshihiko Iyemori	[17]
20	Sanjay Jain	[25] [45]
21	Yusaku Kaneta	[67] [68] [70]
22	Toru Kasai	[29]
23	Takashi Katoh	[63] [64] [66]
24	Terukazu Kawasaki	[16]
25	Shinji Kawasoe	[32] [35] [36] [41] [42]
26	Takuya Kida	[57] [65]
27	Masashi Kiyomi	[43]
28	Gunho Lee	[29]
29	Teruya Minamoto	[17]
30	Shin-ichi Minato	[46] [51] [59] [67] [70] [71]
31	Yoshikazu Miyanaga	[70]
32	Satoshi Morinaga	[47]
33	Yoshitsugu Murakami	[27]
34	Shin-Ichi Nakano	[40]
35	Koichi Niijima	[17]
36	Hideyuki Ohtani	[65]
37	Seishi Okamoto	[56]
38	Setsuko Otsuki	[1] [4] [5]
39	Kunsoo Park	[29]
40	Jörg Rothe	[50]
41	Tomoya Saito	[57]
42	Hiroshi Sakamoto	[22] [23] [24] [27] [28] [30] [31] [32] [33] [34] [38] [41]
43	Yosuke Sakao	[47]
44	Arun Sharma	[25]
45	Shinichi Shimozono	[13] [14] [19] [20] [22] [28] [54]
46	Ayumi Shinohara	[16]
47	Takeshi Shinohara	[1] [2] [3] [4] [5] [6] [7] [8] [9] [12] [18]
48	Toru Takae	[16]
49	Shigeru Takano	[17]
50	Shun-ichi Takeya	[16]
51	Katsuaki Taniguchi	[28]
52	Yuzo Uchida	[39] [44]
53	Takashi Uemura	[61] [72]
54	Keiko Uezono	[16]
55	Takeaki Uno	[39] [40] [43] [44] [48] [49] [52] [53] [54] [55] [58] [59] [62] [65]
56	Atsushi Wataki	[14] [15]
57	Akihiro Yamamoto	[26]
58	Shingo Yoshizawa	[70]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page