A Deep Learning-Based Cluster Analysis Method for Large-Scale Multi-Label Images
Bibliographic record
Abstract
Large-scale multi-label image classification requires determining the presence or absence of a target object in a large number of sample images. For highly specialized and complex multi-label image sets, it is especially important to ensure the accuracy of image classification. Traditional deep learning models usually don’t take into account image-label correlation constraints when classifying multi-label images, and the strategy of classifying images based only on their own features greatly limits the model performance. In this context, this paper focuses a deep learning-based cluster analysis method for large-scale multi-label images. We constructed a model for large-scale multi-label image category recognition, which consists of a global image feature extraction module, a feature activation vector generation module and an image category inter-label connection module. Using a graph convolutional network (GCN), we aggregated the information of image category label nodes in the constructed multi-label graph structure, while exploring the correlation between image category labels. A detailed description is presented on how to introduce the attention mechanism into the constructed model mentioned above for image category recognition. Experimental results have validated the effectiveness of the constructed model.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".