Correlation between the time taken to master the competency and the rank of competence evaluated on the basic educational programme

The article deals with statistically important correlation between the time taken to master the competence and the rank of competence evaluated on the basic of educational programme "Soft engineering". The strength and the direction of correlation between these two characteristics was calculated using Pearson correlation coefficient. We estimated the empirical value of the correlation coefficient and the statistical significance of empirical value of the correlation coefficient using t-Student's criterion. It was shown that correlation between the time of competence mastering and the rank of competence is statistically important and the correlation is positive: the more significant competence, the more significant time for its mastering is needed

Correlation between the time taken to master the competency and the rank of competence evaluated on the basic educational programme

The article deals with statistically important correlation between the time taken to master the competence and the rank of competence evaluated on the basic of educational programme "Soft engineering". The strength and the direction of correlation between these two characteristics was calculated using Pearson correlation coefficient. We estimated the empirical value of the correlation coefficient and the statistical significance of empirical value of the correlation coefficient using t-Student's criterion. It was shown that correlation between the time of competence mastering and the rank of competence is statistically important and the correlation is positive: the more significant competence, the more significant time for its mastering is needed

K-Means Genetic Algorithms with Greedy Genetic Operators

The k-means problem is one of the most popular models of cluster analysis. The problem is NP-hard, and modern literature offers many competing heuristic approaches. Sometimes practical problems require obtaining such a result (albeit notExact), within the framework of the k-means model, which would be difficult to improve by known methods without a significant increase in the computation time or computational resources. In such cases, genetic algorithms with greedy agglomerative heuristic crossover operator might be a good choice. However, their computational complexity makes it difficult to use them for large-scale problems. The crossover operator which includes the k-means procedure, taking the absolute majority of the computation time, is essential for such algorithms, and other genetic operators such as mutation are usually eliminated or simplified. The importance of maintaining the population diversity, in particular, with the use of a mutation operator, is more significant with an increase in the data volume and available computing resources such as graphical processing units (GPUs). In this article, we propose a new greedy heuristic mutation operator for such algorithms and investigate the influence of new and well-known mutation operators on the objective function value achieved by the genetic algorithms for large-scale k-means problems. Our computational experiments demonstrate the ability of the new mutation operator, as well as the mechanism for organizing subpopulations, to improve the result of the algorithm

Visual Assessment of Cluster Tendency with Variations of Distance Measures

Finding the cluster structure is essential for analyzing self-organized networking structures, such as social networks. In such problems, a wide variety of distance measures can be used. Common clustering methods often require the number of clusters to be explicitly indicated before starting the process of clustering. A preliminary step to clustering is deciding, firstly, whether the data contain any clusters and, secondly, how many clusters the dataset contains. To highlight the internal structure of data, several methods for visual assessment of clustering tendency (VAT family of methods) have been developed. The vast majority of these methods use the Euclidean distance or cosine similarity measure. In our study, we modified the VAT and iVAT algorithms for visual assessment of the clustering tendency with a wide variety of distance measures. We compared the results of our algorithms obtained from both samples from repositories and data from applied problems

Clustering Algorithm with a Greedy Agglomerative Heuristic and Special Distance Measures

Automatic grouping (clustering) involves dividing a set of objects into subsets (groups) so that the objects from one subset are more similar to each other than to the objects from other subsets according to some criterion. Kohonen neural networks are a class of artificial neural networks, the main element of which is a layer of adaptive linear adders, operating on the principle of “winner takes all”. One of the advantages of Kohonen networks is their ability of online clustering. Greedy agglomerative procedures in clustering consistently improve the result in some neighborhood of a known solution, choosing as the next solution the option that provides the least increase in the objective function. Algorithms using the agglomerative greedy heuristics demonstrate precise and stable results for a k-means model. In our study, we propose a greedy agglomerative heuristic algorithm based on a Kohonen neural network with distance measure variations to cluster industrial products. Computational experiments demonstrate the comparative efficiency and accuracy of using the greedy agglomerative heuristic in the problem of grouping of industrial products into homogeneous production batches

Clustering Algorithm with a Greedy Agglomerative Heuristic and Special Distance Measures

Automatic grouping (clustering) involves dividing a set of objects into subsets (groups) so that the objects from one subset are more similar to each other than to the objects from other subsets according to some criterion. Kohonen neural networks are a class of artificial neural networks, the main element of which is a layer of adaptive linear adders, operating on the principle of “winner takes all”. One of the advantages of Kohonen networks is their ability of online clustering. Greedy agglomerative procedures in clustering consistently improve the result in some neighborhood of a known solution, choosing as the next solution the option that provides the least increase in the objective function. Algorithms using the agglomerative greedy heuristics demonstrate precise and stable results for a k-means model. In our study, we propose a greedy agglomerative heuristic algorithm based on a Kohonen neural network with distance measure variations to cluster industrial products. Computational experiments demonstrate the comparative efficiency and accuracy of using the greedy agglomerative heuristic in the problem of grouping of industrial products into homogeneous production batches

Forecasting <i>Dendrolimus sibiricus</i> Outbreaks: Data Analysis and Genetic Programming-Based Predictive Modeling

This study presents an approach to forecast outbreaks of Dendrolimus sibiricus, a significant pest affecting taiga ecosystems. Leveraging comprehensive datasets encompassing climatic variables and forest attributes from 15,000 taiga parcels in the Krasnoyarsk Krai region, we employ genetic programming-based predictive modeling. Our methodology utilizes Random Forest algorithm to develop robust forecasting model through integrated data analysis techniques. By optimizing hyperparameters within the predictive model, we achieved heightened accuracy, reaching a maximum precision of 0.9941 in forecasting pest outbreaks up to one year in advance