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
In this study, we are concerned with the role of information granulation in data mining in databases. By their nature, data mining pursuits are very much oriented towards end-users and imply that any results need to be easily interpretable. Granulation of information promotes this interpretability and channels all pursuits of data mining (that are otherwise computationally intensive and thus highly prohibitive) towards more efficient and feasible processing. First, we discuss the essence of information granulation and afterwards elaborate on the main approaches to the design of information granules. We distinguish between user-driven, data-driven and hybrid methods of information granulation. Several main classes of membership functions of information granules-fuzzy sets are investigated and contrasted in terms of some selection criteria such as parametric flexibility and sensitivity of the ensuing information granules. We propose two fundamental concepts in data mining: associations and rules. Associations are direction-free constructs that capture the most essential components of the overall structure in database. The relevance of associations is expressed by the cardinality of the data embraced by the Cartesian products of the information granules contributing to the construction of the associations. The proposed methodology of data mining comprises two phases. First, associations are built and the most essential (relevant) ones are collected in the form of a data mining agenda. Second, some associations can be converted into direction-driven constructs (rules). The idea of consistency of the rules is discussed in detail.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.006 |
| Research integrity | 0.000 | 0.001 |
| 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