Relaxations in practical clustering and blockmodeling
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 measu...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
March 2015
|
| In: |
Informatica
Year: 2015, Volume: 39, Issue: 3, Pages: 249-256 |
| ISSN: | 0350-5596 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: http://www.informatica.si/index.php/informatica/article/view/980
|
| Author Notes: | Stefan Wiesberg and Gerhard Reinelt |
| Summary: | 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. |
|---|---|
| Item Description: | Gesehen am 01.07.2020 |
| Physical Description: | Online Resource |
| ISSN: | 0350-5596 |