Вісники НТУ "ХПІ"
Постійне посилання на розділhttps://repository.kpi.kharkov.ua/handle/KhPI-Press/2494
З 1961 р. у ХПІ видається збірник наукових праць "Вісник Харківського політехнічного інституту".
Згідно до наказу ректора № 158-1 від 07.05.2001 року "Про упорядкування видання вісника НТУ "ХПІ", збірник був перейменований у Вісник Національного Технічного Університету "ХПІ".
Вісник Національного технічного університету "Харківський політехнічний інститут" включено до переліку спеціалізованих видань ВАК України і виходить по серіях, що відображають наукові напрямки діяльності вчених університету та потенційних здобувачів вчених ступенів та звань.
Зараз налічується 30 діючих тематичних редколегій. Вісник друкує статті як співробітників НТУ "ХПІ", так і статті авторів інших наукових закладів України та зарубіжжя, які представлені у даному розділі.
Переглянути
3 результатів
Результати пошуку
Документ Adaptation of LambdaMART model to semi-supervised learning(Національний технічний університет "Харківський політехнічний інститут", 2023) Yamkovyi, Klym SerhiyovychThe problem of information searching is very common in the age of the internet and Big Data. Usually, there are huge collections of documents and only multiple percent of them are relevant. In this setup brute-force methods are useless. Search engines help to solve this problem optimally. Most engines are based on learning to rank methods, i.e. first of all algorithm produce scores for documents based on they feature and after that sorts them according to the score in an appropriate order. There are a lot of algorithms in this area, but one of the most fastest and a robust algorithm for ranking is LambdaMART. This algorithm is based on boosting and developed only for supervised learning, where each document in the collection has a rank estimated by an expert. But usually, in this area, collections contain tons of documents and their annotation requires a lot of resources like time, money, experts, etc. In this case, semi-supervised learning is a powerful approach. Semi-supervised learning is an approach to machine learning that combines a small amount of labeled data with a large amount of unlabeled data during training. Unlabeled data, when used in combination with a small quantity of labeled data, can produce significant improvement in learning accuracy. This paper is dedicated to the adaptation of LambdaMART to semi-supervised learning. The author proposes to add different weights for labeled and unlabeled data during the training procedure to achieve higher robustness and accuracy. The proposed algorithm was implemented using Python programming language and LightGBM framework that already has supervised the implementation of LambdaMART. For testing purposes, multiple datasets were used. One synthetic 2D dataset for a visual explanation of results and two real-world datasets MSLR-WEB10K by Microsoft and Yahoo LTRC.Документ Failure rate regression model building from aggregated data using kernel-based machine learning(Національний технічний університет "Харківський політехнічний інститут", 2022) Akhiiezer, Olena Borisivna; Grinberg, Galyna Leonidivna; Lyubchyk, Leonid Mykhailovych; Yamkovyi, Klym SerhiyovychThe problem of regression model building of equipment failure rate using datasets containing information on number of failures of recoverable systems and measurements of technological and operational factors affecting the reliability of production system is considered. This problem is important for choosing optimal strategy for preventive maintenance and restoration of elements of process equipment, which, in turn, significantly affects the efficiency of production management system. From a practical point of view, of greatest interest is the development of methods for regression models building to assess the impact of various technological and operational factors controlled during system operation on failure rate. The usual approach to regression models construction involves preselecting the model structure in the form of a parameterized functional relationship between failure rate and affecting technological variables followed by statistical estimation of unknown model parameters or training the model on datasets of measured covariates and failures.The main problem lies precisely in the choice of model structure, the complexity of which should correspond to amount of data available for training model, which in the problem of failure rate modeling is greatly complicated by lack of a priori information about its dependence on affecting variables. In this work, such a problem is solved using machine learning methods, namely, kernel ridge regression, which makes it possible to effectively approximate complex nonlinear dependences of equipment failure rate on technological factors, while there is no need to pre-select the model structure. Preliminary aggregation of data by combination of factor and cluster analysis can significantly simplify model structure. The proposed technique is illustrated by solving a practical problem of failure rate model building for semiconductor production equipment based on real data.Документ Development and comparative analysis of semi-supervised learning algorithms on a small amount of labeled data(Національний технічний університет "Харківський політехнічний інститут", 2021) Yamkovyi, KlymThe paper is dedicated to the development and comparative experimental analysis of semi-supervised learning approaches based on a mix of unsupervised and supervised approaches for the classification of datasets with a small amount of labeled data, namely, identifying to which of a set of categories a new observation belongs using a training set of data containing observations whose category membership is known. Semi-supervised learning is an approach to machine learning that combines a small amount of labeled data with a large amount of unlabeled data during training. Unlabeled data, when used in combination with a small quantity of labeled data, can produce significant improvement in learning accuracy.The goal is semi-supervised methods development and analysis along with comparing their accuracy and robustness on different synthetics datasets. The proposed approach is based on the unsupervised K-medoids methods, also known as the Partitioning Around Medoid algorithm, however, unlike K-medoids the proposed algorithm first calculates medoids using only labeled data and next process unlabeled classes – assign labels of nearest medoid. Another proposed approach is the mix of the supervised method of K-nearest neighbor and unsupervised K-Means. Thus, the proposed learning algorithm uses information about both the nearest points and classes centers of mass. The methods have been implemented using Python programming language and experimentally investigated for solving classification problems using datasets with different distribution and spatial characteristics. Datasets were generated using the scikit-learn library. Was compared the developed approaches to find average accuracy on all these datasets. It was shown, that even small amounts of labeled data allow us to use semi-supervised learning, and proposed modifications ensure to improve accuracy and algorithm performance, which was demonstrated during experiments. And with the increase of available label information accuracy of the algorithms grows up. Thus, the developed algorithms are using a distance metric that considers available label information.