Multi-visual pattern mining algorithm based on variational inference Gaussian mixture and pattern activation response map model
Bibliographic record
Abstract
Multi-visual pattern mining plays an important role in image classification, retrieval, and other fields. A multi visual pattern mining algorithm based on variational inference Gaussian mixture model and pattern activation response graph is introduced to address the issues of insufficient frequency and discriminability faced by traditional algorithms. The innovation of this algorithm lies in combining variational inference Gaussian mixture model with pattern activation response graph. The former solves the limitation of manually presetting the number of modes in traditional methods by determining the optimal number of modes to ensure frequency. The latter improves discriminability by capturing key areas of the image, solving the problem of traditional algorithms being difficult to balance the two and distinguish multiple patterns within the same category. The results showed that in quantitative analysis, the algorithm had a high frequency of 92.81% when the similarity threshold was 0.866 on the Canadian Institute for Advanced Research-10 dataset. On the Travel dataset, the classification accuracy and F1 value were as high as 95.36% and 94.17%, respectively, which were significantly higher than other algorithms. The proposed multi-visual pattern mining algorithm has high frequency and discriminability, which can provide a more comprehensive visual representation and help better mine images of the same category but different visual patterns. This algorithm provides technical support for image classification and retrieval.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".