Sciweavers

1651 search results - page 18 / 331
» Measuring the Complexity of Classification Problems
Sort
View
HEURISTICS
2007
103views more  HEURISTICS 2007»
13 years 7 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen
DAGSTUHL
2004
13 years 9 months ago
Learning with Local Models
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
Stefan Rüping
CVPR
2005
IEEE
14 years 9 months ago
Learning Feature Distance Measures for Image Correspondences
Standard but ad hoc measures such as sum-of-squared pixel differences (SSD) are often used when comparing and registering two images that have not been previously observed before....
Xi Chen, Tat-Jen Cham
CVPR
2009
IEEE
15 years 2 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...
FOCM
2008
76views more  FOCM 2008»
13 years 7 months ago
On Smale's 17th Problem: A Probabilistic Positive Solution
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
Carlos Beltrán, Luis Miguel Pardo