Sciweavers

6943 search results - page 804 / 1389
» Representations for evolutionary algorithms
Sort
View
CVPR
2009
IEEE
17 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICML
2005
IEEE
16 years 8 months ago
Supervised versus multiple instance learning: an empirical comparison
We empirically study the relationship between supervised and multiple instance (MI) learning. Algorithms to learn various concepts have been adapted to the MI representation. Howe...
Soumya Ray, Mark Craven
ICML
2004
IEEE
16 years 8 months ago
Convergence of synchronous reinforcement learning with linear function approximation
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
Artur Merke, Ralf Schoknecht
ICML
1998
IEEE
16 years 8 months ago
Learning Collaborative Information Filters
Predicting items a user would like on the basis of other users' ratings for these items has become a well-established strategy adopted by many recommendation services on the ...
Daniel Billsus, Michael J. Pazzani
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
16 years 7 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...