๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Attribute-Distributed Learning: Models, Limits, and Algorithms

โœ Scribed by Haipeng Zheng; Kulkarni, S.R.; Poor, H.V.

Book ID
119823708
Publisher
IEEE
Year
2011
Tongue
English
Weight
696 KB
Volume
59
Category
Article
ISSN
1053-587X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Attribute-Efficient Learning in Query an
Attribute-Efficient Learning in Query and Mistake-Bound Models
โœ Nader Bshouty; Lisa Hellerstein ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 351 KB

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

Learning mixtures of point distribution
Learning mixtures of point distribution models with the EM algorithm
โœ Abdullah A. Al-Shaher; Edwin R. Hancock ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 409 KB

This paper demonstrates how the EM algorithm can be used for learning and matching mixtures of point distribution models. We make two contributions. First, we show how shape-classes can be learned in an unsupervised manner. We present a fast procedure for training point distribution models using the