| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 11
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
Probability and certainty in the performance of evolutionary and swarm optimization algorithms
Nikola Ivković, Robert Kudelić, Matej Črepinšek, 2022, izvirni znanstveni članek

Opis: Reporting the empirical results of swarm and evolutionary computation algorithms is a challenging task with many possible difficulties. These difficulties stem from the stochastic nature of such algorithms, as well as their inability to guarantee an optimal solution in polynomial time. This research deals with measuring the performance of stochastic optimization algorithms, as well as the confidence intervals of the empirically obtained statistics. Traditionally, the arithmetic mean is used for measuring average performance, but we propose quantiles for measuring average, peak and bad-case performance, and give their interpretations in a relevant context for measuring the performance of the metaheuristics. In order to investigate the differences between arithmetic mean and quantiles, and to confirm possible benefits, we conducted experiments with 7 stochastic algorithms and 20 unconstrained continuous variable optimization problems. The experiments showed that median was a better measure of average performance than arithmetic mean, based on the observed solution quality. Out of 20 problem instances, a discrepancy between the arithmetic mean and median happened in 6 instances, out of which 5 were resolved in favor of median and 1 instance remained unresolved as a near tie. The arithmetic mean was completely inadequate for measuring average performance based on the observed number of function evaluations, while the 0.5 quantile (median) was suitable for that task. The quantiles also showed to be adequate for assessing peak performance and bad-case performance. In this paper, we also proposed a bootstrap method to calculate the confidence intervals of the probability of the empirically obtained quantiles. Considering the many advantages of using quantiles, including the ability to calculate probabilities of success in the case of multiple executions of the algorithm and the practically useful method of calculating confidence intervals, we recommend quantiles as the standard measure of peak, average and bad-case performance of stochastic optimization algorithms.
Ključne besede: algorithmic performance, experimental evaluation, metaheuristics, quantile, confidence interval, stochastic algorithms, evolutionary computation, swarm intelligence, experimental methodology
Objavljeno v DKUM: 28.03.2025; Ogledov: 0; Prenosov: 7
.pdf Celotno besedilo (490,48 KB)
Gradivo ima več datotek! Več...

2.
Maximum number of generations as a stopping criterion considered harmful
Miha Ravber, Shih-Hsi Liu, Marjan Mernik, Matej Črepinšek, 2022, izvirni znanstveni članek

Opis: Evolutionary algorithms have been shown to be very effective in solving complex optimization problems. This has driven the research community in the development of novel, even more efficient evolutionary algorithms. The newly proposed algorithms need to be evaluated and compared with existing state-of-the-art algorithms, usually by employing benchmarks. However, comparing evolutionary algorithms is a complicated task, which involves many factors that must be considered to ensure a fair and unbiased comparison. In this paper, we focus on the impact of stopping criteria in the comparison process. Their job is to stop the algorithms in such a way that each algorithm has a fair opportunity to solve the problem. Although they are not given much attention, they play a vital role in the comparison process. In the paper, we compared different stopping criteria with different settings, to show their impact on the comparison results. The results show that stopping criteria play a vital role in the comparison, as they can produce statistically significant differences in the rankings of evolutionary algorithms. The experiments have shown that in one case an algorithm consumed 50 times more evaluations in a single generation, giving it a considerable advantage when max gen was used as the stopping criterion, which puts the validity of most published work in question.
Ključne besede: evolutionary algorithms, stopping criteria, benchmarking, algorithm termination, algorithm comparison
Objavljeno v DKUM: 28.03.2025; Ogledov: 0; Prenosov: 2
.pdf Celotno besedilo (1,40 MB)
Gradivo ima več datotek! Več...

3.
4.
Nature-inspired algorithms for hyperparameter optimization : magistrsko delo
Filip Glojnarić, 2019, magistrsko delo

