Sciweavers

1034 search results - page 131 / 207
» A Bayesian Metric for Evaluating Machine Learning Algorithms
Sort
View
RECOMB
2003
Springer
16 years 25 days ago
Modeling dependencies in protein-DNA binding sites
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kap...
CVPR
2012
IEEE
13 years 3 months ago
Weakly supervised structured output learning for semantic segmentation
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
Alexander Vezhnevets, Vittorio Ferrari, Joachim M....
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
14 years 10 months ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...
COLT
1999
Springer
15 years 4 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
122
Voted
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 6 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...