Relaxations in practical clustering and blockmodeling

• Verfasst von: Wiesberg, Stefan [VerfasserIn]
• Verfasst von: Reinelt, Gerhard [VerfasserIn]
• Titel: Relaxations in practical clustering and blockmodeling
• Verf.angabe: Stefan Wiesberg and Gerhard Reinelt
• E-Jahr: 2015
• Jahr: March 2015
• Umfang: 8 S.
• Fussnoten: Gesehen am 01.07.2020
• Titel Quelle: Enthalten in: Informatica
• Ort Quelle: Ljubljana : Slovene Soc. Informatika, 1977
• Jahr Quelle: 2015
• Band/Heft Quelle: 39(2015), 3, Seite 249-256
• ISSN Quelle: 0350-5596
• Datenträger: Online-Ressource
• Sprache: eng
• K10plus-PPN: 1703137663

Abstract

Network analysts try to explain the structure of complex networks by the partitioning of their nodes into - groups. These groups are either required to be dense (clustering) or to contain vertices of equivalent - positions (blockmodeling). However, there is a variety of definitions and quality measures to achieve the - groupings. In surveys, only few mathematical connections between the various definitions are mentioned. - In this paper, we show that most of the definitions used in practice can be seen as certain relaxations of - four basic graph theoretical definitions. The theory holds for both clustering and blockmodeling. It can be - used as the basis of a methodological analysis of different practical approaches.