Opis: This master thesis is focusing on the utilization of nature-inspired algorithms for hyperparameter optimization, how they work and how to use them. We present some existing methods for hyperparameter optimization as well as propose a novel method that is based on six different nature-inspired algorithms: Firefly algorithm, Grey Wolf Optimizer, Particle Swarm Optimization, Genetic algorithm, Differential Evolution, and Hybrid Bat algorithm. We also show the optimization results (set of hyperparameters) for each algorithm and we present the plots of the accuracy for each combination and handpicked one. In discussion of the results, we provide the answers on our research questions as well as propose ideas for future work.
Ključne besede: artificial intelligence, artificial neural networks, machine learning, nature-inspired algorithms, evolutionary algorithms
Objavljeno v DKUM: 09.12.2019; Ogledov: 2232; Prenosov: 122
.pdf Celotno besedilo (969,13 KB)

5.
Šahovski sistem rangiranja za primerjavo evolucijskih algoritmov : doktorska disertacija
Niki Veček, 2016, doktorska disertacija

Opis: Eksperiment na področju evolucijskega računanja lahko povzamemo s štirimi pomembnimi koraki: načrtovanje eksperimenta, zagon eksperimenta, analiza rezultatov ter interpretacija rezultatov in diskusija. Vsak korak zahteva posebno pozornost in vsebuje določene pasti, na katere moramo kot raziskovalci biti pozorni. Disertacija podrobno opiše vse štiri korake, s posebnim poudarkom na statistični analizi rezultatov, in predstavi novo metodo za primerjavo evolucijskih algoritmov - Chess Rating System for Evolutionary Algorithms (CRS4EAs). Predlagana metoda temelji na šahovskem rangiranju, kjer je vsak evolucijski algoritem predstavljen kot šahovski igralec, vsaka primerjava rešitev dveh algoritmov predstavlja igro med dvema igralcema (in se lahko konča z zmago enega in porazom drugega ali remijem), vsaka parna primerjava med več algoritmi pa predstavlja turnir. Osnova za predlagano metodo je šahovski sistem rangiranja Glicko-2, za katerega tekom disertacije tudi pokažemo, da je najprimernejši. Predlagano metodo skozi velik nabor eksperimentov primerjamo s statističnimi testi z ničelno hipotezo in pokažemo, da lahko s predlagano metodo učinkovito primerjamo uspešnosti evolucijskih algoritmov. Predlagana metoda najde podobne signifikantne razlike kot bi jih našli z uporabo standardnih statističnih metod, hkrati pa omogoča absolutno vrednotenje moči in uspešnosti algoritmov, ki so vključeni v sistem. Predlagano metodo na učinkovit način uporabimo za uglaševanje parametrov evolucijskega algoritma in jo skozi nabor več eksperimentov primerjamo z drugimi metodami uglaševanja (F-Race in Revac).
Ključne besede: evolutionary algorithms, computational experiment, null hypothesis, glicko, chess rating
Objavljeno v DKUM: 14.09.2016; Ogledov: 1966; Prenosov: 255
.pdf Celotno besedilo (15,24 MB)

6.
Predicting defibrillation success by "genetic" programming in patients with out-of-hospital cardiac arrest
Matej Podbregar, Miha Kovačič, Aleksandra Podbregar-Marš, Miran Brezočnik, 2003, izvirni znanstveni članek

Opis: In some patients with ventricular fibrillation (VF) there may be a better chance of successful defibrillation after a period of chest compression and ventilation before the defibrillation attempt. It is therefore important to know whether a defibrillation attempt will be successful. The predictive powerof a model developed by "genetic" programming (GP) to predict defibrillation success was studied. Methods and Results: 203 defibrillations were administered in 47 patients with out-of-hospital cardiac arrest due to a cardiac cause. Maximal amplitude, a total energy of power spectral density, and the Hurst exponent of the VF electrocardiogram (ECG) signal were included in the model developed by GP. Positive and negative likelihood ratios of the model for testing data were 35.5 and 0.00, respectively. Using a model developed by GP on the complete database, 120 of the 124 unsuccessful defibrillations would have been avoided, whereas all of the 79 successful defibrillations would have been administered. Conclusion: The VF ECG contains information predictive of defibrillation success. The model developed by GP, including data from the time-domain, frequency-domain and nonlinear dynamics, could reduce the incidence of unsuccessful defibrillations.
Ključne besede: optimisation methods, evolutionary optimisation methods, genetic algorithms, genetic programming, defibrillation, cardiac arrest prediction
Objavljeno v DKUM: 01.06.2012; Ogledov: 2046; Prenosov: 107
URL Povezava na celotno besedilo

