Generalized blockmodeling
In generalized blockmodeling, the blockmodeling is done by "the translation of an equivalence type into a set of permitted block types", which differs from the conventional blockmodeling, which is using the indirect approach.[1] It's a special instance of the direct blockmodeling approach.[2]
Generalized blockmodeling was introduced in 1994 by Patrick Doreian, Vladimir Batagelj and Anuška Ferligoj.[3]
Definition[edit]
Generalized blockmodeling approach is a direct one, "where the optimal partition(s) is (are) identified based on minimal values of a compatible criterion function defined by the difference between empirical blocks and corresponding ideal blocks".[4] At the same time, the much broader set of block types is introduced (while in conventional blockmodeling only certain types are used). The conventional blockmodeling is inductive due to nonspecification of neither the clusters or the location of block types, while in generalized blockmodeling the blockmodel is specified with more detail than just the permition of certain block types (e.g., prespecification). Further, it's possible to define departures from the permitted (ideal) blocktype, using criterion function.[5]: 16–17
Using local optimization procedure, firstly the initial clustering (with specified number of clusters is done, based on random creation. How the clusters are neighboring to each other, is based on two transformations: 1) a vertex is moved from one to another cluster or 2) a pair of vertices is interchanged between two different clusters. This process of transformation steps is repeated many times, until only the best fitting partitions (with the minimized value of the criterion function) are kept as blockmodels for the future exploration of the network.[1]
Different types of generalized blockmodeling are:[3]
- generalized binary blockmodeling,
- generalized valued blockmodeling and
- generalized homogeneity blockmodeling.
Benefits[edit]
According to Patrick Doreian, the benefits of generalized blockmodeling, are as follows:[1]
- usage of explicit criterion function, compatible with a given type of equivalence, results to in-built measure of fit, which is integral to the establishment of the blockmodels (in conventional blockmodeling, there is no compelling and coherent measures of fit);
- partitions, based on generalized blockmodeling, regularly outperform and never perform less well than the partitions, based on conventional approach;
- with generalized blockmodeling it's possible to specify new types of blockmodels;
- this potentially unlimited set of new block types also results in permittion of inclusion of substantively driven blockmodels;
- in generalized blockmodeling, the specification of the block types and the location of some of them in the blockmodel is possible;
- researcher can speficy which (pair of) vertices must be (not) clustered together;
- this approach also allows the imposition of penalties, resulting into identification of empirical null blocks without inconsistencies with a corresponding ideal null block.
Problems[edit]
According to Doreian, the benefits of generalized blockmodeling, are as follows:[1]
- unknown sensitivity to particular data features,
- examination of boundary problems,
- computationally burdensome, which results in a constraint regarding practical network size (generalized blockmodeling is thus primarily used to analyse smaller networks (below 100 units)[6]),
- identifying structure from incomplete network information,
- most of generalized blockmodeling is based on binary networks, but there is also development in the field of valued networks,
- criterion function is minimized for a specified blockmodel, with results in issues of evaluating statistically, based on the structural data alone,
- problems regarding three dimensional network data,
- problems regarding the evolution of fundamental network structure.
Book[edit]
The book with the same title, Generalized blockmodeling, written by Patrick Doreian, Vladimir Batagelj and Anuška Ferligoj, was in 2007 awarded the Harrison White Outstanding Book Award by the Mathematical Sociology Section of American Sociological Association.[7]
See also[edit]
References[edit]
- ^ a b c d Doreian, Patrick (2006). "Some Open Problem Sets for Generalized Blockmodeling". In Batagelj, Vladimir (ed.). Data Science and Classification. Springer. pp. 119–130. ISBN 978-3-540-34415-5.
- ^ Miha Matjašič, Marjan Cugmas and Aleš Žiberna, blockmodeling: An R package for generalized blockmodeling, Metodološki zvezki, 17(2), 2020, 49–66.
- ^ a b Žiberna, Aleš (2009). "Evaluation of Direct and Indirect Blockmodeling of Regular Equivalence in Valued Networks by Simulations". Metodološki zvezki. 6 (2): 99–134.
- ^ Žnidaršič, Anja; Doreian, Patrick; Ferligoj, Anuška (2012). "Absent Ties in Social Networks, their Treatments, and Blockmodeling Outcomes". Metodološki zvezki. 9 (2): 119–138.
- ^ Doreian, Patrick; Batagelj, Vladimir; Ferligoj, Anuška (2004). Generalized Blockmodeling (Structural Analysis in the Social Sciences). Cambridge University Press. ISBN 0-521-84085-6.
- ^ Žiberna, Aleš (2013). "Generalized blockmodeling of sparse networks". Metodološki zvezki. 10 (2): 99–119.
- ^ "The Section on Mathematical Sociology's Harrison White Outstanding Book Award". American Sociological Association. Retrieved September 26, 2019.
Selected bibliography[edit]
- Patrick Doreian, Vladimir Batagelj, Anuška Ferligoj, Mark Granovetter (Series Editor), Generalized Blockmodeling (Structural Analysis in the Social Sciences), Cambridge University Press 2004 (ISBN 0-521-84085-6)