Nobuhiro Yugami

Learn More
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first generates an initial assignment, then repairs it by minimizing the number of conflicts. Min-conflicts hill climbing (MCHC) and GSAT are typical examples of this approach. A serious(More)
In this paper, we propose a new framework for product configuration that integrates a constraint satisfaction problem with case-based reasoning (CBR), and this framework is applied to an on-line sales system. Given a user query, CBR first retrieves similar cases from the case base in which past successful configurations are stored. Then, it formalizes(More)
This paper presents average-case analyses of instance-based learning algorithms. The algorithms analyzed employ a variant of k-nearest neighbor classi-er (k-NN). Our analysis deals with a monotone m-of-n target concept with irrelevant attributes, and handles three types of noise: relevant attribute noise, irrelevant attribute noise, and class noise. We(More)
This paper presents an average-case analysis of the fc-nearest neighbor classifier (k-NN). Our analysis deals with m-of-n// concepts, and handles three types of noise: relevant attribute noise, irrelevant attribute noise, and class noise. We formally compute the expected classification accuracy of fc-NN after a certain fixed number of training instances.(More)