Sciweavers

3221 search results - page 596 / 645
» Termination of Linear Programs
Sort
View
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 6 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
BMCBI
2007
110views more  BMCBI 2007»
15 years 6 months ago
Selection of long oligonucleotides for gene expression microarrays using weighted rank-sum strategy
Background: The design of long oligonucleotides for spotted DNA microarrays requires detailed attention to ensure their optimal performance in the hybridization process. The main ...
Guangan Hu, Manuel Llinás, Jingguang Li, Pe...
JMLR
2008
168views more  JMLR 2008»
15 years 6 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
NN
2008
Springer
152views Neural Networks» more  NN 2008»
15 years 6 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
15 years 5 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka