Alternative Method of Constructing Granular Neural Networks
Bibliographic record
Abstract
Utilizing granular computing to enhance artificial neural network architecture, a new type of network emerges—the granular neural network (GNN). GNNs offer distinct advantages over their traditional counterparts: The ability to process both numerical and granular data, leading to improved interpretability. This paper proposes a novel design method for constructing GNNs, drawing inspiration from existing interval-valued neural networks built upon NNNs. However, unlike the proposed algorithm in this work, which employs interval values or triangular fuzzy numbers for connections, existing methods rely on a pre-defined numerical network. This new method utilizes a uniform distribution of information granularity to granulate connections with unknown parameters, resulting in independent GNN structures. To quantify the granularity output of the network, the product of two common performance indices is adopted: The coverage of numerical data and the specificity of information granules. Optimizing this combined performance index helps determine the optimal parameters for the network. Finally, the paper presents the complete model construction and validates its feasibility through experiments on datasets from the UCI Machine Learning Repository. The results demonstrate the proposed algorithm’s effectiveness and promising performance.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".