Paper covers image classification using the Keras API in TensorFlow. The dataset used is a set of labelled images consisting of characters from the Pokémon media franchise. In order to artificially generate additional data, the process of data augmentation has been applied on the initial dataset to reduce overfitting. A comparison between DenseNet-121, DenseNet-169 and DenseNet-201 has been made to observe which of the models scores a greater accuracy. A Graphics Processing Unit (GPU) has been set up to work with TensorFlow in order to efficiently train the model.

This paper presents the use of different prediction algorithms in order to recognise the popularity of a song. That recognition gives features that are directly affecting popularity of a song. For this research, data from several hundreds of the most popular songs were used in combination with songs that often appear on different playlists from different musicians. The reason for this mixing of songs is done to ensure that the model works as efficiently as possible by comparing popular songs features with those of that are no longer trending. The processing of the collected data gave an excellent insight into the importance of certain factors on the popularity of a certain song. As a result of research, month of release, acoustics and tempo were represented as features that are mostly correlated with popularity. Through the processing and analysis of a large amount of data, four models were created using different algorithms. Algorithms that were used are Decision Tree, Nearest Neighbour Classifier, Random Forest and Support Vector Classifier algorithms. The best results were achieved by training the model with the Decision Tree algorithm and accuracy of 100%.

Predictive modelling and AI have become a ubiquitous part of many modern industries and provide promising opportunities for more accurate analysis, better decision-making, reducing risk and improving profitability. One of the most promising applications for these technologies is in the financial sector as these could be influential for fraud detection, credit risk, creditworthiness and payment analysis. By using machine learning algorithms for analysing larger datasets, financial institutions could identify patterns and anomalies that could indicate fraudulent activity, allowing them to take action in real-time and minimize losses. This paper aims to explore the application of predictive models for assessing customer worthiness, identify the benefits and risks involved with this approach and compare their results in order to provide insights into which model performs best in the given context.

—The problem of transport optimization is of great importance for the successful operation of distribution companies. To successfully find routes, it is necessary to provide accurate input data on orders, customer location, vehicle fleet, depots, and delivery restrictions. Most of the input data can be provided through the order creation process or the use of various online services. One of the most important inputs is an estimate of the unloading time of the goods for each customer. The number of customers that the vehicle serves during the day directly depends on the time of unloading. This estimate depends on the number of items, weight and volume of orders, but also on the specifics of customers, such as the proximity of parking or crowds at the unloading location. Customers repeat over time, and unloading time can be calculated from GPS data history. The paper describes the innovative application of machine learning techniques and delivery history obtained through a GPS vehicle tracking system for a more accurate estimate of unloading time. The application of techniques gave quality results and significantly improved the accuracy of unloading time data by 83.27% compared to previously used methods. The proposed method has been implemented for some of the largest distribution companies in Bosnia and Herzegovina.

Vehicle Routing Problem (VRP) is the process of set selection of the most convenient route in a network of roads vehicles are supposed to drive along when serving customers. Although vehicle problems solutions are being researched and improved in science, this problem is also important in industry, and the reason is the potential reduction of the shipping cost. Transport management is the central problem in logistics of one company, and the choice of optimal routes is one of the crucial functions in that process. However, as much as routes are algorithmically optimal, and as much as they include predefined limitations, there are some factors in the realistic environment which perhaps are not adequately treated during the creating the given routes. The innovative approach of adjustment of most of the parameters and factors necessary for the VRP algorithms being used in reality is presented in this work. It is based on the principle of successful feasibility of the given routs in realistic environment. The feasibility of the routes on the realistic example of one of the greatest distribution companies in Bosnia and Herzegovina has been significantly increased by introducing the realistic settings and improvements by comparative results before and after the introduction of the suggested modifications.

Vehicle routing problem as the generalization of the Travelling Salesman Problem (TSP) is one of the most studied optimization problems. Industry itself pays special attention to this problem, since transportation is one of the most crucial segments in supplying goods. This paper presents an innovative cluster-based approach for the successful solving of real-world vehicle routing problems that can involve extremely complex VRP problems with many customers needing to be served. The validation of the entire approach was based on the real data of a distribution company, with transport savings being in a range of 10-20 %. At the same time, the transportation routes are completely feasible, satisfying all the realistic constraints and conditions.

The rapid development of financial markets results in data variability and unpredictability. Anomaly detection in financial data is a very important issue. Finding anomalies can result in error reduction and corrections in due time. The main aim of this research was to find anomalies in general ledgers of a real company in Bosnia and Herzegovina. Anomalies are defined as input errors of accountants. Main concepts of anomaly detection are defined, a summary of the current progress is given, and challenges of future work are presented. Cluster-based and histogram-based anomaly detections were performed on a real-life dataset of a microcredit organization. Results of algorithms were presented, as well as results achieved using synthetic data.