Orthogonal Least Square with Boosting for Regression

نویسندگان

  • Sheng Chen
  • Xunxian Wang
  • David J. Brown
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Ensemble Strategies in Online NIR for Monitoring the Extraction Process of Pericarpium Citri Reticulatae Based on Different Variable Selections.

Different ensemble strategies were compared in online near-infrared models for monitoring active pharmaceutical ingredients of Traditional Chinese Medicine. Bagging partial least square regression and boosting partial least square regression were adopted to near-infrared models, to determine hesperidin and nobiletin content during the extraction process of Pericarpium Citri Reticulatae in a pil...

متن کامل

High-Dimensional $L_2$Boosting: Rate of Convergence

Boosting is one of the most significant developments in machine learning. This paper studies the rate of convergence of L2Boosting, which is tailored for regression, in a high-dimensional setting. Moreover, we introduce so-called “post-Boosting”. This is a post-selection estimator which applies ordinary least squares to the variables selected in the first stage by L2Boosting. Another variant is...

متن کامل

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem.  At each step of ALS algorithms two convex least square problems should be solved, which causes high com...

متن کامل

Tree Based Orthogonal Least Squares Regression with Repeated Weighted Boosting Search

Orthogonal Least Squares Regression (OLSR) selects each regressor by repeated weighted boosting search (RWBS). This kind of OLSR is known to be capable of producing a much sparser model than many other kernel methods. With the aid of tree structure search, this paper is to construct an even sparser regression model in the framework of OLSR with RWBS. When RWBS being used to solve the optimizati...

متن کامل

Kernel Regression Based Online Boosting Tracking

Although online boosting algorithm has received an increasing amount of interest in visual tracking, it is susceptible to class-label noise. Slight inaccuracies in the tracker can result in incorrectly labeled examples, which degrade the classifier and cause drift. This paper proposes a kernel regression based online boosting method for robust visual tracking. A nonlinear recursive least square...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004