{"title":"高斯混合过程中EM算法的平方根更新加速","authors":"I. Shioya, T. Miura","doi":"10.1109/PACRIM.2011.6032887","DOIUrl":null,"url":null,"abstract":"This paper presents a new expectation maximization (EM) algorithm, which employees Square-root Update method combined by conventional Gaussian mixture EM algorithm, to accelerate the parameter learning of Gaussian mixture models. The algorithm enables us to improve poor convergence, avoids us unstable implementation and removes unnecessary iterations by employing inexact searches during the maximization processes. The convergence is faster compared to conventional EM algorithm. Furthermore, our proposal algorithm can be applied to autoregressive Gaussian mixture stationary processes.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Square root update acceleration of the EM algorithm in Gaussian mixture processes\",\"authors\":\"I. Shioya, T. Miura\",\"doi\":\"10.1109/PACRIM.2011.6032887\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new expectation maximization (EM) algorithm, which employees Square-root Update method combined by conventional Gaussian mixture EM algorithm, to accelerate the parameter learning of Gaussian mixture models. The algorithm enables us to improve poor convergence, avoids us unstable implementation and removes unnecessary iterations by employing inexact searches during the maximization processes. The convergence is faster compared to conventional EM algorithm. Furthermore, our proposal algorithm can be applied to autoregressive Gaussian mixture stationary processes.\",\"PeriodicalId\":236844,\"journal\":{\"name\":\"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2011.6032887\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2011.6032887","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Square root update acceleration of the EM algorithm in Gaussian mixture processes
This paper presents a new expectation maximization (EM) algorithm, which employees Square-root Update method combined by conventional Gaussian mixture EM algorithm, to accelerate the parameter learning of Gaussian mixture models. The algorithm enables us to improve poor convergence, avoids us unstable implementation and removes unnecessary iterations by employing inexact searches during the maximization processes. The convergence is faster compared to conventional EM algorithm. Furthermore, our proposal algorithm can be applied to autoregressive Gaussian mixture stationary processes.