Rademacher Complexity in Neyman–Pearson Classification

Min HAN, Di Rong CHEN, Zhao Xu SUN

Acta Mathematica Sinica ›› 2009, Vol. 25 ›› Issue (5) : 855-868.

PDF(252 KB)
中国科学院数学与系统科学研究院期刊网
AMS
PDF(252 KB)
Acta Mathematica Sinica ›› 2009, Vol. 25 ›› Issue (5) : 855-868. DOI: 10.1007/s10114-008-6210-8
Articles

Rademacher Complexity in Neyman–Pearson Classification

  • Min HAN1, Di Rong CHEN2, Zhao Xu SUN3
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Acta Mathematica Sinica, 2009, 25(5): 855-868 https://doi.org/10.1007/s10114-008-6210-8

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(252 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