全選択
|
発行 |
タイトル |
著者 |
アクセス数 |
|
2003-06-00 |
Discovering Frequent Substructures in Large Unordered Trees |
Asai, Tatsuya / Arimura, Hiroki / Nakano, Shin-ichi / Uno, Takeaki |
900
|
|
2003-06-00 |
Efficient Tree Mining Using Reverse Search |
Asai, Tatsuya / Arimura, Hiroki / Nakano, Shin-ichi / Uno, Takeaki / Satoh, Ken |
927
|
|
2002-06-00 |
Online Algorithms for Mining Semi-structured Data Stream |
Asai, Tatsuya / Arimura, Hiroki / Abe, Kenji / Arikawa, Setsuo / Kawasoe, Shinji |
1300
|
|
2002-03-00 |
Optimized Substructure Discovery for Semi-structured Data |
Abe, Kenji / Asai, Tatsuya / Arimura, Hiroki / Arikawa, Setsuo / Kawasoe, Shinji |
989
|
|
2002 |
Online algorithms for mining semi-structured data stream |
Asai, Tatsuya / Arimura, Hiroki / Abe, Kenji / Arikawa, Setsuo / Kawasoe, Shinji |
1423
|
|
2001-10-00 |
Efficient Substructure Discovery from Large Semi-structed Data |
Asai, Tatsuya / Abe, Kenji / Arimura, Hiroki / Arikawa, Setsuo / Kawasoe, Shinji / Sakamoto, Hiroshi |
1131
|
|
2001-06-00 |
Knowledge Discovery from Semistructed Texts |
Arimura, Hiroki / Arikawa, Setsuo / Sakamoto, Hiroshi |
1141
|
|
2001-05-00 |
Efficient Learning of Semi-structured Data from Queries |
Arimura, Hiroki / Arikawa, Setsuo / Sakamoto, Hiroshi |
857
|
|
2001-05-00 |
Mining Semi-Structed Data by Path Expressions |
Arimura, Hiroki / Arikawa, Setsuo / Taniguchi, Katsuaki / Sakamoto, Hiroshi / Shimozono, Shinichi |
708
|
|
2001-02-00 |
Efficient Substring Traversal with Suffix Arrays |
Arimura, Hiroki / Arikawa, Setsuo / Kasai, Toru |
766
|
|
2000-11-00 |
Extracting partial structures from HTML documents |
Arimura, Hiroki / Arikawa, Setsuo / Sakamoto, Hiroshi |
851
|
|
2000-10-00 |
Learning Elementary Formal Systems with Queries |
Arimura, Hiroki / Hirata, Kouichi / Sakamoto, Hiroshi |
704
|
|
2000-04-21 |
Identification of Tree Translation Rules from Examples |
Arimura, Hiroki / Arikawa, Setsuo / Sakamoto, Hiroshi |
915
|
|
2000 |
Text Data Mining: Discovery of Important Keywords in the Cyberspace |
Arimura, Hiroki / Abe, Junichiro / Arikawa, Setsuo / Fujino, Ryoichi / Sakamoto, Hiroshi / Shimozono, Shinichi |
1182
|
|
1998-03-19 |
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases |
Arimura, Hiroki / Arikawa, Setsuo / Fujino, Ryoichi / Wataki, Atsushi |
989
|
|
1997-03-13 |
On the Complexity of Languages Definable by Hereditary Elementary Formal Systems |
Arimura, Hiroki / Ikeda, Daisuke |
774
|
|
1996-05-28 |
Elementary Formal Systems with the subword property characterize the class P |
Arimura, Hiroki / Ikeda, Daisuke |
1126
|
|
1994-12-01 |
学位論文審査報告 |
有村, 博紀 / 篠原, 歩 / 宮川, 英明 / 沖田, 茂 / 松野, 浩嗣 |
397
|
|
1994-02-13 |
Unions of a Bounded Number of Tree Pattern Languages Are Hard To Learn |
Arimura, Hiroki |
780
|
|
1993-05-14 |
Minimal Multiple Generalization for Unions of Pattern languages |
Arimura, Hiroki / Otsuki, Setsuko / Shinohara, Takeshi |
769
|
|
1993-05-14 |
Inductive Inference of Prolog Programs with Linear Data Dependency from Positive Data |
Arimura, Hiroki / Shinohara, Takeshi |
1058
|
|
1993-03 |
Depth-Bounded Inference for Nonterminating Prologs |
Arimura, Hiroki |
793
|
|
1992-08-20 |
A Generalization of the Least General Generalization |
Ishizaka, Hiroki / Arimura, Hiroki / Otsuki, Setsuko / Shinohara, Takeshi |
911
|
|
1991-08-01 |
Polynomial Time Inference of Unions of Tree Pattern Languages |
Arimura, Hiroki / Otsuki, Setsuko / Shinohara, Takeshi |
925
|
|
1990-10-04 |
Depth-Bounded Inference for Nonterminating Prologs |
Arimura, Hiroki |
793
|
|
1989-12-30 |
Completeness of Depth-Bounded Resolution for Weakly Reducing Programs |
Arimura, Hiroki |
910
|
