| 2012 | ||
|---|---|---|
| c11 | Koji Maruhashi, Junichi Shigezumi, Nobuhiro Yugami, Christos Faloutsos: EigenSP: A More Accurate Shortest Path Distance Estimation on Large-Scale Networks. ICDM Workshops 2012: 234-241 | |
| 2003 | ||
| j1 | Seishi Okamoto, Nobuhiro Yugami: Effects of domain characteristics on instance-based learning algorithms. Theor. Comput. Sci. 1(298): 207-233 (2003) | |
| c10 | Yukiko Yoshida, Yuiko Ohta, Kenichi Kobayashi, Nobuhiro Yugami: Mining Interesting Patterns Using Estimated Frequencies from Subpatterns and Superpatterns. Discovery Science 2003: 494-501 | |
| 2000 | ||
| c9 | ||
| c8 | Seishi Okamoto, Nobuhiro Yugami: Generalized Average-Case Analyses of the Nearest Neighbor Algorithm. ICML 2000: 695-702 | |
| c7 | ||
| 1998 | ||
| c6 | Nobuhiro Yugami, Yuiko Ohta, Seishi Okamoto: Instance Guided Rule Induction. Discovery Science 1998: 210-219 | |
| 1997 | ||
| c5 | Seishi Okamoto, Nobuhiro Yugami: Theoretical Analysis of Case Retrieval Method Based on Neighborhood of a New Problem. ICCBR 1997: 349-358 | |
| c4 | Seishi Okamoto, Nobuhiro Yugami: An Average-Case Analysis of the k-Nearest Neighbar Classifier for Noisy Domains. IJCAI (1) 1997: 238-245 | |
| 1996 | ||
| c3 | Seishi Okamoto, Nobuhiro Yugami: Theoretical Analysis of the Nearest Neighbor Classifier in Noisy Domains. ICML 1996: 355-363 | |
| 1995 | ||
| c2 | Nobuhiro Yugami: Theoretical Analysis of Davis-Putnam Procedure and Propositional Satisfiability. IJCAI 1995: 282-288 | |
| 1994 | ||
| c1 | Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara: Improving Repair-Based Constraint Satisfaction Methods by Value Propagation. AAAI 1994: 344-349 | |
| 1 | Christos Faloutsos | |
| 2 | Hirotaka Hara | |
| 3 | Kenichi Kobayashi | |
| 4 | Koji Maruhashi | |
| 5 | Yuiko Ohta | |
| 6 | Seishi Okamoto | |
| 7 | Junichi Shigezumi | |
| 8 | Yukiko Yoshida |
Colors in the list of coauthors
Last update Tue May 21 09:34:13 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page