Sciweavers

4591 search results - page 354 / 919
» Learning from Dyadic Data
Sort
View
ICCV
2007
IEEE
16 years 8 months ago
Classification of Weakly-Labeled Data with Partial Equivalence Relations
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Sanjiv Kumar, Henry A. Rowley
COLT
2005
Springer
16 years 11 days ago
Variations on U-Shaped Learning
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements t...
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Fra...
ATAL
2007
Springer
16 years 1 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
16 years 7 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang
ECCV
2010
Springer
15 years 9 months ago
Clustering Complex Data with Group-Dependent Feature Selection
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...