Hiroki Arimura
Hiroki Arimura
Graduate School of Information Science and Technology, Hokkaido University, Professor
Email verificata su ist.hokudai.ac.jp - Home page
TitoloCitata daAnno
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
Linear-time longest-common-prefix computation in suffix arrays and its applications
T Kasai, G Lee, H Arimura, S Arikawa, K Park
Annual Symposium on Combinatorial Pattern Matching, 181-192, 2001
LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets
T Uno, M Kiyomi, H Arimura
Fimi 126, 2004
An efficient algorithm for enumerating closed patterns in transaction databases
T Uno, T Asai, Y Uchida, H Arimura
International Conference on Discovery Science, 16-31, 2004
Discovering frequent substructures in large unordered trees
T Asai, H Arimura, T Uno, SI Nakano
International Conference on Discovery Science, 47-61, 2003
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.
T Uno, T Asai, Y Uchida, H Arimura
Fimi 90, 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
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
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
Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
H Arimura, T Shinohara, S Otsuki
Annual Symposium on Theoretical Aspects of Computer Science, 647-660, 1994
Learning acyclic first-order Horn sentences from entailment
H Arimura
International Workshop on Algorithmic Learning Theory, 432-445, 1997
On approximation algorithms for local multiple alignment
T Akutsu, T Akutsu, T Akutsu, T Akutsu, T Akutsu, T Akutsu, H Arimura, ...
Proceedings of the fourth annual international conference on Computational …, 2000
Efficient learning of semi-structured data from queries
H Arimura, H Sakamoto, S Arikawa
International Conference on Algorithmic Learning Theory, 315-331, 2001
Efficient discovery of optimal word-association patterns in large text databases
S Shimozono, H Arimura, S Arikawa
New Generation Computing 18 (1), 49-60, 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
Inductive inference of unbounded unions of pattern languages from positive data
T Shinohara, H Arimura
Theoretical Computer Science 241 (1-2), 191-209, 2000
A fast algorithm for discovering optimal string patterns in large text databases
H Arimura, A Wataki, R Fujino, S Arikawa
International Conference on Algorithmic Learning Theory, 247-261, 1998
hOGG1 Ser326Cys polymorphism and risk of hepatocellular carcinoma among Japanese
T Sakamoto, Y Higaki, M Hara, M Ichiba, M Horita, T Mizuta, Y Eguchi, ...
Journal of epidemiology 16 (6), 233-239, 2006
An output-polynomial time algorithm for mining frequent closed attribute trees
H Arimura, T Uno
International Conference on Inductive Logic Programming, 1-19, 2005
LCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation
S Minato, T Uno, H Arimura
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 234-246, 2008
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20