A Rule Induction Algorithm for Application to Petrophysical, Seismic, Geological and Reservoir Data
Bibliographic record
Abstract
Abstract This paper introduces an algorithm for rule induction intended to provide new insights, improve the reliability and expedite the utilization of large petrophysical and geologic databases. Very large petrophysical, geophysical, and geological databases contain multiple data types, which must be interpreted for application in subsurface modeling. This paper presents a significant advance in discovering complex and even nontrivial data relationships from such databases. Geoscientists are often challenged to predict subsurface lithologies and properties from multivariate relationships within large databases of core, wireline, and seismic data. Many data analysis techniques are used including histograms, parametric and non-parametric regression, n-dimensional histograms, cluster analysis, discrimininant analysis, principal components analysis. This paper introduces a new algorithm that seeks to discover "rule-like" relationships within the data that can be used to make predictions. The method is loosely derived from a data mining technology of classification. Concepts of data attribute distinguishability and importance are introduced to assess the value of the data and the outcomes to predictability. The new theory, implementation details, and an application are presented. Current petrophysical, seismic, and geostatistical analysis benefit from the rule induction algorithm presented. Improved reservoir characterization and forecasting result.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".