Takip et
Hiroki Arimura
Hiroki Arimura
Graduate School of Information Science and Technology, Hokkaido University, Professor
ist.hokudai.ac.jp üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
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
7082001
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
6722004
LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets
T Uno, M Kiyomi, H Arimura
Fimi 126, 2004
6372004
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
3542004
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.
T Uno, T Asai, Y Uchida, H Arimura
Fimi 90, 2003
2792003
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
2502005
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
2372003
DACE: Distribution-aware counterfactual explanation by mixed-integer linear optimization.
K Kanamori, T Takagi, K Kobayashi, H Arimura
IJCAI, 2855-2862, 2020
1612020
Optimized substructure discovery for semi-structured data
K Abe, S Kawasoe, T Asai, H Arimura, S Arikawa
European Conference on Principles of Data Mining and Knowledge Discovery, 1-14, 2002
1202002
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
911994
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
892002
Learning acyclic first-order Horn sentences from entailment
H Arimura
Algorithmic Learning Theory: 8th International Workshop, ALT'97 Sendai …, 1997
711997
On approximation algorithms for local multiple alignment
T Akutsu, H Arimura, S Shimozono
RECOMB 2000, 281-293, 2000
662000
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
632009
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
562008
Efficient learning of semi-structured data from queries
H Arimura, H Sakamoto, S Arikawa
Algorithmic Learning Theory: 12th International Conference, ALT 2001 …, 2001
552001
Efficient discovery of optimal word-association patterns in large text databases
S Shimozono, H Arimura, S Arikawa
New Generation Computing 18, 49-60, 2000
542000
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
512007
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
482021
Learning unions of tree patterns using queries
H Arimura, H Ishizaka, T Shinohara
Theoretical Computer Science 185 (1), 47-62, 1997
471997
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20