In this paper, we describe an approach to modeling the general process of combining decisions involved in ensembles of classifiers as an evidential reasoning process. This work proposes a novel structure, theoretical properties and manipulation mechanisms for representing classifier decisions as pieces of evidence. The advantage of the representation formalism is that it not only facilitates the distinguishing of trivial focal elements from important ones, resulting in the improvement of the ensemble performance, but it also effectively reduces the computation-time from exponential (as required in the conventional process of combining multiple pieces of evidence) to linear. We have conducted a comparative analysis on the effectiveness of the proposed evidence representation formalism in the text categorization domain. By comparing this method with majority voting and the previous results, we also demonstrate the advantage of this novel approach in combining classifiers.
|Title of host publication||Unknown Host Publication|
|Number of pages||6|
|Publication status||Published - 2006|
|Event||SAC '06 Proceedings of the 2006 ACM symposium on Applied computing - |
Duration: 1 Jan 2006 → …
|Conference||SAC '06 Proceedings of the 2006 ACM symposium on Applied computing|
|Period||1/01/06 → …|