MétaCan
Menu
Back to cohort
Record W3002658151 · doi:10.5539/cis.v13n1p80

Multi-Channel Similarity Based Compression

2020· article· en· W3002658151 on OpenAlexvenueno aff
Sergey Voronin

Bibliographic record

VenueComputer and Information Science · 2020
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceSimilarity (geometry)Channel (broadcasting)Compression (physics)Data compressionProcess (computing)Data miningCompression ratioAlgorithmLossless compressionPattern recognition (psychology)Artificial intelligenceTelecommunicationsImage (mathematics)

Abstract

fetched live from OpenAlex

Many situations arise where data is collected continuously across multiple channels or over multiple similar subjects. In many cases, transmission of the data across all channels is necessary, but the process can be made more efficient by making use of present similarity between data across different channels. We present here a combined compression approach which exploits approximate linear dependence and high correlation coefficient values between pairs of transformed and sorted channel data vectors. By exploiting this similarity, substantial compression gains can be achieved compared to compression of data per each individual channel.

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 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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
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.937
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.015
Open science0.0010.001
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.036
GPT teacher head0.283
Teacher spread0.247 · 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 teacher head, not a consensus.

Study designSimulation or modeling
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

Citations0
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueComputer and Information ScienceSame topicAdvanced Data Compression TechniquesFrench-language works237,207