Work place: Department of Mathematical Problems of Control and Cybernetics, Chernivtsi National University, Chernivtsi, Ukraine
E-mail: minkov.kostiantyn@chnu.edu.ua
Website:
Research Interests: Deep Learning
Biography
Kostiantyn O. Minkov was born in Ukraine on January 29, 2000. In 2019 he graduated with honors from Chernivtsi Polytechnic College (Chernivtsi, Ukraine). In 2021 he received his Bachelor’s degree from Yuriy Fedkovych Chernivtsi National University (Chernivtsi, Ukraine) by specialty Computer Science. In 2022 he received his Master’s degree from Yuriy Fedkovych Chernivtsi National University (Chernivtsi, Ukraine). Currently, he is a PhD student at Yuriy Fedkovych Chernivtsi National University by specialty Software Engineering. His PhD research focuses on the application of Active Learning methods in weakly supervised learning tasks. Since the beginning of his PhD studies, he has been working as an assistant at the Department of Mathematical Problems of Control and Cybernetics (Yuriy Fedkovych Chernivtsi National University, Chernivtsi, Ukraine). Research interests are Active Learning, weakly supervised machine learning, computer vision, and deep learning.
He has published research papers in peer-reviewed journals.
By Kostiantyn O. Minkov Igor V. Malyk
DOI: https://doi.org/10.5815/ijisa.2026.03.05, Pub. Date: 8 Jun. 2026
Modern machine learning models typically require large amounts of precisely labeled data to perform effectively. However, obtaining such labels is time-consuming and costly, especially in specialized domains such as medical image analysis and document classification, where unlabeled data is abundant but expert annotation is scarce. This paper addresses the problem of learning from very few labeled examples by jointly leveraging weak supervision, active learning (AL), and semi-supervised learning (SSL). A hybrid framework is proposed in which a small set of informative samples is actively selected for manual annotation using an entropy-based acquisition function combined with weak label disagreement scoring, while a large pool of unlabeled or weakly labeled data is exploited through SSL based on the FixMatch algorithm. The approach iteratively corrects noisy labels and refines the model with minimal human involvement. The framework is evaluated using a ResNet-18 classifier on the CIFAR-10 benchmark dataset and is compared against two baselines: pure active learning and pure semi-supervised learning. Each method is run independently across three random seeds at the key active learning rounds, and accuracy is reported as mean ± standard deviation. Across three independent seeds, the hybrid framework consistently leads both baselines at intermediate labelling budgets, with the largest absolute gap at Round 15 (+1.27 percentage points over pure active learning, +1.35 percentage points over pure SSL). The framework also offers a clear label-efficiency advantage: at Round 15, with |D_L | = 6500 labels, the hybrid method already reaches 0.6792 ± 0.0097 test accuracy – exceeding the accuracies that pure active learning (0.6730 ± 0.0139) and pure SSL (0.6687 ± 0.0056) attain only at Round 20 with |D_L | = 7000. By Round 20 all three methods saturate near a common data ceiling, indicating that the integrated use of weak supervision, active learning, and consistency-based SSL is most valuable when the annotation budget is genuinely constrained.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals