{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:25:11Z","timestamp":1737177911090,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540724575"},{"type":"electronic","value":"9783540724582"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72458-2_31","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T21:15:45Z","timestamp":1182806145000},"page":"252-259","source":"Crossref","is-referenced-by-count":1,"title":["A Batch Rival Penalized EM Algorithm for Gaussian Mixture Clustering with Automatic Model Selection"],"prefix":"10.1007","author":[{"given":"Dan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yiu-ming","family":"Cheung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Cheung, Y.M.: Rival Penalized Controlled Competitive Learning for Data Clustering with Unknown Cluster Number. In: Proceedings of Ninth International Conference on Neural Information Processing (ICONIP\u201902), Paper ID: 1983 in CD-ROM Proceeding (2002)"},{"issue":"6","key":"31_CR2","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/TKDE.2005.97","volume":"17","author":"Y.M. Cheung","year":"2005","unstructured":"Cheung, Y.M.: Maximum Weighted Likelihood via Rival Penalized EM for Density Mixture Clustering with Automatic Model Selection. IEEE Transactions on Knowledge and Data Engineering\u00a017(6), 750\u2013761 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"31_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., Rubin, D.: Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of Royal Statistical Society\u00a039(1), 1\u201338 (1977)","journal-title":"Journal of Royal Statistical Society"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/72.238318","volume":"4","author":"L. Xu","year":"1993","unstructured":"Xu, L., Krzy\u017cak, A., Oja, E.: Rival Penalized Competive Learning for Clustering Analysis, RBF Net, and Curve Detection. IEEE Transactions on Neural Networks\u00a04, 636\u2013648 (1993)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"31_CR5","unstructured":"Zhao, X.M., et al.: A New Technique for Adjusting the Learning Rate of RPEM Algorithm Automatically. To appear in the Proceedings of The Twelfth International Symposium on Artificial Life and Robotics, Japan (2007)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72458-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T20:46:13Z","timestamp":1737146773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72458-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540724575","9783540724582"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72458-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}