Sciweavers

39 search results - page 7 / 8
» The Characterization of Classification Problems by Classifie...
Sort
View
162
Voted
ICML
2003
IEEE
16 years 1 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
93
Voted
ECCC
2006
145views more  ECCC 2006»
15 years 8 days ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
ICML
2003
IEEE
16 years 1 months ago
Learning on the Test Data: Leveraging Unseen Features
This paper addresses the problem of classification in situations where the data distribution is not homogeneous: Data instances might come from different locations or times, and t...
Benjamin Taskar, Ming Fai Wong, Daphne Koller
ECML
1987
Springer
15 years 3 months ago
Induction in Noisy Domains
This paper examines the induction of classification rules from examples using real-world data. Real-world data is almost always characterized by two features, which are important ...
Peter Clark, Tim Niblett
95
Voted
CVPR
2005
IEEE
16 years 2 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas