Mode merging for the finite mixture of <i>t</i>‐distributions
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Finite mixture models can be interpreted as a model representing heterogeneous subpopulations within the whole population. However, more care is needed when associating a mixture component with a cluster, because a mixture model may fit more components than the number of clusters. Modal merging via the mean shift algorithm can help identify such multicomponent clusters. So far, most of the related works are focused on the Gaussian finite mixture. As the non‐Gaussian finite mixture models are gaining attention, the need to address the component‐cluster correspondence issue in these mixture models grows. Thus, we introduce a mode merging method via the mean shift for the finite mixture of t ‐distributions and its parsimonious variants. It can be framed as an expectation–maximization algorithm and enjoys similar theoretical properties as the mean shift for the Gaussian finite mixture. The performance of our method is demonstrated via simulated and real data experiments, where it shows a competitive performance against some of the existing methods.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it