2878 search results - page 84 / 576 » Learning the Common Structure of Data |
122
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
123
Voted
NIPS
2008
15 years 4 months ago
2008
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
145
Voted
FGR
2004
IEEE
15 years 7 months ago
2004
IEEE
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
137
click to vote
AUSAI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
121
click to vote
JMLR
2010
14 years 10 months ago
2010
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...