نتایج جستجو برای: weighted voting algorithm

تعداد نتایج: 847765  

1999
Winton Davies Pete Edwards

We introduce a novel instance selection method for combining multiple learned models. This technique results in a single comprehensible model. This is to be contrasted with current methods that typically combine models by voting. The core of the technique, the DAGGER (Disjoint Aggregation using Example Reduction) algorithm selects examples which provide evidence for each decision region within ...

2009
Martin Bujnak Zuzana Kukelova Tomás Pajdla

We propose a new robust focal length estimation method in multi-view structure from motion from unordered data sets, e.g. downloaded from the Flickr database, where jpeg-exif headers are often incorrect or missing. The method is based on a combination of RANSAC with weighted kernel voting and can use any algorithm for estimating epipolar geometry and unknown focal lengths. We demonstrate by exp...

1996
Leo Breiman

Recent work has shown that combining multiple versions of unstable classifiers such as trees or neural nets results in reduced test set error. To study this, the concepts of bias and variance of a classifier are defined. Unstable classifiers can have universally low bias. Their problem is high variance. Combining multiple versions is a variance reducing device. One of the most effective is bagg...

2008
Andrea Argentini Enrico Blanzieri

Wang in a PAMI paper proposed Neighborhood Counting Measure (NCM) as a similarity measure for the knearest neighbors classification algorithm. In his paper, Wang mentioned Minimum Risk Metric (MRM) an earlier method based on the minimization of the risk of misclassification. However, Wang did not compare NCM with MRM because of its allegedly excessive computational load. In this letter, we empi...

2000
Winton Davies Pete Edwards

We introduce a new technique for combining multiple learned models. This technique results in a single comprehensible model. This is to be contrasted with current methods that typically combine models by voting. The core of the technique, the DAGGER (Disjoint Aggregation using Example Reduction) algorithm selects examples which provide evidence for each decision region within each local model. ...

Journal: :Lecture Notes in Computer Science 2023

Abstract An election audit is risk-limiting if the limits (to a pre-specified threshold) chance that an erroneous electoral outcome will be certified. Extant methods for auditing instant-runoff voting (IRV) elections are either not or require cast vote records (CVRs), system’s electronic record of votes on each ballot. CVRs always available, instance, in jurisdictions tabulate IRV contests manu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید