Sciweavers

12194 search results - page 234 / 2439
» Numberings Optimal for Learning
Sort
View
KAIS
2010
80views more  KAIS 2010»
15 years 5 months ago
Semi-supervised learning by disagreement
In many real-world tasks there are abundant unlabeled examples but the number of labeled training examples is limited, because labeling the examples requires human efforts and exp...
Zhi-Hua Zhou, Ming Li
IJCNN
2006
IEEE
16 years 17 days ago
A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
Eu Jin Teoh, Huajin Tang, Kay Chen Tan
ALT
2010
Springer
15 years 8 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett
PR
2010
163views more  PR 2010»
15 years 5 months ago
Optimal feature selection for support vector machines
Selecting relevant features for Support Vector Machine (SVM) classifiers is important for a variety of reasons such as generalization performance, computational efficiency, and ...
Minh Hoai Nguyen, Fernando De la Torre
SEAL
2010
Springer
15 years 4 months ago
Dominance-Based Pareto-Surrogate for Multi-Objective Optimization
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
Ilya Loshchilov, Marc Schoenauer, Michèle S...