Abonnement à la biblothèque: Guest
Journal of Automation and Information Sciences

Publication de 12  numéros par an

ISSN Imprimer: 1064-2315

ISSN En ligne: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

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

Volume 48, Numéro 10, 2016, pp. 74-85
DOI: 10.1615/JAutomatInfScien.v48.i10.80
Get accessGet access

RÉSUMÉ

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.

RÉFÉRENCES
  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.

Portail numérique Bibliothèque numérique eBooks Revues Références et comptes rendus Collections Prix et politiques d'abonnement Begell House Contactez-nous Language English 中文 Русский Português German French Spain