Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Data analysis and the connectivity of random graphs

From MaRDI portal
Publication:1236388
Jump to:navigation, search

DOI10.1016/0022-2496(73)90025-4zbMath0353.62031OpenAlexW2053073044MaRDI QIDQ1236388

James V. Schultz, Lawrence J. 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)


Related Items

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



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Hierarchical clustering schemes
  • The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
  • Min and max hierarchical clustering using asymmetric similarity measures
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1236388&oldid=13317561"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 08:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki