A Big Data Mining in Petroleum Exploration and Development
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.
Bibliographic record
Abstract
We take a well log in petroleum exploration and development as an example of the big data mining, and adopt three regression and two classification algorithms: the multiple regression analysis (MRA), the error back-propagation neural network (BPNN), the regression of support vector machine ( R -SVM), the classification of support vector machine ( C -SVM), and the Bayesian successive discrimination (BAYSD). It is well known that MRA, BPNN and R -SVM are regression algorithms while C -SVM and BAYSD are classification algorithms, and only MRA is linear algorithm whereas the other four algorithms are nonlinear algorithms. From this case study, we can draw the following five major conclusions: a) Since C -SVM is the best classifier, it is employed as a data cleaning tool. b) Since MRA is a linear algorithm, its total mean absolute relative residual R * (%) can express the nonlinearity of studied problem. For this case study, R * (%)=52.14 showing the nonlinearity of the studied problem is strong. c) Since both MRA and BAYD can establish the order of dependence between a dependent variable and independent variables, each of MRA and BAYD could serve as a pioneering dimension-reduction tool in data mining. In the case study, since the nonlinearity of the studied problem is strong, the nonlinear algorithm BAYSD can serve as a pioneering dimension-reduction tool, but the linear algorithm MRA cannot. d) Since the nonlinearity of the case study is strong, BPNN and R -SVM are not applicable though they are nonlinear algorithms, whereas other two nonlinear algorithms C -SVM and BAYSD are applicable, indicating the nonlinear ability of C -SVM and BAYSD is higher than that of BPNN and R -SVM. e) Comparing the two applicable algorithms C -SVM and BAYSD for this case study, it is seen that R * (%) of C -SVM is less than that of BAYSD; BAYSD can serve as a pioneering dimension-reduction tool, but C -SVM cannot; it is easy to code the BAYSD program whereas it is very complicated to code the C -SVM program, so BAYSD is a good software for this case study when C -SVM is not available. Key words : Big data mining; Well log; Data cleaning; Dimension-reduction; Regression; Classification
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.003 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it