{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T20:40:13Z","timestamp":1737060013223,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434726"},{"type":"electronic","value":"9783540460145"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46014-4_30","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T02:48:17Z","timestamp":1180579697000},"page":"337-345","source":"Crossref","is-referenced-by-count":2,"title":["A Bayesian Regularization Method for the Probabilistic RBF Network"],"prefix":"10.1007","author":[{"given":"Constantinos","family":"Constantinopoulos","sequence":"first","affiliation":[]},{"given":"Michalis K.","family":"Titsias","sequence":"additional","affiliation":[]},{"given":"Aristidis","family":"Likas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,19]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. P. Dempster","year":"1977","unstructured":"A. P. Dempster, N. M. Laird and D. B. Rubin, \u201cMaximum Likelihood Estimation from Incomplete Data via the EM Algorithm\u201d, Journal of the Royal Statistical Society B, vol. 39, pp. 1\u201338, 1977.","journal-title":"Journal of the Royal Statistical Society B"},{"key":"30_CR2","unstructured":"G. McLachlan, T. Krishnan, The Em Algorithm and Extensions, Wiley, 1997."},{"key":"30_CR3","unstructured":"T. Mitchell, Machine Learning, McGraw-Hill, 1997."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"C. M. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 1995.","DOI":"10.1201\/9781420050646.ptb6"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"G. McLachlan, D. Peel, Finite Mixture Models, Wiley, 2000.","DOI":"10.1002\/0471721182"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"M. Titsias, A. Likas, \u201cA Probabilistic RBF network for Classification\u201d, Proc. of International Joint Conference on Neural Networks, Como, Italy, July 2000.","DOI":"10.1109\/IJCNN.2000.860779"},{"issue":"5","key":"30_CR7","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1109\/72.950129","volume":"12","author":"M. Titsias","year":"2001","unstructured":"M. Titsias, A. Likas, \u201cShared Kernel Models for Class Conditional Density Estimation\u201d, IEEE Trans. on Neural Networks, vol. 12, no. 5, pp. 987\u2013997, Sept. 2001.","journal-title":"IEEE Trans. on Neural Networks"},{"key":"30_CR8","unstructured":"M. Titsias, A. Likas, \u201cClass Conditional Density Estimation Using Mixtures with Constraint Component Sharing\u201d, Tech. Rep. 8-2001, Dept. of Computer Science, Univ. of Ioannina, 2001."},{"key":"30_CR9","unstructured":"N. A. Vlassis and A. Likas, \u201cA Greedy-EM Algorithm for Gaussian Mixture Learning\u201d, Neural Processing Letters, to appear."}],"container-title":["Lecture Notes in Computer Science","Methods and Applications of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46014-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T20:14:50Z","timestamp":1737058490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46014-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434726","9783540460145"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-46014-4_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}