An Efficient Brute Force Approach to Fit Finite Mixture Distributions
From MaRDI portal
Publication:5014509
DOI10.1007/978-3-030-43024-5_13zbMath1490.62011OpenAlexW3011170577MaRDI QIDQ5014509
Publication date: 8 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-43024-5_13
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cluster-based fitting of phase-type distributions to empirical data
- Hyper-Erlang distribution model and its application in wireless mobile networks
- Finite mixture and Markov switching models.
- Transformation of Acyclic Phase Type Distributions for Correlation Fitting
- Moment Matching-Based Distribution Fitting with Generalized Hyper-Erlang Distributions
- The least variable phase type distribution is erlang
- Statistical analysis of finite mixture distributions
- A versatile Markovian point process
- On the histogram as a density estimator:L 2 theory
- Phase-type distributions: open problems and a few properties
- A benchmark for ph estimation algorithms: results for acyclic-ph
- Matching moments to phase distributions: Mixtures of erlang distributions of common order
- Handbook of Mixture Analysis
- Input Modeling with Phase-Type Distributions and Markov Models
- Matching Three Moments with Minimal Acyclic Phase Type Distributions
- A new look at the statistical model identification
This page was built for publication: An Efficient Brute Force Approach to Fit Finite Mixture Distributions