Data analysis and the connectivity of random graphs

DOI10.1016/0022-2496(73)90025-4MaRDI QIDQ1236388zbMATH OpenOpenAlexFDO

Authors James V. Schultz, Lawrence Hubert

Publication date 1973

Published in Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-2496(73)90025-4

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites work

• Hierarchical clustering schemes
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3354418 (Why is no real title available?)
• scientific article; zbMATH DE number 3358495 (Why is no real title available?)
• Min and max hierarchical clustering using asymmetric similarity measures
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II

Cited in

(4)

• An exact probability distribution on the connectivity of random graphs
• Some applications of graph theory to clustering
• Connectivity in random networks
• Validity studies in clustering methodologies

This page was built for publication: Data analysis and the connectivity of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1236388)