返回
Pairwise fusion matrix for combining classifiers
DOI:10.1016/j.patcog.2007.01.031.png)
摘要
En 中文
Various fusion functions for classifier combination have been designed to optimize the results of ensembles of classifiers (EoC). We propose a pairwise fusion matrix (PFM) transformation, which produces reliable probabilities for the use of classifier combination and can be amalgamated with most existent fusion functions for combining classifiers. The PFM requires only crisp class label outputs from classifiers, and is suitable for high-class problems or problems with few training samples. Experimental results suggest that the performance of a PFM can be a notch above that of the simple majority voting rule (MAJ), and a PFM can work on problems where a behavior-knowledge space (BKS) might not be applicable. (C) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
fusion function
combining classifiers
confusion matrix
pattern recognition
majority voting
ensemble of learning machines
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
Bridging the Mechanical and the Human Mind: Spontaneous Mimicry of a Physically Present Android
PLoS ONE
IF0
Adaptive Impedance Control to Enhance Human Skill on a Haptic Interface System自适应阻抗控制以增强触觉接口系统上的人类技能

