Deterministic blockmodeling
 | This article provides insufficient context for those unfamiliar with the subject. (September 2021) |
Deterministic blockmodeling is an approach in blockmodeling that does not assume a probabilistic model, and instead relies on the exact or approximate algorithms, which are used to find blockmodel(s). This approach typically minimizes some inconsistency that can occur with the ideal block structure.[1] Such analysis is focused on clustering (grouping) of the network (or adjacency matrix) that is obtained with minimizing an objective function, which measures discrepancy from the ideal block structure.[2]
However, some indirect approaches (or methods between direct and indirect approaches, such as CONCOR) do not explicitly minimize inconsistencies or optimize some criterion function. [3]
This approach was popularized in the 1970s, due to the presence of two computer packages (CONCOR and STRUCTURE) that were used to "find a permutation of the rows and columns in the adjacency matrix leading to an approximate block structure".[4]
The opposite approach to deterministic blockmodeling is a stochastic blockmodeling approach.[2]
See also
[edit | edit source]References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Aleš Žiberna, Generalized blockmodeling of valued networks (pospološeno bločno modeliranje omrežij z vrednostmi na povezavah: doktorska disertacija. Ljubljana: Univerza v Ljubljani, Fakulteta za družbene vede, 2007, p. 22. URL: http://www2.arnes.si/~aziber4/blockmodeling/Dissertation-final-corrected.pdf.
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
