Sciweavers

3050 search results - page 94 / 610
» On-line Algorithms in Machine Learning
Sort
View
COLT
2007
Springer
16 years 11 days ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
ICCS
1993
Springer
15 years 10 months ago
Towards Domain-Independent Machine Intelligence
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
Robert Levinson
ICML
2005
IEEE
16 years 7 months ago
Hedged learning: regret-minimization with learning experts
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...
Yu-Han Chang, Leslie Pack Kaelbling
PAKDD
2011
ACM
253views Data Mining» more  PAKDD 2011»
14 years 9 months ago
Balance Support Vector Machines Locally Using the Structural Similarity Kernel
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
Jianxin Wu
MLDM
2007
Springer
16 years 10 days ago
Nonlinear Feature Selection by Relevance Feature Vector Machine
Support vector machine (SVM) has received much attention in feature selection recently because of its ability to incorporate kernels to discover nonlinear dependencies between feat...
Haibin Cheng, Haifeng Chen, Guofei Jiang, Kenji Yo...