Sciweavers

23 search results - page 4 / 5
» Empirical analysis of generalization and learning in XCS wit...
Sort
View
CORR
2011
Springer
127views Education» more  CORR 2011»
12 years 9 months ago
Generalized Boosting Algorithms for Convex Optimization
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
Alexander Grubb, J. Andrew Bagnell
COLT
2006
Springer
13 years 9 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
SIGPRO
2008
151views more  SIGPRO 2008»
13 years 5 months ago
An adaptive penalized maximum likelihood algorithm
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
Guang Deng, Wai-Yin Ng
GIS
2009
ACM
13 years 9 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov
ML
2010
ACM
193views Machine Learning» more  ML 2010»
13 years 2 days ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...