Inscrição na biblioteca: Guest
Portal Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa
Journal of Automation and Information Sciences
SJR: 0.232 SNIP: 0.464 CiteScore™: 0.27

ISSN Imprimir: 1064-2315
ISSN On-line: 2163-9337

Volume 51, 2019 Volume 50, 2018 Volume 49, 2017 Volume 48, 2016 Volume 47, 2015 Volume 46, 2014 Volume 45, 2013 Volume 44, 2012 Volume 43, 2011 Volume 42, 2010 Volume 41, 2009 Volume 40, 2008 Volume 39, 2007 Volume 38, 2006 Volume 37, 2005 Volume 36, 2004 Volume 35, 2003 Volume 34, 2002 Volume 33, 2001 Volume 32, 2000 Volume 31, 1999 Volume 30, 1998 Volume 29, 1997 Volume 28, 1996

Journal of Automation and Information Sciences

DOI: 10.1615/JAutomatInfScien.v48.i10.80
pages 74-85

Algorithms for Solving Classification Problems on the Basis of Approximation of Relative Data Depth and Weighted Mean Value

Alexander A. Galkin
Kiev National Taras Shevchenko University, Kiev


Urgent problem of selection of optimal hypothesis in problems of classification with usage of concept of weighted mean value and depth functions is under consideration. Modified algorithms for approximation of relative data depth and relative weighted mean value of distribution were developed and investigated. The suggested algorithms provide polynomial approximations to semispatial data depth and semispatial weighted mean value of distribution, which is special case of family of weighted mean values.


  1. Godtliebsen F., Marron J.S., Chaudhuri P., Significance in scale space for bivariate density estimation, Journal of Computational and Graphical Statistics, 2002, No. 11, 1-22.

  2. Herbrich R., Graepel T., Campbell C., Bayes point machines, The Journal of Machine Learning Research, 2001, No. 1, 247-271.

  3. Seeger M., PAC-Bayesian generalization error bounds for Gaussian process classification, Ibid., 2003, No. 3, 237-268.

  4. Holmes C.C., Adams N.M., A probabilistic nearest neighbor method for statistical pattern recognition, Journal of the Royal Statistical Society, 2002, No. 64, 295-306.

  5. Davies P.L., Gather U., Breakdown and groups, The Annals of Statistics, 2005, No. 33(3), 981-1027.

  6. Zuo Y., Serfling R., General notions of statistical depth function, Ibid., 2000, No. 28(2), 464-480.

  7. Billor N., Abebe A., Turkmen A., Nudurupati S.V., Classification based on depth transvariations, Journal of Classification, 2008, No. 25(2), 253-259.

  8. Fine S., Gilad-Bachrach R., Shamir E., Query by committee, linear separation and random walks, Theoretical Computer Science, 2002, No. 284(1), 27-49.

  9. Ben-David S., Eiron N., Long P.M., On the difficulty of approximately maximizing agreements, Journal of Computer and System Sciences, 2003, No. 66(3), 499-511.

  10. Lange T., Mosler K., Mozharovskyi P., Fast nonparametric classification based on data depth, Statistical Papers, 2014, No. 55, 53-67.

Articles with similar content:

Numerical Spectral Estimation in the Control and Inspection of Parameters of Electromechanical Systems
Journal of Automation and Information Sciences, Vol.31, 1999, issue 7-9
Victor Yu. Arkadiev
m-Parallel Data Search Methods for Record Retrieval in Data Bases and Comparative Analysis of Their Efficiency
Journal of Automation and Information Sciences, Vol.32, 2000, issue 3
Grigoriy G. Tsehelyk, Miroslav S. Laba
Depth-Dependent Approach to the Selection of the Optimal Hypothesis in Classification Problems
Journal of Automation and Information Sciences, Vol.48, 2016, issue 7
Alexander A. Galkin
On the Probability Estimate of the Insurance Company Bankruptcy in the Model with Stochastic Premiums and Claims and the Opportunity to Invest in Financial (B, S)-market
Journal of Automation and Information Sciences, Vol.42, 2010, issue 9
Boris V. Bondarev, Tatyana V. Zhmykhova, Artem V. Baev
International Journal for Uncertainty Quantification, Vol.5, 2015, issue 2
Narayana R. Aluru, Aravind Alwan