MétaCan
Menu
Back to cohort
Record W4401009914 · doi:10.1145/3654522.3654551

Data Clustering with Libby-Novick Beta-Liouville Mixture Models: A Minimum Message Length Approach

2024· article· en· W4401009914 on OpenAlex
Oussama Sghaier, Manar Amayri, Nizar Bouguila

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBayesian Methods and Mixture Models
Canadian institutionsConcordia University
Fundersnot available
KeywordsCluster analysisComputer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we examine the issue of figuring out a proportional data structure without prior knowledge of the number of clusters. We model the data samples by finite mixture models based on Libby-Novick Beta-Liouville distribution, a new distribution that combines the key features of both Libby-Novick Beta and Liouville distributions. It gives high flexibility and a more robust covariance structure compared to typical distributions such as Dirichlet. However, determining the number of clusters in mixture modeling is a significant issue. In this case, the number of clusters is ascertained by applying the minimum message length (MML) approach. Furthermore, the complexity of the mixture model (that is, the number of components) can be automatically and concurrently computed with the parameters estimated in a closed form as part of the Expectation Maximization process. The proposed method is validated by both synthetic data and real-world data.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.967
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0030.002
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.058
GPT teacher head0.282
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicBayesian Methods and Mixture ModelsFrench-language works237,207