Участник:Vokov/Publications

Материал из MachineLearning.

Publications of Konstantin Vorontsov

Here only English publications are noted, most of my publications are in Russian.

1. Vorontsov K. Preliminary data processing for a special class of recognition problems // Comp. Maths Math. Phys. — 1995. — Vol. 35, no. 10. — Pp. 1259–1267. PDF, 400Kb.
2. Vorontsov K. The task-oriented optimization of bases in recognition problems // Comp. Maths Math. Phys. — 1998. — Vol. 38, no. 5. — Pp. 838–847. PDF, 580Kb.
3. Rudakov K., Vorontsov K. Methods of optimization and monotone correction in the algebraic approach to the recognition problem // Doklady Mathematics. — 1999. — Vol. 60, no. 1. — P. 139.
4. Vorontsov K. Optimization methods for linear and monotone correction in the algebraic approach to the recognition problem // Comp. Maths Math. Phys. — 2000. — Vol. 40, no. 1. — Pp. 159–168.
5. Vorontsov K. Combinatorial substantiation of learning algorithms // Comp. Maths Math. Phys. — 2004. — Vol. 44, no. 11. — Pp. 1997–2009. PDF, 206Kb.
6. Vorontsov K. Combinatorial bounds for learning performance // Doklady Mathematics. — 2004. — Vol. 69, no. 1. — Pp. 145––148. PDF, 44Kb.
7. Kanevskiy D., Vorontsov K. Cooperative coevolutionary ensemble learning // Multiple Classifier Systems: 7th International Workshop, Prague, Czech Republic, May 23-25, 2007. — Lecture Notes in Computer Science. Springer-Verlag, 2007. — Pp. 469–478. PDF, 155Kb.
8. Leksin V., Vorontsov K. The overfitting in probabilistic latent semantic models // Pattern Recognition and Image Analysis: new information technologies (PRIA-9-2008). — Vol. 1. — Nizhni Novgorod, Russian Federation, 2008. — Pp. 393–396. PDF, 250Kb.
9. Vorontsov K. Combinatorial probability and the tightness of generalization bounds // Pattern Recognition and Image Analysis. — 2008. — Vol. 18, no. 2. — Pp. 243–259. PDF, 373Kb.
10. Vorontsov K. Tight Bounds for the Probability of Overfitting // Doklady Mathematics, 2009, Vol. 80, No. 3, pp. 793–796. PDF, 192Kb.
11. Vorontsov K. Splitting and Similarity Phenomena in the Sets of Classifiers and Their Effect on the Probability of Overfitting // Pattern Recognition and Image Analysis, 2009, Vol. 19, No. 3, pp. 412–420. PDF, 164Kb.
12. Vorontsov K. Exact Combinatorial Bounds on the Probability of Overfitting for Empirical Risk Minimization // Pattern Recognition and Image Analysis, 2010, Vol. 20, No. 3, pp. 269–285. PDF, 427Kb.
13. Vorontsov K., Ivahnenko A., Botov P., Reshetnyak I., Tolstikhin I. Combinatorial generalization bounds. 2011. PDF, 315Kb (unpublished).
14. Vorontsov K., Ivahnenko A. Tight Combinatorial Generalization Bounds for Threshold Conjunction Rules // Lecture Notes on Computer Science. 4th International Conference on Pattern Recognition and Machine Intelligence (PReMI’11), Russia, Moscow, June 27–July 1, 2011. Pp 66–73. PDF, 153Kb.
15. Spirin N., Vorontsov K. Learning to Rank with Nonlinear Monotonic Ensemble // Lecture Notes on Computer Science. 10th International Workshop on Multiple Classidier Systems (MCS-10). Naples, Italy, June 15–17, 2011. Pp. 16–25. PDF, 490Kb.