Sciweavers

11160 search results - page 166 / 2232
» Incompleteness in a General Setting
Sort
View
JCSS
2007
85views more  JCSS 2007»
15 years 21 days ago
A general dimension for query learning
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
José L. Balcázar, Jorge Castro, Davi...
ML
2002
ACM
133views Machine Learning» more  ML 2002»
15 years 14 days ago
Estimating Generalization Error on Two-Class Datasets Using Out-of-Bag Estimates
For two-class datasets, we provide a method for estimating the generalization error of a bag using out-of-bag estimates. In bagging, each predictor (single hypothesis) is learned ...
Tom Bylander
100
Voted
PVLDB
2010
93views more  PVLDB 2010»
14 years 11 months ago
Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation
The goal of a threshold query is to detect all objects whose score exceeds a given threshold. This type of query is used in many settings, such as data mining, event triggering, a...
Guy Sagy, Daniel Keren, Izchak Sharfman, Assaf Sch...
134
Voted
EJC
2011
14 years 7 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
145
Voted
TIT
2011
209views more  TIT 2011»
14 years 7 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...