Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Browse
New in RUL
About RUL
In numbers
Help
Sign in
k-means-based algorithm for blockmodeling linked networks
ID
Žiberna, Aleš
(
Author
)
PDF - Presentation file,
Download
(10,05 MB)
MD5: 1DDAAD2C7E0DF5440B75CECF636CF49A
URL - Source URL, Visit
https://www.sciencedirect.com/science/article/pii/S0378873319300176
Image galllery
Abstract
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.
Language:
English
Keywords:
generalised blockmodeling
,
k-means algorithm
,
homogeneity blockmodeling
,
linked networks
,
multilevel networks
,
simulations
Work type:
Article
Typology:
1.01 - Original Scientific Article
Organization:
FDV - Faculty of Social Sciences
Publication status:
Published
Publication version:
Version of Record
Year:
2020
Number of pages:
Str. 153-169
Numbering:
Vol. 61
PID:
20.500.12556/RUL-128412
UDC:
303
ISSN on article:
0378-8733
DOI:
10.1016/j.socnet.2019.10.006
COBISS.SI-ID:
36567901
Publication date in RUL:
12.07.2021
Views:
808
Downloads:
514
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Record is a part of a journal
Title:
Social networks
Shortened title:
Soc. networks
Publisher:
Elsevier
ISSN:
0378-8733
COBISS.SI-ID:
30632960
Licences
License:
CC BY 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Projects
Funder:
ARRS - Slovenian Research Agency
Project number:
P5-0168
Name:
Družboslovna metodologija, statistika in informatika
Funder:
ARRS - Slovenian Research Agency
Project number:
J7-8279
Name:
Bločno modeliranje večnivojskih in časovnih omrežij
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back