Research on the standardization strategy of granular computing
Bibliographic record
Abstract
As intelligent systems continue to evolve, problems are becoming increasingly complex. The constant abundance of data puts a higher demand on the value of data utilization. Granular computing is a new computational paradigm for complex problem-solving. It takes structured thinking, structured problem-solving methods, and structured information processing patterns as its research objects and belongs to the scope of higher-level human cognitive mechanism research. The development and application of granular computing must be more standardized and unified. The granular computing standardization strategy is the most direct means to promote the regularization of granular computing. In this paper, we first sort out the main applications of granular computing in standards. According to the characteristics of granular computing, a framework of its standard system is proposed to provide a reference for the subsequent research of granular computing standards. The next direction of the granular computing standards strategy is discussed, and solutions are given.
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.009 | 0.017 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.005 |
| Science and technology studies | 0.002 | 0.007 |
| Scholarly communication | 0.008 | 0.015 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| 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".