Results 1  10
of
129
Query by Committee
, 1992
"... We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal disagreement. The algorithm is studied for two toy models: the highlow game and perceptron learning of another perceptr ..."
Abstract

Cited by 432 (3 self)
 Add to MetaCart
We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal disagreement. The algorithm is studied for two toy models: the highlow game and perceptron learning of another
Correlation Clustering
 MACHINE LEARNING
, 2002
"... We consider the following clustering problem: we have a complete graph on # vertices (items), where each edge ### ## is labeled either # or depending on whether # and # have been deemed to be similar or different. The goal is to produce a partition of the vertices (a clustering) that agrees as mu ..."
Abstract

Cited by 332 (4 self)
 Add to MetaCart
as much as possible with the edge labels. That is, we want a clustering that maximizes the number of # edges within clusters, plus the number of edges between clusters (equivalently, minimizes the number of disagreements: the number of edges inside clusters plus the number of # edges between
Employing EM in PoolBased Active Learning for Text Classification
, 1998
"... This paper shows how a text classifier's need for labeled training data can be reduced by a combination of active learning and Expectation Maximization (EM) on a pool of unlabeled data. QuerybyCommittee is used to actively select documents for labeling, then EM with a naive Bayes model furthe ..."
Abstract

Cited by 320 (10 self)
 Add to MetaCart
This paper shows how a text classifier's need for labeled training data can be reduced by a combination of active learning and Expectation Maximization (EM) on a pool of unlabeled data. QuerybyCommittee is used to actively select documents for labeling, then EM with a naive Bayes model
On Disagreement Percolation and Maximality of the Critical Value for Iid Percolation
, 2000
"... Two dierent problems are studied: (1) For an innite locally nite connected graph G, let p c (G) be the critical value for the existence of an ininte cluster in iid bond percolation on G and let P c = supfp c (G) : G transitive; p c (G) < 1g. Is P c < 1? (2) Let G be transitive with p c (G) < ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Two dierent problems are studied: (1) For an innite locally nite connected graph G, let p c (G) be the critical value for the existence of an ininte cluster in iid bond percolation on G and let P c = supfp c (G) : G transitive; p c (G) < 1g. Is P c < 1? (2) Let G be transitive with p c (G) < 1, let p 2 [0; 1] and let X and Y be iid bond percolations on G with retention parameters (1 + p)=2 and (1 p)=2 respectively. Is there a q < 1 such that p > q implies that for any monotone coupling ( ^ X ; ^ Y ) of X and Y the edges for which ^ X and ^ Y disagree form innite connected component(s) with positive probability? Let p d (G) be the inmum of such q's (including q = 1) and let P d = supfp d (G) : G transitive; p c (G) < 1g. Is the stronger statement P d < 1 true? On the other hand: Is it always true that p d (G) > p c (G)? It is shown that if one restricts attention to biregular planar graphs G then these two problems can be treated in a similar way and all the above questions are ...
Bargaining without Disagreement
 University of Helsinki
, 2003
"... We identify weakenings of the independence axiom of Nash (1950) to derive a solution without disagreement point. The idea is to determine disagreement points simultaneously with the solutions, and as a function of the utility space only. Our version of the Nash solution maximizes the Nash product w. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We identify weakenings of the independence axiom of Nash (1950) to derive a solution without disagreement point. The idea is to determine disagreement points simultaneously with the solutions, and as a function of the utility space only. Our version of the Nash solution maximizes the Nash product w
Gender Differences in Realization Patterns of Disagreement in Chinese
"... Abstract Studies on gender differences in realization patterns of disagreement in Chinese context, by so far, have been found insufficient. Disagreement is a commonly–occurred speech act in everyday human interactions and by its very nature is a facethreatening act that harms the solidarity betwee ..."
Abstract
 Add to MetaCart
Abstract Studies on gender differences in realization patterns of disagreement in Chinese context, by so far, have been found insufficient. Disagreement is a commonly–occurred speech act in everyday human interactions and by its very nature is a facethreatening act that harms the solidarity
Optimal Hardness Results for Maximizing . . .
"... We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by learning of monomials in the agnostic framework of Haussler [12] and Kearns et al. [17]. Finding a monomial with the highes ..."
Abstract
 Add to MetaCart
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by learning of monomials in the agnostic framework of Haussler [12] and Kearns et al. [17]. Finding a monomial
The Disagreement between AnisotropicIsotropic Diffuse Solar Radiation Models as a Function of Solar Declination: Computing the Optimum Tilt Angle
 of Solar Panels in the Area of SouthernItaly”, Smart Grid and Renewable Energy
"... In this paper a simulation to maximize the global solar radiation on a sloped collecting surface was applied to typical latitudes in the area of southern Italy, to calculate the optimum tilt angle of solar panels on building structures or large photovoltaic power plants located in that geographical ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper a simulation to maximize the global solar radiation on a sloped collecting surface was applied to typical latitudes in the area of southern Italy, to calculate the optimum tilt angle of solar panels on building structures or large photovoltaic power plants located in that geographical
Nutrition to Maximize Production of the High Producing Sow
"... When designing a feeding program for gestating sows, we must remember the overall goals for the nutrition program: 1) prepare sows to be in proper body condition at farrowing; 2) maximize reproductive performance (farrowing rate and litter size); and 3) meet the daily nutrient requirements at the lo ..."
Abstract
 Add to MetaCart
When designing a feeding program for gestating sows, we must remember the overall goals for the nutrition program: 1) prepare sows to be in proper body condition at farrowing; 2) maximize reproductive performance (farrowing rate and litter size); and 3) meet the daily nutrient requirements
Ground Truth Estimation by Maximizing Topological Agreements in Electron Microscopy Data
"... Abstract. Manual editing can correct segmentation errors produced by automated segmentation algorithms, but it also introduces a practical challenge: the combination of multiple users ’ annotations of an image to obtain an estimation of the true, unknown labeling. Current estimation methods are not ..."
Abstract
 Add to MetaCart
seeks an estimated segmentation that is topologically equivalent and geometrically similar to the true, unknown segmentation. To this end, utilizing warping error as the evaluation metric, which measures topological disagreements between segmentations, the algorithm iteratively modifies the topology
Results 1  10
of
129