| Linear-time longest-common-prefix computation in suffix arrays and its applications GM Landau, T Kasai, G Lee, H Arimura, S Arikawa, K Park Combinatorial Pattern Matching: 12th Annual Symposium, CPM 2001 Jerusalem …, 2001 | 690 | 2001 |
| Efficient substructure discovery from large semi-structured data T Asai, K Abe, S Kawasoe, H Sakamoto, H Arimura, S Arikawa IEICE TRANSACTIONS on Information and Systems 87 (12), 2754-2763, 2004 | 664 | 2004 |
| LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets T Uno, M Kiyomi, H Arimura Fimi 126, 2004 | 626 | 2004 |
| An efficient algorithm for enumerating closed patterns in transaction databases T Uno, T Asai, Y Uchida, H Arimura Discovery Science: 7th International Conference, DS 2004, Padova, Italy …, 2004 | 349 | 2004 |
| LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. T Uno, T Asai, Y Uchida, H Arimura Fimi 90, 2003 | 277 | 2003 |
| Lcm ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining T Uno, M Kiyomi, H Arimura Proceedings of the 1st international workshop on open source data mining …, 2005 | 244 | 2005 |
| Discovering frequent substructures in large unordered trees T Asai, H Arimura, T Uno, SI Nakano Discovery Science: 6th International Conference, DS 2003, Sapporo, Japan …, 2003 | 229 | 2003 |
| DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. K Kanamori, T Takagi, K Kobayashi, H Arimura IJCAI, 2855-2862, 2020 | 145 | 2020 |
| Optimized substructure discovery for semi-structured data K Abe, S Kawasoe, T Asai, H Arimura, S Arikawa Principles of Data Mining and Knowledge Discovery: 6th European Conference …, 2002 | 119 | 2002 |
| Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data H Arimura, T Shinohara, S Otsuki STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science …, 1994 | 91 | 1994 |
| Online algorithms for mining semi-structured data stream T Asai, H Arimura, K Abe, S Kawasoe, S Arikawa 2002 IEEE International Conference on Data Mining, 2002. Proceedings., 27-34, 2002 | 87 | 2002 |
| Learning acyclic first-order Horn sentences from entailment H Arimura Algorithmic Learning Theory: 8th International Workshop, ALT'97 Sendai …, 1997 | 70 | 1997 |
| On approximation algorithms for local multiple alignment T Akutsu, H Arimura, S Shimozono RECOMB 2000, 281-293, 2000 | 66 | 2000 |
| Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems H Arimura, T Uno Proceedings of the 2009 SIAM International Conference on Data Mining, 1088-1099, 2009 | 63 | 2009 |
| LCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation S Minato, T Uno, H Arimura Advances in Knowledge Discovery and Data Mining: 12th Pacific-Asia …, 2008 | 56 | 2008 |
| Efficient discovery of optimal word-association patterns in large text databases S Shimozono, H Arimura, S Arikawa New Generation Computing 18, 49-60, 2000 | 55 | 2000 |
| Efficient learning of semi-structured data from queries H Arimura, H Sakamoto, S Arikawa Algorithmic Learning Theory: 12th International Conference, ALT 2001 …, 2001 | 54 | 2001 |
| An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence H Arimura, T Uno Journal of combinatorial optimization 13, 243-262, 2007 | 51 | 2007 |
| Ordered counterfactual explanation by mixed-integer linear optimization K Kanamori, T Takagi, K Kobayashi, Y Ike, K Uemura, H Arimura Proceedings of the AAAI Conference on Artificial Intelligence 35 (13), 11564 …, 2021 | 44 | 2021 |
| Inductive inference of unbounded unions of pattern languages from positive data T Shinohara, H Arimura Theoretical Computer Science 241 (1-2), 191-209, 2000 | 43 | 2000 |
Takeaki UnoNational Institute of Informatics, Japan確認したメール アドレス: nii.jp
