MétaCan
Menu
Back to cohort
Record W4403680373 · doi:10.3390/e26110899

Interval-Valued Random Matrices

2024· article· en· W4403680373 on OpenAlexaff
Abdolnasser Sadeghkhani, Ali Sadeghkhani

Bibliographic record

VenueEntropy · 2024
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsUniversity of Windsor
FundersNorth Carolina Agricultural and Technical State University
KeywordsFrequentist inferenceComputer scienceMatrix normEstimatorStatistical inferenceInferenceBayesian probabilityInterval (graph theory)Random matrixAlgorithmBayesian inferenceData miningMathematicsArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

This paper introduces a novel approach that combines symbolic data analysis with matrix theory through the concept of interval-valued random matrices. This framework is designed to address the complexities of real-world data, offering enhanced statistical modeling techniques particularly suited for large and complex datasets where traditional methods may be inadequate. We develop both frequentist and Bayesian methods for the statistical inference of interval-valued random matrices, providing a comprehensive analytical framework. We conduct extensive simulations to compare the performance of these methods, demonstrating that Bayesian estimators outperform maximum likelihood estimators under the Frobenius norm loss function. The practical utility of our approach is further illustrated through an application to climatology and temperature data, highlighting the advantages of interval-valued random matrices in real-world scenarios.

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.004
metaresearch head score (Gemma)0.022
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.022
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0030.005
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.001

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.011
GPT teacher head0.262
Teacher spread0.251 · 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
GenreEmpirical

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

Citations3
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueEntropySame topicNeural Networks and ApplicationsFrench-language works237,207