Sciweavers

502 search results - page 28 / 101
» Learning from General Label Constraints
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Online Learning Asymmetric Boosted Classifiers for Object Detection
We present an integrated framework for learning asymmetric boosted classifiers and online learning to address the problem of online learning asymmetric boosted classifiers, which ...
Minh-Tri Pham, Tat-Jen Cham
ALT
2009
Springer
14 years 5 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
CP
2000
Springer
14 years 11 days ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
SIGIR
2008
ACM
13 years 8 months ago
Semi-supervised spam filtering: does it work?
The results of the 2006 ECML/PKDD Discovery Challenge suggest that semi-supervised learning methods work well for spam filtering when the source of available labeled examples diff...
Mona Mojdeh, Gordon V. Cormack
ICML
2007
IEEE
14 years 9 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner