Sciweavers

27 search results - page 3 / 6
» Kernel Partial Least Squares is Universally Consistent
Sort
View
APAL
2006
103views more  APAL 2006»
13 years 5 months ago
Canonical structure in the universe of set theory: part two
We prove a number of consistency results complementary to the ZFC results from our paper [4]. We produce examples of non-tightly stationary mutually stationary sequences, sequences...
James Cummings, Matthew Foreman, Menachem Magidor
RC
2007
128views more  RC 2007»
13 years 5 months ago
Bounds on Generalized Linear Predictors with Incomplete Outcome Data
This paper develops easily computed, tight bounds on Generalized Linear Predictors and instrumental variable estimators when outcome data are partially identi…ed. A salient exam...
Jörg Stoye
ESANN
2006
13 years 7 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
FOIS
2010
13 years 7 months ago
Revisiting the Ontological Square
Considerations regarding predication in ordinary language as well as the ontology of relations suggest a refinement of the Ontological Square, a conceptual scheme used in many foun...
Luc Schneider
MLG
2007
Springer
13 years 11 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich