Участник:Vokov/Publications
Материал из MachineLearning.
(Различия между версиями)
(Новая: ==Publications of Konstantin Vorontsov== Here only English publications are noted, most my publications are in Russian. # ''Vorontsov K.'' Preliminary data processing for a special clas...) |
(→Publications of Konstantin Vorontsov) |
||
Строка 14: | Строка 14: | ||
# ''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. [[Media:voron09pria-eng.pdf|PDF, 164Kb]]. | # ''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. [[Media:voron09pria-eng.pdf|PDF, 164Kb]]. | ||
# ''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. [[Media:voron10pria-eng.pdf|PDF, 427Kb]]. | # ''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. [[Media:voron10pria-eng.pdf|PDF, 427Kb]]. | ||
- | # ''Vorontsov K., Ivahnenko A., Botov P., Reshetnyak I., Tolstikhin I.'' Combinatorial generalization bounds. [[Media:voron11colt-submission-eng.pdf|PDF, 315Kb]] (unpublished). | + | # ''Vorontsov K., Ivahnenko A., Botov P., Reshetnyak I., Tolstikhin I.'' Combinatorial generalization bounds. 2011. [[Media:voron11colt-submission-eng.pdf|PDF, 315Kb]] (unpublished). |
# ''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. [[Media:voron11premi-eng.pdf|PDF, 153Kb]]. | # ''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. [[Media:voron11premi-eng.pdf|PDF, 153Kb]]. | ||
# ''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. [[Media:voron11spirin-eng.pdf|PDF, 490Kb]]. | # ''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. [[Media:voron11spirin-eng.pdf|PDF, 490Kb]]. |
Версия 16:54, 12 января 2012
Publications of Konstantin Vorontsov
Here only English publications are noted, most my publications are in Russian.
- 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.
- 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.
- 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.
- 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.
- Vorontsov K. Combinatorial substantiation of learning algorithms // Comp. Maths Math. Phys. — 2004. — Vol. 44, no. 11. — Pp. 1997–2009. PDF, 206Kb.
- Vorontsov K. Combinatorial bounds for learning performance // Doklady Mathematics. — 2004. — Vol. 69, no. 1. — Pp. 145––148. PDF, 44Kb.
- 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.
- 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.
- 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.
- Vorontsov K. Tight Bounds for the Probability of Overfitting // Doklady Mathematics, 2009, Vol. 80, No. 3, pp. 793–796. PDF, 192Kb.
- 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.
- 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.
- Vorontsov K., Ivahnenko A., Botov P., Reshetnyak I., Tolstikhin I. Combinatorial generalization bounds. 2011. PDF, 315Kb (unpublished).
- 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.
- 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.