.png){kind=icon}
返回
Classification through incremental max-min separability
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-010-0191-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Piecewise linear functions can be used to approximate non-linear decision boundaries between pattern classes. Piecewise linear boundaries are known to provide efficient real-time classifiers. However, they require a long training time. Finding piecewise linear boundaries between sets is a difficult optimization problem. Most approaches use heuristics to avoid solving this problem, which may lead to suboptimal piecewise linear boundaries. In this paper, we propose an algorithm for globally training hyperplanes using an incremental approach. Such an approach allows one to find a near global minimizer of the classification error function and to compute as few hyperplanes as needed for separating sets. We apply this algorithm for solving supervised data classification problems and report the results of numerical experiments on real-world data sets. These results demonstrate that the new algorithm requires a reasonable training time and its test set accuracy is consistently good on most data sets compared with mainstream classifiers.
Keyword:
Classification
Data mining
Data analysis
Supervised learning
Piecewise linear classifier
期刊
IF:
2
论文数:
1.9K
被引数:
1.9K
机构
引用论文
Comparative analysis of the structural organization of two closely related vitellogenin genes in X. laevis.png)
Cell
CellIF0
PREAI
分享收藏Effect of phenological phase of dry grazing pasture on fatty acid composition of cows’ milk
OAAI
OAAI分享收藏Impact of Thulium VapoEnucleation of the Prostate on Erectile Function: A Prospective Analysis of 72 Patients at 12-Month Follow-upUrology
UrologyIF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容