Data Input
Drop CSV file here or click to browse
Discover hidden patterns in your data with Reversible Jump MCMC - automatically detect how many mixture components exist without guessing!
Upload your data or explore with our interactive examples • View detailed vignette
This application uses Reversible Jump Markov Chain Monte Carlo (RJMCMC) to dynamically determine the number of components in a mixture model without requiring you to specify the number of components beforehand.
The target mixture distribution is defined as a combination of K Gaussian components:
Mathematical Representation:
p(z) = Σk=1K pk · N(z | μk, σk2)
where:
• N(z | μk, σk2) is the normal density for the k-th component
• pk represents the mixing proportion of the k-th component
• K is the number of components (inferred dynamically)
• μk are the component means
• σk are the component standard deviations
L(data | K, {pk, μk, σk}) = Πi=1N (Σk=1K pk · N(zi | μk, σk2))
Model Selection: The algorithm explores different numbers of mixture components (K) during sampling
Reversible Jumps: It can add or remove components through "birth" and "death" moves
Bayesian Inference: Uses posterior probabilities to determine the most likely number of components
Parameter Estimation: Simultaneously estimates component means, standard deviations, and mixing proportions
Automatic component number selection (no need to specify K beforehand)
Real-time visualization of the sampling process
Convergence diagnostics (ESS, Gelman-Rubin statistic)
Posterior distribution of mixture components
Drop CSV file here or click to browse