Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/2000
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vidojević, Filip | en_US |
dc.contributor.author | Mrkela, Lazar | en_US |
dc.contributor.author | Džamić, Dušan | en_US |
dc.contributor.author | Marić, Miroslav | en_US |
dc.date.accessioned | 2025-05-06T12:45:59Z | - |
dc.date.available | 2025-05-06T12:45:59Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/2000 | - |
dc.description.abstract | U okviru ovog rada predstavljena je nova VNS metoda za rešavanje problema fazi klasterovanja na kompleksnim mrežama. Za razliku od disjunktnog klasterovanja, gde jedan ˇcvor može samo u celini pripadati nekom klasteru, kod fazi klasterovanja ˇcvor može delimično pripadati različitim klasterima. Dakle, dimenzija rešenja problema fazi klasterovanja je nekoliko puta ve´ca nego u sluˇcaju disjunktnog klasterovanja, što dodatno usložnjava problem klasterovanja na kompleksnoj mreži. Kao lokalna pretraga, implementirana je efikasna metoda brze optimizacije fazi modularnosti, koja se u literaturi pokazala kao metoda sa najmanjim vremenom izvrašavanja do konvergencije. U fazi razmrdavanja, implementirane su i upoređene tri različite okoline, zasnovane na slučajnom izboru određenog broja čvorova čije se pripadnosti klasterima menjaju. Razvijena metoda testirana je na poznatim skupovima podataka Američki univerzitetski fudbal, Zaharijev karate klub i Mreži delfina. Eksperimentalni rezultati su pokazali da kombinacija sve tri okoline u fazi razmrdavanja daje najbolje rezultate na svim skupovima podataka. | en_US |
dc.description.abstract | In this paper, we present a new VNS method for fuzzy clustering on complex networks. Unlike disjoint clustering, where one node can only entirely belong to a cluster, in fuzzy clustering a node can partially belong to different clusters. Thus, the solution dimensionality of the fuzzy clustering algorithms is several times larger than in the case of disjoint clustering, which further complicates the clustering problem on complex networks. As a local search, an efficient method of fast fuzzy modularity optimization was implemented, which proved in the literature to be the method with the lowest execution time until convergence. In the shaking phase, three different environments were implemented and compared, based on a random selection of a number of nodes whose membership degrees change. The developed method was tested on the well-known data sets American University Football, Zachary Karate Club and Dolphin Network. Experimental results have shown that the combination of all three neighborhoods in the shaking phase gives the best results on all data sets. | en_US |
dc.language.iso | other | en_US |
dc.publisher | Beograd : Ekonomski fakultet | en_US |
dc.subject | complex networks | en_US |
dc.subject | fuzzy clustering | en_US |
dc.subject | modularity | en_US |
dc.subject | variable neighborhood search | en_US |
dc.title | Unapređena metoda promenljivih okolina za fazi klasterovanje na kompleksnim mrežama | en_US |
dc.title.alternative | Improved variable neighborhood search for fuzzy clustering on complex networks | en_US |
dc.type | Conference Object | en_US |
dc.relation.conference | Simpozijum o operacionim istraživanjima=International Symposium on Operations Research-SYM-OP-IS 2022(49 ; 2022 ; Vrnjačka Banja) | en_US |
dc.relation.publication | XLIX Simpozijum o operacionim istraživanjima : Zbornik radova | en_US |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.relation.isbn | 978-86-403-1750-4 | en_US |
dc.description.rank | M33 | en_US |
dc.relation.firstpage | 255 | en_US |
dc.relation.lastpage | 259 | en_US |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | other | - |
item.openairetype | Conference Object | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | none | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0002-5567-5633 | - |
crisitem.author.orcid | 0000-0001-7446-0577 | - |
Appears in Collections: | Research outputs |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.