288 search results - page 34 / 58 » Bayesian Learning of Sparse Classifiers |
UMUAI
1998
13 years 7 months ago
1998
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
VLSISP
2010
13 years 6 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
ISDA
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we compared the performance of the Automatic Data Reduction System (ADRS) and principal component analysis (PCA) as a preprocessor to artificial neural networks (ANN...
MCS
2000
Springer
13 years 11 months ago
2000
Springer
Ensemble methods are learning algorithms that construct a set of classi ers and then classify new data points by taking a (weighted) vote of their predictions. The original ensembl...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
CoIL challenge 2000 was a supervised learning contest that attracted 43 entries. The authors of 29 entries later wrote explanations of their work. This paper discusses these repor...