Published in

Springer Verlag, Journal of Classification, 1(2), p. 219-238

DOI: 10.1007/bf01908076

Links

Tools

Export citation

Search in Google Scholar

Cluster analysis of dyad distributions in networks

Journal article published in 1985 by Ove Frank, Henryka Komańska, Keith F. Widaman ORCID
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Existing statistical models for network data that are easy to estimate and fit are based on the assumption of dyad independence or conditional dyad independence if the individuals are categorized into subgroups. We discuss how such models might be overparameterized and argue that there is a need for subgrouping methods to find appropriate models. We propose clustering of dyad distributions as such a method and illustrate it by analyzing how cooperative learning methods affect friendship data for school children.