A binary boosting method in the presence of outliers in training data
| Autor: | Meral Çetin, Onur Toka |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Boosting (machine learning) Training set Computer science business.industry Binary number Computational intelligence Pattern recognition 02 engineering and technology Theoretical Computer Science ComputingMethodologies_PATTERNRECOGNITION 020901 industrial engineering & automation Outlier 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Geometry and Topology Artificial intelligence business Software |
| Zdroj: | Soft Computing. 23:7081-7090 |
| ISSN: | 1433-7479 1432-7643 |
| DOI: | 10.1007/s00500-018-3350-3 |
| Popis: | The purpose of this research is to investigate robust loss functions and robust boosting algorithms when there are outliers in the training data. Boosting methods, which are algorithms included loss function and weak classifiers, are a way of predicting class label of given inputs. Loss functions can be useful in weak classifiers for boosting algorithms, and it is the way of penalizing misclassification. In addition, robust loss function gives penalties not only misclassification but also true classification margin in order to get more stable classifiers. In this paper, a new robust boosting algorithm, GudermannianBoost, is proposed. In the application part, there is a simulation study between two boosting algorithms, which have similar loss functions. Moreover, there are some real datasets applications in the presence of outlier-ridden datasets. All results from the simulation and application highlight the importance of robust algorithms for classifying observations more accurately. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink