Zobrazit minimální záznam



dc.contributor.authorKittler, Josef
dc.contributor.authorHatef, Mohamad
dc.contributor.authorDuin, Robert P.W.
dc.contributor.authorMatas, Jiří
dc.date.accessioned2012-06-05T12:22:45Z
dc.date.available2012-06-05T12:22:45Z
dc.date.issued1998-03
dc.identifier.citationJ. Kittler, M. Hatef, R.P.W Duin, and J. Matas. On combining classifiers. I.E.E.E. Transactions on Pattern Analysis and Machine Intelligence, 20(3):226 - 239, March 1998.cze
dc.identifier.urihttp://hdl.handle.net/10467/9443
dc.description.abstractWe develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental comparison of various classifier combination schemes demonstrates that the combination rule developed under the most restrictive assumptions-the sum rule-outperforms other classifier combinations schemes. A sensitivity analysis of the various schemes to estimation errors is carried out to show that this finding can be justified theoretically.eng
dc.language.isocescze
dc.publisherIEEEcze
dc.rights© 1998 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.eng
dc.subjectclassificationeng
dc.subjectclassifier combinationeng
dc.subjecterror sensitivityeng
dc.titleOn Combining Classifierscze
dc.typepříspěvek z konference - tištěnýcze
dc.identifier.doi10.1109/34.667881


Soubory tohoto záznamu



Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam