prikaz prve stranice dokumenta Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži
  Download
PDF 11.27 MB
master's thesis
Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži
Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2022. urn:nbn:hr:126:234365
Poljak, Denis
Josip Juraj Strossmayer University of Osijek
Department of Mathematics

Institutional repository: Repository of School of Applied Mathematics and Informatics

Cite this document

Poljak, D. (2022). Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži (Master's thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:234365

Poljak, Denis. "Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži." Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2022. https://urn.nsk.hr/urn:nbn:hr:126:234365

Poljak, Denis. "Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži." Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2022. https://urn.nsk.hr/urn:nbn:hr:126:234365

Poljak, D. (2022). 'Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži', Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 21 December 2024, https://urn.nsk.hr/urn:nbn:hr:126:234365

Poljak D. Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2022 [cited 2024 December 21] Available at: https://urn.nsk.hr/urn:nbn:hr:126:234365

D. Poljak, "Algoritam za prepoznavanje grupa vrhova u kompleksnoj mreži", Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:126:234365

Metadata
TitleAlgoritam za prepoznavanje grupa vrhova u kompleksnoj mreži
Title (english)Algorithm for Identifying Dense Groups of Vertices in a Complex Network
AuthorDenis Poljak
MentorSnježana Majstorović (mentor)
Committee memberKristian Sabo (predsjednik povjerenstva)
Committee memberSnježana Majstorović (član povjerenstva)
Committee memberDomagoj Ševerdija (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
Osijek
Defense date and country2022-11-10, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Mathematical Logic and Accounting
Abstract
Tema ovog diplomskog rada je detekcija gustih vrhova u kompleksnoj mreži. Analiza kompleksnih mreža ima važan istraživački značaj u raznim znanstvenim i društvenim disciplinama. Prvo ćemo navesti osnovne pojmove o grafovima, odnosno mrežama, a zatim ćemo opisati Louvain algoritam za particioniranje kompleksnih mreža. Njegov princip je postići maksimalnu vrijednost modularnosti u kontinuiranim iteracijama prolaska kroz vrhove grafa i dobiti optimalnu particiju mreže. Predstavit ćemo i algoritam Louvain Prune koji smanjuje vremensku složenost izvornog algoritma, a gotove je iste kvalitete kao izvorni algoritam.
Abstract (english)
The subject of this final work is the detection of dense groups of vertices in a complex network. The analysis of complex networks has an important research significance in various scientific and social disciplines. We will first present basic definitions from graph and network theory, and then describe the Louvain algorithm for partitioning complex networks. Its principle is to achieve the maximum modularity value of the community partition result in continuous iterations of passing through the vertices of the graph and obtain the optimal community partition. We will present Louvain Prune algorithm, which reduces the time complexity of the original algorithm and maintains the same qualities as the original algorithm
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:234365
Study programmeTitle: Mathematics; specializations in: Financial and Statistical Mathematics, Mathematics and Computer Science, Industrial and Applied Mathematics
Course: Financial and Statistical Mathematics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2022-11-14 06:55:44