MétaCan
Menu
Back to cohort
Record W1980840780 · doi:10.1002/minf.201100111

An Advanced Group Contribution Method for High‐Dimensional, Sparse Data Sets

2011· article· en· W1980840780 on OpenAlex

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

VenueMolecular Informatics · 2011
Typearticle
Languageen
FieldComputer Science
TopicComputational Drug Discovery Methods
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsGroup (periodic table)Computer scienceData miningChemistryOrganic chemistry

Abstract

fetched live from OpenAlex

Today's chemical processes involve many components, and it is necessary to know their basic physical properties for process design and operation. However, it is not always possible to find the property information of all components in the literature. Generally, there are two ways to evaluate properties of chemical compounds when they do not exist in the literature: the experimental measurement and predictive approaches based on empirical models. The latter is called the group contribution method (GCM), and its basic concept is that specific functional groups or fragments of a molecule contribute to the value of its physical property. The advantage of the GCMs is that they reduce the effort and cost compared to experiments. This study proposes a novel GCM method suitable for high-dimensional, sparse data sets. In order to improve its applicability and accuracy, the database is extended and divided into non-ring group compounds and ring group ones. Support vector regression (SVR) is adopted as the regression model, and a derivative-free optimization approach, referred to as particle swarm optimization, is incorporated into the parameter optimization step in learning the SVM model to avoid local optimality. Performance of the proposed model is compared to those of other GCMs.

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 categoriesnone
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.882
Threshold uncertainty score0.732

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0020.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.048
GPT teacher head0.346
Teacher spread0.297 · 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