Probabilistic Bounds for Binary Classification of Large Data Sets

Autoři: RNDr. Věra Kůrková, DSc.
Rok vydání: 2020
Typ publikace: Konferenční příspěvek (mezinárodní konf.)
Periodikum: Recent Advances in Big Data and Deep Learning
Projekty: Schopnosti a omezení mělkých a hlubokých sítí
Bibliografická citace: KŮRKOVÁ, Věra, SANGUINETI, M. Probabilistic Bounds for Binary Classification of Large Data Sets. In: ONETO, L., NAVARIN, N., SPERDUTI, A., ANGUITA, D., eds. Recent Advances in Big Data and Deep Learning. Cham: Springer, 2020, S. 309-319. Proceedings of the International Neural Networks Society. ISBN 978-3-030-16840-7. ISSN 2661-8141
Dostupné z: doi:10.1007/978-3-030-16841-4_32
DOI: 10.1007/978-3-030-16841-4_32
ID: 503127

Abstrakt

A probabilistic model for classification of task relevance is investigated. Correlations between randomly-chosen functions and network input-output functions are estimated. Impact of large data sets is analyzed from the point of view of the concentration of measure phenomenon. The Azuma-Hoeffding Inequality is exploited, which can be applied also when the naive Bayes assumption is not satisfied (i.e., when assignments of class labels to feature vectors are not independent).