MétaCan
Menu
Back to cohort
Record W2149506596 · doi:10.1109/iciap.2003.1234079

Hierarchical modeling via optimal context quantization

2004· article· en· W2149506596 on OpenAlexaff
A. Krivoulets, Xiaolin Wu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsComputer scienceArithmetic codingAlgorithmEntropy (arrow of time)Data compressionQuantization (signal processing)Data modelingContext modelEntropy encodingStatistical modelData reductionArtificial intelligenceData miningContext-adaptive binary arithmetic coding

Abstract

fetched live from OpenAlex

Optimal context quantization with respect to the minimum conditional entropy (MCECQ) is proven to be an efficient way for high order statistical modeling and model complexity reduction in data compression systems. The MCECQ merges together contexts that have similar statistics to reduce the size of the original model. In this technique, the number of output clusters (the model size) must be set before quantization. Optimal model size for the given data is not usually known in advance. We extend the MCECQ technique to a multi-model approach for context modeling, which overcomes this problem and gives the possibilities for better fitting the model to the actual data. The method is primarily intended for image compression algorithms. In our experiments, we applied the proposed technique to embedded conditional bit-plane entropy coding of wavelet transform coefficients. We show that the performance of the proposed modeling achieves the performance of the optimal model of fixed size found individually for given data using MCECQ (and in most cases it is even slightly better).

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.025
GPT teacher head0.287
Teacher spread0.262 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207