Abstract
-
Forms of representing and comparing partitions are reviewed.
-
Mathematical analysis of some of the agglomerative clustering axioms is presented.
-
Approximation clustering methods for aggregating square data tables are suggested along with associated mathematical theories:
-
Uniform partitioning as based on a “soft” similarity threshold;
-
Structured partitioning (along with the structure of between-class associations);
-
Aggregation of mobility and other aggregable interaction data as based on chi-squared criterion and underlying substantive modeling.
-
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Mirkin, B. (1996). Partition: Square Data Table. In: Mathematical Classification and Clustering. Nonconvex Optimization and Its Applications, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0457-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0457-9_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-8057-3
Online ISBN: 978-1-4613-0457-9
eBook Packages: Springer Book Archive