A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="http://ais.khpi.edu.ua/article/download/2522-9052.2018.3.03/146956">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="National Technical University Kharkiv Polytechnic Institute">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qe4azhfienaffmupjqgxdv5qvm" style="color: black;">Advanced Information Systems</a>
The issue of machine learning has been paying more attention in all areas of information technology in recent times. On the one hand, this is due to the rapid growth of requirements for future specialists, and on the other -with the very rapid development of information technology and Internet communications. One of the main tasks of e-learning is the task of classification. For this type of task, the method of machine learning called gradient boost is very well suited. Grading boosting is a<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.20998/2522-9052.2018.3.03">doi:10.20998/2522-9052.2018.3.03</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h3wkh55yvjck3nfd43z4hcip44">fatcat:h3wkh55yvjck3nfd43z4hcip44</a> </span>
more »... ily of powerful machine learning algorithms that have proven significant success in solving practical problems. These algorithms are very flexible and easily customized for the specific needs of the program, for example, they are studied in relation to different loss functions. The idea of boosting is the iterative process of sequential building of private models. Each new model learns based on information about errors made in the previous stage, and the resulting function is a linear combination of the whole ensemble of models, taking into account minimization of any penalty function. The mathematical apparatus of gradient boosting is well adapted for the solution of the classification problem. However, as the number of input data increases, the issue of reducing the construction time of the ensemble of decision trees becomes relevant. Using parallel computing systems and parallel programming technologies can produce positive results, but requires the development of new methods for constructing gradient boosting. The article reveals the main stages of the method of parallel construction of gradient boosting for solving the classification problem in e-learning. Unlike existing ones, the method allows to take into account the features of architecture and the organization of parallel processes in computing systems with shared and distributed memory. The method takes into account the possibility of evaluating the efficiency of building an ensemble of decision trees and parallel algorithms. Obtaining performance indicators for each iteration of the method helps to select the rational number of parallel processors in the computing system. This allows for a further reduction of the completion time of the gradient boosting. The simulation with the use of MPI parallel programming technology, the Python programming language for the architecture of the DM-MIMD system, confirms the reliability of the results. Here is an example of the organization of input data. Presented by Python is a program for constructing gradient boosting. The developed visualization of the obtained estimates of performance indicators allows the user to select the necessary configuration of the computing system. K e ywor d s : gradient boosting; parallel algorithm; decision tree; estimation of parallel algorithm efficiency; e-learning.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220309183645/http://ais.khpi.edu.ua/article/download/2522-9052.2018.3.03/146956" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/44/ae44e03289ce7e1d773bbea90f6f2ccc9e149d66.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.20998/2522-9052.2018.3.03"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>