{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:48:30Z","timestamp":1649101710687},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2007,5]]},"abstract":"<jats:p> A unified probabilistic framework (UPF) of partitional clustering algorithms is proposed based on Penalized Maximum Likelihood. Besides Gaussian Mixture model methods, many popular clustering methods, such as Fuzzy c-Means Algorithm (FCM), Attribute Means Clustering (AMC), General c-Means Clustering (GCM), and Deterministic Annealing (DA) Clustering can be explained as special cases within UPF. Furthermore, this UPF framework provides a general approach to design comparatively stable and effectively regularized clustering algorithms. <\/jats:p>","DOI":"10.1142\/s0218001407005569","type":"journal-article","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T02:42:56Z","timestamp":1182480176000},"page":"483-490","source":"Crossref","is-referenced-by-count":0,"title":["FROM PENALIZED MAXIMUM LIKELIHOOD TO CLUSTER ANALYSIS: A UNIFIED PROBABILISTIC FRAMEWORK OF CLUSTERING"],"prefix":"10.1142","volume":"21","author":[{"given":"XICHEN","family":"SUN","sequence":"first","affiliation":[{"name":"National Lab on Machine Perception, Peking University, Beijing 100871, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"QIANSHENG","family":"CHENG","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Peking University, Beijing 100871, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JUFU","family":"FENG","sequence":"additional","affiliation":[{"name":"National Lab on Machine Perception, Peking University, Beijing 100871, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-0450-1"},{"key":"rf2","first-page":"124","volume":"18","author":"Cheng Q.","journal-title":"Syst. Eng. \u2014 Th. Pract."},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347872"},{"key":"rf4","volume-title":"Pattern Classification","author":"Duda R. O.","year":"2001"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.2307\/2334515"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/5.726788"},{"key":"rf7","first-page":"1035","volume":"5","author":"Tikhonov A.","journal-title":"Sov. Math. \u2014 Doklady"},{"key":"rf9","volume-title":"Statistical Learning Theory","author":"Vapnik V.","year":"1998"},{"key":"rf10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1017\/S0013091500077853","volume":"41","author":"Whittaker E.","journal-title":"Proc. Edinburgh Math. Soc."}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001407005569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:19:57Z","timestamp":1565144397000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001407005569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2007,5]]}},"alternative-id":["10.1142\/S0218001407005569"],"URL":"https:\/\/doi.org\/10.1142\/s0218001407005569","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}