Algorithmic aspects of determining depth functions in a procedure for optimal hypothesis selection in data classification problems

DOI10.1007/s10559-016-9872-8zbMath1349.62266OpenAlexW2522774870MaRDI QIDQ341367

O. A. Galkin

Publication date: 16 November 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9872-8

zbMATH Keywords

weighted averageBayes optimal hypothesisrelative depth function

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Unnamed Item
• On the difficulty of approximately maximizing agreements.
• Query by committee, linear separation and random walks.
• Breakdown and groups. (With discussions and rejoinder)
• Optimal signed-rank tests based on hyperplanes
• 10.1162/153244301753683717
• Asymptotics for general multivariate kernel density derivative estimators
• PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
• A Probabilistic Nearest Neighbour Method for Statistical Pattern Recognition

This page was built for publication: Algorithmic aspects of determining depth functions in a procedure for optimal hypothesis selection in data classification problems