An Innovative Method for Attribute Reduction: Weighted Attribute Concepts for Probabilistic Analysis of Decision Attributes
Bibliographic record
Abstract
Attribute reduction, a seminal aspect of data analysis, primarily hinges on the indiscernibility matrix.Previous studies have explored the weight of an attribute via various methods, yet achieving optimal reduction remains elusive.This study proposes a novel approach to optimal reduction, leveraging the concept of weighted attributes based on the probability values of core and non-core elements.This approach scrutinizes the accuracy of both core and non-core attributes, thereby enhancing our comprehension of the object's attributes.The weighted attribute concept is derived in light of entropy information and the indiscernibility matrix.A discernibility matrix aids in ascertaining the reduct, whereas entropy information facilitates the analysis of the weight of uncertain data.By deploying decision attributes, we derive the core and its corresponding probabilistic value, establishing an algebraic structure as an ordered pair of objects with associated weight concepts.This structure further enables the investigation of the consistency set and the join (meet) irreducible set employing weighted attribute concepts.Ultimately, optimal reduction is determined by the weight of non-core elements, allowing a comprehensive analysis of the information system and procurement of its essential attributes for decision-making.The proposed concept of weighted attributes is elucidated using a biological dataset.
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.011 | 0.022 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.004 |
| Bibliometrics | 0.006 | 0.006 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.001 | 0.005 |
| 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".