prikaz prve stranice dokumenta Algoritam diferencijalne evolucije za problem grupiranja podataka
  Download
PDF 1.26 MB
master's thesis
Algoritam diferencijalne evolucije za problem grupiranja podataka
2023. urn:nbn:hr:200:314646
Marjanović, Mihael
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Software Engineering
Chair of Programming Languages and Systems

Cite this document

Marjanović, M. (2023). Algoritam diferencijalne evolucije za problem grupiranja podataka (Master's thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:314646

Marjanović, Mihael. "Algoritam diferencijalne evolucije za problem grupiranja podataka." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2023. https://urn.nsk.hr/urn:nbn:hr:200:314646

Marjanović, Mihael. "Algoritam diferencijalne evolucije za problem grupiranja podataka." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2023. https://urn.nsk.hr/urn:nbn:hr:200:314646

Marjanović, M. (2023). 'Algoritam diferencijalne evolucije za problem grupiranja podataka', Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 24 April 2024, https://urn.nsk.hr/urn:nbn:hr:200:314646

Marjanović M. Algoritam diferencijalne evolucije za problem grupiranja podataka [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2023 [cited 2024 April 24] Available at: https://urn.nsk.hr/urn:nbn:hr:200:314646

M. Marjanović, "Algoritam diferencijalne evolucije za problem grupiranja podataka", Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:200:314646

Please login to the repository to save this object to your list.
Metadata
TitleAlgoritam diferencijalne evolucije za problem grupiranja podataka
Title (english)A differential evolution algorithm for data clustering
AuthorMihael Marjanović
MentorDražen Bajer (mentor)
Committee memberBruno Zorić (predsjednik povjerenstva)
Committee memberDražen Bajer (član povjerenstva)
Committee memberMario Dudjak (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Software Engineering)
(Chair of Programming Languages and Systems)
Osijek
Defense date and country2023, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Artificial Intelligence
Abstract
U radu je opisan problem grupiranja podataka, popularni algoritam za grupiranje k-means te algoritam diferencijalne evolucije (DE), popularan evolucijski algoritam koji može biti primijenjen za grupiranje podataka. Implementirane su dvije inačice algoritma DE koje se razlikuju u korištenom operatoru mutacije, te je dan opis tog programskog rješenja, način rada i prikaz njegove uporabe. S implementiranim programskim rješenjem provedena je eksperimentalna analiza na nekoliko sintetičkih skupova podataka i na nekoliko često korištenih stvarnih skupova podataka. U analizi su uspoređeni algoritam k-means i dvije inačice algoritma DE. Vrednovane su njihove učinkovitosti za grupiranje podataka u smislu mjera SSE i DBI. Rezultati prikazuju da u većini slučajeva inačice algoritma DE pronalaze particije s boljim vrijednostima DBI, dok algoritam k-means pronalazi particije s boljim vrijednostima SSE. Razlike između inačica algoritma DE za korištene skupove podataka su zanemarive.
Abstract (english)
The paper describes the concept of data clustering, popular algorithm for clustering k-means and differential evolution (DE) algorithm which is a popular evolution algorithm that can be used for data clustering. There are two versions of DE algorithm implemented which differ in the mutation operator. A description is given of the implemented software solution, the way it works and how it is used. Using the implemented software solution, an experimental analysis was carried out on several synthetic datasets and on several often used real world datasets. This analysis compared the quality of partitions acquired by the k-means algorithm and the two versions of DE algorithm. The measures used for the quality of partitions were sum of squared errors (SSE) and DaviesBouldin index (DBI). The analysis showed that both versions of DE algorithm got better DBI results, while k-means algorithm got better SSE results. The differences in results between the two versions of DE algorithm for the datasets used were negligible.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:314646
Study programmeTitle: Graduate University Study Programme in Computer Engineering
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2023-10-11 08:26:25