An algorithm for the optimization of multiple classifiers in data mining based on graphs

Kelarev, Andrei and Ryan, Joe and Yearwood, John (2009) An algorithm for the optimization of multiple classifiers in data mining based on graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 71 .

Full text not available from this repository.


This article develops an efficient combinatorial algorithm based on labeled directed graphs and motivated by applications in data mining for designing multiple classifiers. Our method originates from the standard approach described in. It defines a representation of a multiclass classifier in terms of several binary classifiers. We are using labeled graphs to introduce additional structure on the classifier. Representations of this sort are known to have serious advantages. An important property of these representations is their ability to correct errors of individual binary classifiers and produce correct combined output. For every representation like this we develop a combinatorial algorithm with quadratic running time to compute the largest number of errors of individual binary classifiers which can be corrected by the combined multiple classifier. In addition, we consider the question of optimizing the classifiers of this type and find all optimal representations for these multiple classifiers.

Item Type: Article
Uncontrolled Keywords: combinatorial algorithm, binary classifiers, graphs, multiple classifiers
Depositing User: Dr David Allingham
Date Deposited: 28 Sep 2012 12:05
Last Modified: 28 Sep 2012 12:05

Actions (login required)

View Item