Sciweavers

518 search results - page 47 / 104
» Object correspondence as a machine learning problem
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 2 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ICCV
2011
IEEE
14 years 2 months ago
Domain Adaptation for Object Recognition: An Unsupervised Approach
Adapting the classifier trained on a source domain to recognize instances from a new target domain is an important problem that is receiving recent attention. In this paper, we p...
Raghuraman Gopalan, Ruonan Li, Rama Chellappa
ICML
1989
IEEE
15 years 6 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
ALT
1999
Springer
15 years 6 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann
IJCNN
2007
IEEE
15 years 8 months ago
Analyzing the Fuzzy ARTMAP Matchtracking mechanism with Co-Objective Optimization Theory
— In the process of learning a pattern I, the Fuzzy ARTMAP algorithm templates (i.e., the weight vectors corresponding to nodes of its category representation layer) compete for ...
José Castro, Michael Georgiopoulos, Jimmy S...