Sciweavers

901 search results - page 58 / 181
» Analyzing linear mergers
Sort
View
CDC
2009
IEEE
180views Control Systems» more  CDC 2009»
15 years 2 months ago
Robustness analysis for Least Squares kernel based regression: an optimization approach
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
Tillmann Falck, Johan A. K. Suykens, Bart De Moor
FLAIRS
2010
15 years 1 months ago
Generalized Non-impeding Noisy-AND Trees
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs assessed for each node. Its complexity is generally expon...
Yang Xiang
ESANN
2001
15 years 17 days ago
Input data reduction for the prediction of financial time series
Prediction of financial time series using artificial neural networks has been the subject of many publications, even if the predictability of financial series remains a subject of ...
Amaury Lendasse, John Aldo Lee, Eric de Bodt, Vinc...
ICML
2010
IEEE
15 years 8 days ago
Efficient Learning with Partially Observed Attributes
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the ca...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 11 months ago
Online Identification and Tracking of Subspaces from Highly Incomplete Information
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
Laura Balzano, Robert Nowak, Benjamin Recht