Regularized partial least squares with an application to NMR spectroscopy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Regularized Least-Squares Classification

We consider the solution of binary classification problems via Tikhonov regularization in a Reproducing Kernel Hilbert Space using the square loss, and denote the resulting algorithm Regularized Least-Squares Classification (RLSC). We sketch the historical developments that led to this algorithm, and demonstrate empirically that its performance is equivalent to that of the well-known Support Ve...

متن کامل

Regularized Least Squares

{(xi, yi)}i=1 are the given data points, V (·) represents the loss function indicating the penalty we pay for predicting f(xi) when the true value is yi, and ‖f‖H is a Hilbert space norm regularization term with a regularization parameter λ which controls the stability of the solution and trades-off regression accuracy for a function with small norm in RKHS H. Denote by S the training set {(x1,...

متن کامل

An Introduction to Partial Least Squares Regression

Partial least squares is a popular method for soft modelling in industrial applications. This paper introduces the basic concepts and illustrates them with a chemometric example. An appendix describes the experimental PLS procedure of SAS/STAT software.

متن کامل

Efficient AUC Maximization with Regularized Least-Squares

Area under the receiver operating characteristics curve (AUC) is a popular measure for evaluating the quality of binary classifiers, and intuitively, machine learning algorithms that maximize an approximation of AUC should have a good AUC performance when classifying new examples. However, designing such algorithms in the framework of kernel methods has proven to be challenging. In this paper, ...

متن کامل

Distributed Learning with Regularized Least Squares

We study distributed learning with the least squares regularization scheme in a reproducing kernel Hilbert space (RKHS). By a divide-and-conquer approach, the algorithm partitions a data set into disjoint data subsets, applies the least squares regularization scheme to each data subset to produce an output function, and then takes an average of the individual output functions as a final global ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Statistical Analysis and Data Mining: The ASA Data Science Journal

سال: 2012

ISSN: 1932-1864

DOI: 10.1002/sam.11169