Class Binarization

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many learning algorithms are only designed to separate two classes from each other. For example, concept-learning algorithms assume positive examples and negative examples (counterexamples) for the concept to learn, and many statistical learning techniques, such as neural networks or support vector machines, can only find a single separating decision surface. One way to apply these algorithms to multi-class problem is to transform the original multi-class problem into multiple binary problems.

Cite

CITATION STYLE

APA

Fürnkranz, J. (2017). Class Binarization. In Encyclopedia of Machine Learning and Data Mining (pp. 203–204). Springer Science+Business Media. https://doi.org/10.1007/978-1-4899-7687-1_915

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free