7.
A model of data flow in lower CIM levels
Igor Drstvenšek, Ivo Pahole, Jože Balič, 2004, izvirni znanstveni članek

Opis: After years of work in fields of computer-integrated manufacturing (CIM), flexible manufacturing systems (FMS), and evolutionary optimisation techniques, several models of production automation were developed in our laboratories. The last model pools the discoveries that proved their effectiveness in the past models. It is based on the idea of five levels CIM hierarchy where the technological database (TDB) represents a backbone of the system. Further on the idea of work operation determination by an analyse of the production system is taken out of a model for FMS control system, and finally the approach to the optimisation of production is supported by the results of evolutionary based techniques such as genetic algorithms and genetic programming.
Ključne besede: computer integrated manufacturing, flexible manufacturing systems, evolutionary optimisation techniques, production automation, CIM hierarchy, technological databases, production optimisation, genetic algorithms, genetic programming
Objavljeno v DKUM: 01.06.2012; Ogledov: 2248; Prenosov: 106
URL Povezava na celotno besedilo

8.
Prediction of maintenance of sinus rhythm after electrical cardioversion of atrial fibrillation by non-deterministic modelling
Petra Žohar, Miha Kovačič, Miran Brezočnik, Matej Podbregar, 2005, izvirni znanstveni članek

Opis: Atrial fibrillation (AF) is the most common rhythm disorder. Because of the high recurrence rate of AF after cardioversion and because of potential side effects of electrical cardioversion, it is clinically important to predict persistence of sinus rhythm after electrical cardioversion before it is attempted. The aim of our study was the development of a mathematical model by"genetic" programming (GP), a non-deterministic modelling technique, which would predict maintenance of sinus rhythm after electrical cardioversion of persistent AF. PATIENTS AND METHODS: Ninety-seven patients with persistent AF lasting more than 48 h, undergoing the first attempt at transthoracic cardioversion were included in this prospective study. Persistence of AF before the cardioversion attempt, amiodarone treatment, left atrial dimension,mean, standard deviation and approximate entropy of ECG R-R intervals were collected. The data of 53 patients were randomly selected from the database and used for GP modelling; the other 44 data sets were used for model testing. RESULTS: In 23 patients sinus rhythm persisted at 3 months. In the other 21 patients sinus rhythm was not achieved or its duration was less than 3 months. The model developed by GP failed to predict maintenance ofsinus rhythm at 3 months in one patient and in six patients falsely predicted maintenance of sinus rhythm. Positive and negative likelihood ratiosof the model for testing data were 4.32 and 0.05, respectively. Using this model 15 of 21 (71.4%) cardioversions not resulting in sinus rhythm at 3 months would have been avoided, whereas 22 of 23 (95.6%) cardioversions resulting in sinus rhythm at 3 months would have been administered. CONCLUSION: This model developed by GP, including clinical data, ECG data from the time-domain and nonlinear dynamics can predict maintenance of sinus rhythm. Further research is needed to explore its utility in the present or anexpanded form.
Ključne besede: optimisation methods, evolutionary optimisation methods, genetic algorithms, genetic programming, defibrillation, cardiac arrest prediction, atrial fibrillation, electrical cardioversion, prediction
Objavljeno v DKUM: 01.06.2012; Ogledov: 2352; Prenosov: 85
URL Povezava na celotno besedilo

9.
10.
Hybridization of evolutionary algorithms
Iztok Fister, Marjan Mernik, Janez Brest, 2011, samostojni znanstveni sestavek ali poglavje v monografski publikaciji

Ključne besede: hybridization, evolutionary algorithms, heuristic algorithms
Objavljeno v DKUM: 01.06.2012; Ogledov: 2339; Prenosov: 83
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.2 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici