Vaš brskalnik ne omogoča JavaScript!
JavaScript je nujen za pravilno delovanje teh spletnih strani. Omogočite JavaScript ali pa uporabite sodobnejši brskalnik.
Nacionalni portal odprte znanosti
Odprta znanost
DiKUL
slv
|
eng
Iskanje
Brskanje
Novo v RUL
Kaj je RUL
V številkah
Pomoč
Prijava
k-means-based algorithm for blockmodeling linked networks
ID
Žiberna, Aleš
(
Avtor
)
PDF - Predstavitvena datoteka,
prenos
(10,05 MB)
MD5: 1DDAAD2C7E0DF5440B75CECF636CF49A
URL - Izvorni URL, za dostop obiščite
https://www.sciencedirect.com/science/article/pii/S0378873319300176
Galerija slik
Izvleček
The paper presents a k-means-based algorithm for blockmodeling linked networks where linked networks are defined as a collection of one-mode and two-mode networks in which units from different one-mode networks are connected through two-mode networks. The reason for this is that a faster algorithm is needed for blockmodeling linked networks that can better scale to larger networks. Examples of linked networks include multilevel networks, dynamic networks, dynamic multilevel networks, and meta-networks. Generalized blockmodeling has been developed for linked/multilevel networks, yet the generalized blockmodeling approach is too slow for analyzing larger networks. Therefore, the flexibility of generalized blockmodeling is sacrificed for the speed of k-means-based approaches, thus allowing the analysis of larger networks. The presented algorithm is based on the two-mode k-means (or KL-means) algorithm for two-mode networks or matrices. As a side product, an algorithm for one-mode blockmodeling of one-mode networks is presented. The algorithm's use on a dynamic multilevel network with more than 400 units is presented. A situation study is also conducted which shows that k-means based algorithms are superior to relocation algorithm-based methods for larger networks (e.g. larger than 800 units) and never much worse.
Jezik:
Angleški jezik
Ključne besede:
generalised blockmodeling
,
k-means algorithm
,
homogeneity blockmodeling
,
linked networks
,
multilevel networks
,
simulations
Vrsta gradiva:
Članek v reviji
Tipologija:
1.01 - Izvirni znanstveni članek
Organizacija:
FDV - Fakulteta za družbene vede
Status publikacije:
Objavljeno
Različica publikacije:
Objavljena publikacija
Leto izida:
2020
Št. strani:
Str. 153-169
Številčenje:
Vol. 61
PID:
20.500.12556/RUL-128412
UDK:
303
ISSN pri članku:
0378-8733
DOI:
10.1016/j.socnet.2019.10.006
COBISS.SI-ID:
36567901
Datum objave v RUL:
12.07.2021
Število ogledov:
1277
Število prenosov:
581
Metapodatki:
Citiraj gradivo
Navadno besedilo
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Kopiraj citat
Objavi na:
Gradivo je del revije
Naslov:
Social networks
Skrajšan naslov:
Soc. networks
Založnik:
Elsevier
ISSN:
0378-8733
COBISS.SI-ID:
30632960
Licence
Licenca:
CC BY 4.0, Creative Commons Priznanje avtorstva 4.0 Mednarodna
Povezava:
http://creativecommons.org/licenses/by/4.0/deed.sl
Opis:
To je standardna licenca Creative Commons, ki daje uporabnikom največ možnosti za nadaljnjo uporabo dela, pri čemer morajo navesti avtorja.
Projekti
Financer:
ARRS - Agencija za raziskovalno dejavnost Republike Slovenije
Številka projekta:
P5-0168
Naslov:
Družboslovna metodologija, statistika in informatika
Financer:
ARRS - Agencija za raziskovalno dejavnost Republike Slovenije
Številka projekta:
J7-8279
Naslov:
Bločno modeliranje večnivojskih in časovnih omrežij
Podobna dela
Podobna dela v RUL:
Podobna dela v drugih slovenskih zbirkah:
Nazaj