We consider the problem of attribute-efficient learning in query and mistake-bound models. Attribute-efficient algorithms make a number of queries or mistakes that is polynomial in the number of relevant variables in the target function, but only sublinear in the number of irrelevant variables. We c
Attribute theory in learning systems
β Scribed by Zhongzhi Shi; Jianchao Han
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 328 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0167-739X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The authors present a rationale for incorporating serviceβlearning projects into courses that teach family systems theory. A model program is presented to provide an example of the objectives, practical considerations, and student responses to such a project. Recommendations for counselor educators
Zeleny's recent conjecture that multi-attribute decision theory may help to overcome the inadequacies of the linear regression model is incorrect. Recognition of the information processing advantages inherent in multiple-attribute decision situations combined with a requirement of transitivity itsel
This paper addresses the problem of learning boolean functions in query and mistake-bound models in the presence of irrelevant attributes. In learning a concept, a learner may observe a great many more attributes than those that the concept depends upon, and in some sense the presence of extra, irre