| 2003 |
|---|
| 11 | EE | Yukiko Yoshida,
Yuiko Ohta,
Kenichi Kobayashi,
Nobuhiro Yugami:
Mining Interesting Patterns Using Estimated Frequencies from Subpatterns and Superpatterns.
Discovery Science 2003: 494-501 |
| 10 | EE | Seishi Okamoto,
Nobuhiro Yugami:
Effects of domain characteristics on instance-based learning algorithms.
Theor. Comput. Sci. 1(298): 207-233 (2003) |
| 2000 |
|---|
| 9 | EE | Nobuhiro Yugami:
Discovery of M-of-N Concepts for Classification.
Discovery Science 2000: 278-281 |
| 8 | | Seishi Okamoto,
Nobuhiro Yugami:
Generalized Average-Case Analyses of the Nearest Neighbor Algorithm.
ICML 2000: 695-702 |
| 7 | | Nobuhiro Yugami,
Yuiko Ohta,
Seishi Okamoto:
Fast Discovery of Interesting Rules.
PAKDD 2000: 17-28 |
| 1998 |
|---|
| 6 | EE | Nobuhiro Yugami,
Yuiko Ohta,
Seishi Okamoto:
Instance Guided Rule Induction.
Discovery Science 1998: 210-219 |
| 1997 |
|---|
| 5 | | Seishi Okamoto,
Nobuhiro Yugami:
Theoretical Analysis of Case Retrieval Method Based on Neighborhood of a New Problem.
ICCBR 1997: 349-358 |
| 4 | | Seishi Okamoto,
Nobuhiro Yugami:
An Average-Case Analysis of the k-Nearest Neighbar Classifier for Noisy Domains.
IJCAI (1) 1997: 238-245 |
| 1996 |
|---|
| 3 | | Seishi Okamoto,
Nobuhiro Yugami:
Theoretical Analysis of the Nearest Neighbor Classifier in Noisy Domains.
ICML 1996: 355-363 |
| 1995 |
|---|
| 2 | | Nobuhiro Yugami:
Theoretical Analysis of Davis-Putnam Procedure and Propositional Satisfiability.
IJCAI 1995: 282-288 |
| 1994 |
|---|
| 1 | | Nobuhiro Yugami,
Yuiko Ohta,
Hirotaka Hara:
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation.
AAAI 1994: 344-349 |
