| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Makoto Iwayama Makoto Iwayama, Atsushi Fujii , Noriko Kando , Yuzo Marukawa : An empirical study on retrieval models for different document genres: patents and newspaper articles. SIGIR 2003 : 251-258 Akihiko Takano , Yoshiki Niwa , Shingo Nishioka , Toru Hisamitsu , Makoto Iwayama, Osamu Imaichi : Associative information access using DualNAVI. NLPRS 2001 : 771-772 Akihiko Takano , Yoshiki Niwa , Shingo Nishioka , Makoto Iwayama, Toru Hisamitsu , Osamu Imaichi , Hirofumi Sakurai : Associative Information Access Using DualNAVI. Kyoto International Conference on Digital Libraries 2000 : 285-289 Makoto Iwayama: Relevance reedback with a small number of relevance judgements: incremental relevance feedback vs. document clustering. SIGIR 2000 : 10-16 Akihiko Takano , Yoshiki Niwa , Shingo Nishioka , Makoto Iwayama, Toru Hisamitsu , Osamu Imaichi , Hirofumi Sakurai : Information Access Based on Associative Calculation. SOFSEM 2000 : 187-201 Takenobu Tokunaga , Makoto Iwayama, Hozumi Tanaka : Automatic Thesaurus Construction based on Grammatical Relations. IJCAI 1995 : 1308-1313 Makoto Iwayama, Takenobu Tokunaga : Hierarchical Bayesian Clustering for Automatic Text Classification. IJCAI 1995 : 1322-1327 Makoto Iwayama, Takenobu Tokunaga : Cluster-Based Text Categorization: A Comparison of Category Search Strategies. SIGIR 1995 : 273-280 Makoto Iwayama, Takenobu Tokunaga : A Probabilistic Model for Text Categorization: Based on a Single Random Variable with Multiple Values. ANLP 1994 : 162-167 Makoto Iwayama, Nitin Indurkhya , Hiroshi Motoda : A New Algorithm for Automatic Configuration of Hidden Markov Models. ALT 1993 : 237-250 Makoto Iwayama, Takenobu Tokunaga , Hozumi Tanaka : A Method of Calculating the Measure of Salience in Understanding Metaphors. AAAI 1990 : 298-303 Takenobu Tokunaga , Makoto Iwayama, Hozumi Tanaka , Tadashi Kamiwaki : LangLab: a natural language analysis system. COLING 1988 : 655-660 1 [ 12 ] 2 [ 8 ] [ 10 ] [ 11 ] 3 [ 8 ] [ 10 ] [ 11 ] 4 [ 3 ] 5 [ 1 ] 6 [ 12 ] 7 [ 12 ] 8 [ 3 ] 9 [ 8 ] [ 10 ] [ 11 ] 10 [ 8 ] [ 10 ] [ 11 ] 11 [ 8 ] [ 10 ] 12 [ 8 ] [ 10 ] [ 11 ] 13 [ 1 ] [ 2 ] [ 7 ] 14 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ]  ©2004 Association for Computing Machinery |
