Search results
- 1.0493926 - ÚI 2019 RIV DE eng C - Conference Paper (international conference)
Kůrková, Věra - Sanguineti, M.
Probabilistic Bounds on Complexity of Networks Computing Binary Classification Tasks.
ITAT 2018: Information Technologies – Applications and Theory. Proceedings of the 18th conference ITAT 2018. Aachen: Technical University & CreateSpace Independent Publishing Platform, 2018 - (Krajči, S.), s. 86-91. CEUR Workshop Proceedings, V-2203. ISSN 1613-0073.
[ITAT 2018. Conference on Information Technologies – Applications and Theory /18./. Plejsy (SK), 21.09.2018-25.09.2018]
R&D Projects: GA ČR(CZ) GA18-23827S
Institutional support: RVO:67985807
Keywords : feedforward networks * binary classification * measures of sparsity * probabilistic bounds * dictionaries of computational units
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://ceur-ws.org/Vol-2203/86.pdf
Permanent Link: http://hdl.handle.net/11104/0287193File Download Size Commentary Version Access a0493926.pdf 5 627.8 KB Publisher’s postprint require - 2.0485611 - ÚI 2020 RIV US eng J - Journal Article
Kůrková, Věra - Sanguineti, M.
Classification by Sparse Neural Networks.
IEEE Transactions on Neural Networks and Learning Systems. Roč. 30, č. 9 (2019), s. 2746-2754. ISSN 2162-237X. E-ISSN 2162-2388
R&D Projects: GA ČR GA15-18108S; GA ČR(CZ) GA18-23827S
Institutional support: RVO:67985807
Keywords : Binary classification * Chernoff–Hoeffding bound * dictionaries of computational units * feedforward networks * measures of sparsity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 8.793, year: 2019
Method of publishing: Limited access
http://dx.doi.org/10.1109/TNNLS.2018.2888517
Permanent Link: http://hdl.handle.net/11104/0280566File Download Size Commentary Version Access 0485611-a.pdf 18 458.9 KB Publisher’s postprint require