作者: José A. Sáez , Mikel Galar , Julián Luengo , Francisco Herrera
DOI: 10.1007/S10115-012-0570-1
关键词:
摘要: The presence of noise in data is a common problem that produces several negative consequences classification problems. In multi-class problems, these are aggravated terms accuracy, building time, and complexity the classifiers. cases, an interesting approach to reduce effect decompose into binary subproblems, reducing and, consequently, dividing effects caused by each subproblems. This paper analyzes usage decomposition strategies, more specifically One-vs-One scheme, deal with noisy datasets. order investigate whether able or not, large number datasets created introducing different levels types noise, as suggested literature. Several well-known algorithms, without decomposition, trained on them check when advantageous. results obtained show methods using strategy lead better performances robust classifiers dealing data, especially most disruptive schemes.