POSSIBILITIES OF DIGITIZING AND APPLYING ARTIFICIAL INTELLIGENCE TO NATIONAL OCCUPATIONAL CLASSIFICATION (NOC-2025) IN UZBEKISTAN
Bibliographic record
Abstract
This article examines the process of digitizing National Occupational Classification (NOC-2025) in Uzbekistan, developed on the basis of the International Standard Classification of Occupations (ISCO-08), and the possibilities of applying artificial intelligence technologies to it. Although this classification exists today in a national form, and its digitization and the introduction of artificial intelligence elements to it based on modern technologies remain a pressing issue. In order to digitize the classification, international systems such as the International Standard Classification of Occupations (ISCO-08, ILO), European Skills, Competences, Qualifications and Occupations (ESCO), Occupational Information Network (O*NET, USA) and National Occupational Classification (NOC, Canada) have been analysed, and their approaches to digitization, automation and the application of artificial intelligence technologies has been studied. The results of the study show that digitizing the NOC-2025 classification based on artificial intelligence will expand the possibilities for effective management of the Uzbek labour market, the quick addition of new professions to the classification, and the recognition of professional qualifications in international labour migration processes.
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.005 | 0.014 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.009 | 0.009 |
| Science and technology studies | 0.004 | 0.002 |
| Scholarly communication | 0.004 | 0.002 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| 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".