Sciweavers

1707 search results - page 230 / 342
» A Boosting Algorithm for Regression
Sort
View
ICML
2009
IEEE
16 years 4 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
177
Voted
ICML
2000
IEEE
16 years 4 months ago
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...
Mark A. Hall
RECSYS
2009
ACM
15 years 8 months ago
Effective diverse and obfuscated attacks on model-based recommender systems
Robustness analysis research has shown that conventional memory-based recommender systems are very susceptible to malicious profile-injection attacks. A number of attack models h...
Zunping Cheng, Neil Hurley
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 3 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
TIP
2008
113views more  TIP 2008»
15 years 3 months ago
Phase Local Approximation (PhaseLa) Technique for Phase Unwrap From Noisy Data
The local polynomial approximation (LPA) is a nonparametric regression technique with pointwise estimation in a sliding window. We apply the LPA of the argument of cos and sin in o...
Vladimir Katkovnik, Jaakko Astola, Karen O. Egiaza...