{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:10:32Z","timestamp":1778253032161,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540225706","type":"print"},{"value":"9783540278689","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27868-9_67","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T06:52:23Z","timestamp":1284619943000},"page":"618-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bounds for the Average Generalization Error of the Mixture of Experts Neural Network"],"prefix":"10.1007","author":[{"given":"Lu\u00eds A.","family":"Alexandre","sequence":"first","affiliation":[]},{"given":"Aur\u00e9lio","family":"Campilho","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Kamel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1109\/72.508938","volume":"7","author":"H. Gu","year":"1996","unstructured":"Gu, H., Takahashi, H.: Towards more practical average bounds on supervised learning. IEEE Trans. Neural Networks\u00a07, 953\u2013968 (1996)","journal-title":"IEEE Trans. Neural Networks"},{"key":"67_CR2","volume-title":"The Nature of Statistical Learning Theory","author":"V. Vapnik","year":"1999","unstructured":"Vapnik, V.: The Nature of Statistical Learning Theory. Springer, Heidelberg (1999)"},{"key":"67_CR3","volume-title":"Neural Networks: A Comprehensive Foundation","author":"S. Haykin","year":"1999","unstructured":"Haykin, S.: Neural Networks: A Comprehensive Foundation, 2nd edn. Prentice-Hall, Englewood Cliffs (1999)","edition":"2"},{"key":"67_CR4","unstructured":"Alexandre, L., Campilho, A., Kamel, M.: Average error bound for the mixture of experts MNN architecture. In: Proceedings of the 12th Portuguese Conference on Pattern Recognition, Aveiro, Portugal (2002)"},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"Jacobs, R., Jordan, M., Nowlan, S., Hinton, G.: Adaptive mixtures of local experts. Neural Computation, 79\u201387 (1991)","DOI":"10.1162\/neco.1991.3.1.79"},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Auda, G., Kamel, M.: Modular neural network classifiers: A comparative study. J. Intel. Robotic Systems, 117\u2013129 (1998)","DOI":"10.1023\/A:1007925203918"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Jordan, M., Jacobs, R.: Hierarchical mixture of experts and the EM algorithm. Neural Computation, 181\u2013214 (1994)","DOI":"10.1162\/neco.1994.6.2.181"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0893-6080(96)00050-0","volume":"10","author":"R. Jacobs","year":"1997","unstructured":"Jacobs, R., Peng, F., Tanner, M.: A bayesian approach to model selection in hierarchical mixtures-of-experts architectures. Neural Networks\u00a010, 231\u2013241 (1997)","journal-title":"Neural Networks"},{"key":"67_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56651-6","volume-title":"Pattern Recognition: Concepts, Methods and Applications","author":"J. Marques de S\u00e1","year":"2001","unstructured":"Marques de S\u00e1, J.: Pattern Recognition: Concepts, Methods and Applications. Springer, Heidelberg (2001)"},{"key":"67_CR10","unstructured":"Blake, C., Keogh, E., Merz, C.: UCI repository of machine learning databases (1998), \n                        http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"67_CR11","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/S0893-6080(97)00047-6","volume":"10","author":"H. Gu","year":"1997","unstructured":"Gu, H., Takahashi, H.: Estimating learning curves of concept learning. Neural Networks\u00a010, 1089\u20131102 (1997)","journal-title":"Neural Networks"},{"key":"67_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538493.001.0001","volume-title":"Neural Networks for Pattern Recognition","author":"C. Bishop","year":"1995","unstructured":"Bishop, C.: Neural Networks for Pattern Recognition. Oxford University Press, Oxford (1995)"},{"key":"67_CR13","doi-asserted-by":"crossref","unstructured":"Riedmiller, M., Braun, H.: A direct adaptive method for faster backpropagation learning: The RPROP algorithm. In: IEEE International Conference on Neural Networks, San Francisco, pp. 586\u2013591 (1993)","DOI":"10.1109\/ICNN.1993.298623"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27868-9_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:18:57Z","timestamp":1778249937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-27868-9_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540225706","9783540278689"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27868-9_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}