Bibliographic record
Abstract
A rule-inducing learning algorithm yields a set of decision rules that depict knowledge discovered from a (usually large) dataset; therefore, this topic is often known as knowledge discovery from databases (KDD). Any classifier (or, expect system) then can utilize this decision set to derive a decision about given problems, observations, or diagnostics. The decision set (induced by a learning algorithm) may be either of the form of an ordered or unordered set of rules. The latter seems to be more understandable by humans and directly applicable in most expert systems, or generally, any decision- supporting one. However, classification utilizing the unordered-mode decision set may be accompanied by some conflict situations, particularly when several rules belonging to different classes match (are satisfied by, “fire” for) an input to-be-classified (unseen) object. One of the possible solutions to this conflict is to associate each decision rule induced by a learning algorithm with a numerical factor, which is commonly called the rule quality (An & Cercone, 2001; Bergadano et al., 1988; Bruha, 1997; Kononenko, 1992; Mingers, 1989; Tkadlec & Bruha, 2003). This article first briefly introduces the underlying principles for defining rules qualities, including statistical tools such as contingency tables and then surveys empirical and statistical formulas of the rule quality and compares their characteristics. Afterwards, it presents an application of a machine learning algorithm utilizing various formulas of the rule qualities in medical area.
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.008 | 0.021 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".