3D visualization of GMM learning via the EM algorithm
The evolution of a GMM in the EM algorithm is visualized by interpolating between iterations.
이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
This is a 3D visualization of how the Expectation Maximization algorithm learns a Gaussian Mixture Model for 3-dimensional data.
--How it works--
The data is either read in or generated in general-covariance gaussian clusters. For desired values of k (number of Gaussians to fit), a movie is played showing the evolution of the GMM through the iterations of the EM algorithm. The true model is only available at each iteration (viewed as an anchor frame in a movie), so the illusion of movement of the 3D Gaussians (displayed as ellipsoids at 1 standard deviation) is given by interpolating enough "frames" in between these anchor frames.
인용 양식
Johannes (2026). 3D visualization of GMM learning via the EM algorithm (https://kr.mathworks.com/matlabcentral/fileexchange/34527-3d-visualization-of-gmm-learning-via-the-em-algorithm), MATLAB Central File Exchange. 검색 날짜: .
| 버전 | 퍼블리시됨 | 릴리스 정보 | Action |
|---|---|---|---|
| 1.9.0.0 | Simplified 2D plotting option, stream-lined code |
||
| 1.8.0.0 | Cleaned up code, improved plotting, coloring, added full-covariance capabilities |
||
| 1.6.0.0 | Corrected bug in EM implementation |
||
| 1.5.0.0 | changed mean initialization from 'at data mean with small noise' to 'at data points chosen at random' (usually gives better clustering) |
||
| 1.4.0.0 | reduced overhead |
||
| 1.2.0.0 | updated description |
||
| 1.1.0.0 | color gradient added to data points to show the certainty that it belongs to the nearest Gaussian |
||
| 1.0.0.0 |
