Bibliographic record
Abstract
The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indiscernibility reveals the similarities. By considering them together in a same framework, one is able to obtain new insight of data. The main objective of the paper is to apply discernibility and indiscernibility to conflict analysis, a theory dealing with opinions of a set of agents on a set of issues. In particular, we are interested in the problem of issue reduction, so that a reduced set of issues can be obtained without loss of crucial information of the original set of issues. Extending the results from rough set theory, three types of issue reducts are introduced. They correspond to discernibility, indiscernibility, and discernibility-and-indiscernibility reducts, respectively. The results of this paper may offer a new research direction in rough set analysis in general, and conflict analysis in particular.
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.010 | 0.039 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.008 | 0.004 |
| Science and technology studies | 0.001 | 0.005 |
| Scholarly communication | 0.005 | 0.008 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".