Logo

Publikacije (56)

Nazad

The planning of concert tours can be a challenging process which requires a large amount of data to be analyzed. The greatest profit cannot be obtained only by maximizing the expected number of visitors. However, most of the organizers mainly focus on that part of planning. To achieve the maximum profit possible, organizers must include other data in their analysis. Social media play a powerful role in music industry. Most of the mentioned data can be found online on social media like Facebook, YouTube or Instagram. Such data can be found in analytic sections of fan or event pages. In this paper, algorithms for tour planning have been introduced by using above mentioned data. Proposed algorithms are based on heuristic methods such as simulated annealing and genetic algorithm. A clustering based method is also implemented. Aforementioned algorithms were tested on real-world instances from Facebook fan page analytics and use number of fans and distance between cities.

Many users need social media platforms to improve business. The usage of those platforms is usually focused on the marketing and customer targeting. Platforms like Facebook, Instagram or YouTube give their users a large number of reports and analytic tools. Public figures and organizations have a large number of followers who generate a significant number of activities. This paper focuses on the use of Facebook's geography analytic in the process of events planning. The problem is formulated as a combinatorial optimization problem. Data from social media platforms are used as an input to nature-inspired optimization algorithm. A public data set has been created with cities from 20 European countries. An adjusted genetic algorithm (AGA) is proposed. The greedy approach and AGA are compared on real data from several Facebook pages and on the created public dataset. The genetic algorithm shows better results and it gives the same solution as an exhaustive search for smaller instances.

V. Mešić, K. Neumann, I. Aviani, E. Hasović, W. Boone, N. Erceg, V. Grubelnik, A. Sušac et al.

A 32-item scale that can be used to measure physics students' understanding of introductory level wave optics.

Adis Alihodžić, Eva Tuba, D. Simian, Viktor Tuba, M. Tuba

Single hidden layer feed forward neural networks are widely used for various practical problems. However, the training process for determining synaptic weights of such neural networks can be computationally very expensive. In this paper we propose a new learning algorithm for learning the synaptic weights of the single hidden layer feedforward neural networks in order to reduce the learning time. We propose combining the upgraded bat algorithm with the extreme learning machine. The proposed approach reduces the number of evaluations needed to train a neural network and efficiently finds optimal input weights and the hidden biases. The proposed algorithm was tested on standard benchmark classification problems and functions and compared with other approaches from literature. The results have shown that our approach produces a satisfactory performance in almost all cases and that it can obtains solutions much faster than the traditional learning algorithms.

Eva Tuba, R. Jovanovic, Romana Capor-Hrosik, Adis Alihodžić, M. Tuba

Data mining and clustering are important elements of various applications in different fields. One of the areas were clustering is rather frequently used is web intelligence, which nowadays represents an important research area. Data collected from the web are usually very complex, dynamic, without structure and rather large. Traditional clustering techniques are not efficient enough and need to be improved. In this paper, we propose combination of recent swarm intelligence algorithm, bare bones fireworks algorithm, and k-means for clustering web intelligence data. The proposed method was compared with other approaches from literature. Based on the experimental results, it can be concluded that the proposed method has very promising characteristics in terms of the quality of clustering, as well as the execution time.

Nema pronađenih rezultata, molimo da izmjenite uslove pretrage i pokušate ponovo!

Pretplatite se na novosti o BH Akademskom Imeniku

Ova stranica koristi kolačiće da bi vam pružila najbolje iskustvo

Saznaj više