Abstract
Let i = 1,..., N be some units (objects) and R = R 1,..., R p be an arbitrary partition of the set of the units with classes R 1,..., R p. Let K ⊂ 1,...,p 2 be an association graph on the set of classes R 8, i.e. two classes R s, R t are called to be associated if s,t ∈ K. The pair M = (R,K) will be called a partition with a structure, or a macrostructure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arabie, P., Boorman, S.A., AND Levitt, P.R. (1978): Constructing block models: how and why. J. Math. Psych., 17, 21–63.
Fienberg, S.E., Meger, M.M., Wasserman, S.S. (1985): Statistical analysis of multiple sociometric relations. J. Amer. Math. Assoc., 80, 51–67.
Kupershtokh, V., Trofimov, V.L. (1975): On an algorithm for macrostructure revealing. Automation and Remote Control, 11, 80–90.
Mirkin, B.G. (1974): Approximation problems in a space of relations and the analysis of non-quantitative variables. Automation and Remote Control, 9, 88–95.
Mirkin, B.G., Rodin, S.N. (1984): Graphs and genes. Springer, Berlin — Heidelberg.
Mirkin, B.G. (1985): Groupings in socio-economic researches. atistika Publishers, Moscow (in Russian).
Ravkin, Y.S. (1975): The birds of North-Western Altay. Nauka Publishers, Novosibirsk.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Mirkin, B.G. (1991). The “Partition with a Structure” Concept in Biological Data Analysis. In: Bock, HH., Ihm, P. (eds) Classification, Data Analysis, and Knowledge Organization. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76307-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-76307-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53483-9
Online ISBN: 978-3-642-76307-6
eBook Packages: Springer Book Archive