Combining Pairwise Classifiers with Stacking.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F03%3A06030079" target="_blank" >RIV/67985807:_____/03:06030079 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Combining Pairwise Classifiers with Stacking.
Original language description
Pairwise classification is a technique that deals with multi-class problems by converting them into a series of binary problems, one for each pair of classes. The predictions of the binary classifiers are typically combined into an overall prediction byvoting and predicting the class that received the largest number of votes. In this paper we present a generalization of the voting procedure by replacing it with a trainable classifier (stacking). Experimental comparison of votig and stacking is presented.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Advances in Intelligent Data Analysis V.
ISBN
3-540-40813-4
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
219-229
Publisher name
Springer
Place of publication
Berlin
Event location
Berlin [DE]
Event date
Aug 28, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—