Granular computing approach for the ordinal semantic weighted multiscale values for the attributes in formal concept analysis algorithm
Post-publication record
Source: Retraction Watch, joined by DOI. OpenAlex records retraction as is_retracted, a boolean over a state space with at least four values, so it cannot express an expression of concern, a correction or a reinstatement; it reports them as false, which reads as “fine”.
Bibliographic record
Abstract
In literature granular computing and formal concept analysis algorithm use only single-value attributes to knowledge discovery for the data of spatio-temporal aspects. However, most of the datasets like forest fires and tornado storms involve multiscale values for attributes. The limitation of single-value attributes of the existing approaches indicates only the data related to event occurrence which may be missing the elicitation of important knowledge related to severity of event occurrence. Motivated by these limitations, this research article proposes a novel and generalized method which uses ordinal semantic weighted multiscale values for attributes in formal concept analysis with granular computing measures especially when spatio-temporal attributes are not given. The originality of proposed methodology is using ordinal semantic weighted multiscale values for attributes that give complete information of event occurrences. Moreover, the use of ordinal semantic weighted multiscale values improves the results of granular computing measures. The significance of proposed approach is well explained by experimental evaluation performed on publicly available datasets on storm occurring in different States of America.
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.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".