Name
Abstract | ||
|---|---|---|
We prove new margin type bounds on the generalization error of voting classifiers that take into account the sparsity of weights and certain measures of clustering of weak classifiers in the convex combination. We also present experimental results to illustrate the behavior of the parameters of interest for several data sets. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-45167-9_36 | LECTURE NOTES IN ARTIFICIAL INTELLIGENCE |
Keywords | Field | DocType |
generalization error,convex combination | Data set,Voting,Pattern recognition,Computer science,Convex combination,Artificial intelligence,Generalization error,Cluster analysis,Machine learning | Conference |
Volume | ISSN | Citations |
2777 | 0302-9743 | 2 |
PageRank | References | Authors |
0.48 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vladimir Koltchinskii | 1 | 89 | 9.61 |
| Dmitry Panchenko | 2 | 36 | 3.12 |
| Savina Andonova | 3 | 7 | 1.06 |