Sciweavers

2750 search results - page 129 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
CI
2002
92views more  CI 2002»
15 years 6 months ago
Model Selection in an Information Economy: Choosing What to Learn
As online markets for the exchange of goods and services become more common, the study of markets composed at least in part of autonomous agents has taken on increasing importance...
Christopher H. Brooks, Robert S. Gazzale, Rajarshi...
SAC
2006
ACM
16 years 9 days ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
ICML
2008
IEEE
16 years 7 months ago
An RKHS for multi-view learning and manifold co-regularization
Inspired by co-training, many multi-view semi-supervised kernel methods implement the following idea: find a function in each of multiple Reproducing Kernel Hilbert Spaces (RKHSs)...
Vikas Sindhwani, David S. Rosenberg
ELPUB
2007
ACM
15 years 10 months ago
Designing Metadata Surrogates for Search Result Interfaces of Learning Object Repositories: Linear versus Clustered Metadata Des
This study reports the findings of a usability test conducted to examine users' interaction with two different learning object metadata-driven search result interfaces. The f...
Panos Balatsoukas, Anne Morris, Ann O'Brien
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio