- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Note on Concept Learning with Membership Queries (in Japanese) |
|---|---|
| Authors | Yoshifumi Ukita 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 1996 |
| Format | International Conference |
| Category | Knowledge information processing |
| Jounal Name | Proceedings of International Symposium on Information Theory and Its Applications (Canada) |
| Jounal Page | pp.308-311, Victoria, Canada |
| Published Year | 1996 |
| Published Month | 9 |
| Abstract （English） |
In this paper, a new model of learning from queries is proposed. First, the two criteria to evaluate learning algorithms under a limited number of queries are newly proposed. Next, a tight bound of these criteria is derived when the branch-and-bound algorithm is applied to construct an optimal learning strategy, i.e., a presentation order for the instances. Moreover, it is shown that a learning strategy can be selected more efficiently in the case that the instance space of the concept class satisfies symmetric property such as monotone monomials. Consequently, the algorithm using the derived bound and the symmetric property of the instance space can extremely reduce the search complexity to select the optimal learning strategy for each criterion. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
