An Optimization Perspective on Kernel Partial Least Squares Regression
Published 1 January 2003
Kristin P. Bennett
Citations78
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Borate buffer was found to have both structural and functional roles within a low-cost tri-copper electrocatalyst for homogeneous water oxidation that exhibits a high turnover frequency of 310 s-1 . The borate buffer was shown to facilitate the catalytic activity by both bridging the three Cu ions and participating in O-O bond formation. Phosphate and acetate buffers did not show such roles, making borate a unique player in this catalytic system.
Keywords
ChemistryComputer ScienceBiochemistry, Genetics and Molecular Biology
The Nature of Statistical Learning Theory
39,279 Citations1995Vladimir Vapnik
Cambridge University Press eBooksAn Introduction to Support Vector Machines and Other Kernel-based Learning Methods
13,883 Citations2000Nello Cristianini, John Shawe‐Taylor
Chemometrics and Intelligent Laboratory SystemsPLS-regression: a basic tool of chemometrics
9,660 Citations2001Svante Wold, Michael Sjöstróm +1 more
The MIT Press eBooksLearning with Kernels
9,548 Citations2001Bernhard Schölkopf, Alexander J. Smola
Learning with Kernels provides an introduction to SVMs and related kernel methods that provide all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms.
Neural Processing LettersLeast Squares Support Vector Machine Classifiers
9,375 Citations1999Johan A. K. Suykens, Joos Vandewalle
A least squares version for support vector machine (SVM) classifiers that follows from solving a set of linear equations, instead of quadratic programming for classical SVM's.
Neural ComputationNonlinear Component Analysis as a Kernel Eigenvalue Problem
8,078 Citations1998Bernhard Schölkopf, Alexander J. Smola +1 more
A new method for performing a nonlinear form of principal component analysis by the use of integral operator kernel functions is proposed and experimental results on polynomial feature extraction for pattern recognition are presented.
TechnometricsRidge Regression: Biased Estimation for Nonorthogonal Problems
6,562 Citations2000Arthur E. Hoerl, Robert W. Kennard
Mathematics and Computers in SimulationLinear and nonlinear programming.
4,850 Citations1986
The linear and nonlinear programming is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can download it instantly.
Neural NetworksA scaled conjugate gradient algorithm for fast supervised learning
4,028 Citations1993Martin F. Møller
Experiments show that SCG is considerably faster than BP, CGL, and BFGS, and avoids a time consuming line search.
Journal of Molecular Graphics and ModellingBeware of q2!
3,688 Citations2002Alexander Golbraikh, Alexander Tropsha
It is argued that the high value of LOO q2 appears to be the necessary but not the sufficient condition for the model to have a high predictive power, which is the general property of QSAR models developed using LOO cross-validation.
TechnometricsCross-Validatory Estimation of the Number of Components in Factor and Principal Components Models
2,496 Citations1978Svante Wold
Medical Entomology and ZoologySoft modelling: The Basic Design and Some Extensions
1,266 Citations1982Herman Wold
Advances in Computational MathematicsRegularization Networks and Support Vector Machines
1,223 Citations2000Theodoros Evgeniou, Massimiliano Pontil +1 more
Both formulations of regularization and Support Vector Machines are reviewed in the context of Vapnik's theory of statistical learning which provides a general foundation for the learning problem, combining functional analysis and statistics.
IEEE Transactions on Neural NetworksInput space versus feature space in kernel-based methods
1,166 Citations1999Bernhard Schölkopf, Mika Sirén +5 more
The geometry of feature space is reviewed, and the connection between feature space and input space is discussed by dealing with the question of how one can, given some vector in feature space, find a preimage in input space.
Journal of Machine Learning ResearchKernel partial least squares regression in reproducing kernel hilbert space
884 Citations2002Roman Rosipal, Leonard J. Trejo
The theoretical description of the kernel PLS algorithm is given and the algorithm is experimentally compared with the existing kernel PCR and kernel ridge regression techniques to demonstrate that on the data sets employed Kernel PLS achieves the same results as kernel PCR but uses significantly fewer, qualitatively different components.
Proximal support vector machine classifiers
844 Citations2001Glenn Fung, O. L. Mangasarian
Computational results on publicly available datasets indicate that the proposed proximal SVM classifier has comparable test set correctness to that of standard S VM classifiers, but with considerably faster computational time that can be an order of magnitude faster.
RSVM: Reduced Support Vector Machines
644 Citations2001Yuh‐Jye Lee, O. L. Mangasarian
Computational results indicate that test set correctness for the reduced support vector machine (RSVM), with a nonlinear separating surface that depends on a small randomly selected portion of the dataset, is better than that of a conventional support vectors machine (SVM) with aNonlinear surface that explicitly depends on the entire dataset, and much better than a conventional SVM using a small random sample of the data.
Efficient svm training using low-rank kernel representations
595 Citations2002Shai Fine, Katya Scheinberg
This work shows that for a low rank kernel matrix it is possible to design a better interior point method (IPM) in terms of storage requirements as well as computational complexity and derives an upper bound on the change in the objective function value based on the approximation error and the number of active constraints (support vectors).
Chemometrics and Intelligent Laboratory SystemsNonlinear partial least squares modelling II. Spline inner relation
275 Citations1992Svante Wold
A PLS model with a nonlinear inner relation is presented in a general form with a spline function for inner relation and the estimation algorithm is consistent with Hoskuldsson's PLS principles.
IEEE Transactions on Neural NetworksReduced Support Vector Machines: A Statistical Theory
271 Citations2007Yuh‐Jye Lee, Su‐Yun Huang
This paper study the RSVM from the viewpoint of sampling design, its robustness, and the spectral analysis of the reduced kernel, which indicates that the approximation kernels can retain most of the relevant information for learning tasks in the full kernel.
Journal of Medicinal ChemistryCheminformatic Models To Predict Binding Affinities to Human Serum Albumin
255 Citations2001Gonzalo Colmenarejo, Ana Isabel Álvarez-Pedraglio +1 more
Binding to HSA turns out to be determined by a combination of hydrophobic forces together with some modulating shape factors, which agrees with X-ray structures of HSA alone or bound to ligands.
IEEE Transactions on Neural NetworksA study on reduced support vector machines
247 Citations2003Kuan-Ming Lin, Chih‐Jen Lin
It is shown that the RSVM formulation is already in a form of linear SVM and four RSVM implementations are discussed, which indicates that in general the test accuracy of RSVM are a little lower than that of the standard SVM.
Computers & Chemical EngineeringNon-linear projection to latent structures revisited: the quadratic PLS algorithm
184 Citations1999G. Baffi, E.B. Martin +1 more
The traditional linear PLS algorithm and the non-linear (quadratic) PLS approach of Wold are reviewed, prior to introducing a number of modifications into theNon-linear quadratic algorithm to improve its performance when handling highly non- linear data.
IEEE Transactions on Neural NetworksData strip mining for the virtual design of pharmaceuticals with neural networks
146 Citations2000Robert Kewley, Mark J. Embrechts +1 more
Elimination of variables through neural network sensitivity analysis and predicting performance through model cross-validation allows the analyst to reduce the number of inputs and improve the model's predictive ability at the same time.
American Mathematical MonthlyThe Idea Behind Krylov Methods
140 Citations1998Ilse C. F. Ipsen, Carl D. Meyer
It is shown that eigenvalues play a central role when it comes to ensuring existence and uniqueness of Krylov solutions; they are not merely an artifact of convergence analyses.
Chemometrics and Intelligent Laboratory SystemsThe kernel PCA algorithms for wide data. Part I: Theory and algorithms
114 Citations1997W. Wu, D.L. Massart +1 more
A Matlab PCA program which efficiently deals with all kinds of data sets was developed and it is recommended to use the kernel EVD for wide data sets whether all PCs or only the first few are required.
Journal of ChemometricsINLR, implicit non-linear latent variable regression
110 Citations1997Anders Berglund, Svante Wold
If a latent structure is present in X, it is not necessary to include the cross terms of the X‐variables in the polynomial expansion, and expanding X with cubic terms x3a is sufficient.
Support Vector Machines for Large-Scale Regression Problems
105 Citations2000Ronan Collobert, Samy Bengio
International Journal of Computer VisionStatistical Learning Theory: A Primer
82 Citations2000Theodoros Evgeniou, Massimiliano Pontil +1 more
Chemometrics and Intelligent Laboratory SystemsKernel-PCA algorithms for wide data Part II: Fast cross-validation and application in classification of NIR data
55 Citations1997Wen Wu, D.L. Massart +1 more
Four PCA algorithms, namely NIPALS, the power method (POWER), singular value decomposition (SVD) and eigenvalue decomposing (EVD), and their kernel versions are systematically applied to three NIR data sets from the pharmaceutical industry.
Lecture notes in computer scienceScalable Kernel Systems
6 Citations2001Volker Tresp, Anton Schwaighofer
This paper investigates the relationship between three approximate methods for scaling kernel-based systems to large data sets and compares their performances experimentally.