Sciweavers

3668 search results - page 433 / 734
» Margin Distribution and Learning
Sort
View
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 7 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
ICML
2007
IEEE
16 years 7 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
ICML
2008
IEEE
16 years 7 months ago
A distance model for rhythms
Modeling long-term dependencies in time series has proved very difficult to achieve with traditional machine learning methods. This problem occurs when considering music data. In ...
Douglas Eck, Jean-François Paiement, Samy B...
ICML
2006
IEEE
16 years 7 months ago
Locally adaptive classification piloted by uncertainty
Locally adaptive classifiers are usually superior to the use of a single global classifier. However, there are two major problems in designing locally adaptive classifiers. First,...
Juan Dai, Shuicheng Yan, Xiaoou Tang, James T. Kwo...
ALT
2006
Springer
16 years 3 months ago
Smooth Boosting Using an Information-Based Criterion
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
Kohei Hatano