Algorithm AS 140: Clustering the Nodes of a Directed Graph

DOI10.2307/2346750MaRDI QIDQ3893164zbMATH OpenOpenAlexFDO

Authors Gary Oehlert

Publication date 1979

Published in Applied Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2346750

zbMATH Keywords

algorithm AS 140clustering nodes of directed graphmaximum likelihoodtransfer algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99)

Cited in

(3)

• Clusteranalyse - Überblick und neuere Entwicklungen
• AS 140
• Probabilistic-statistical programs from ``Applied Statistics

This page was built for publication: Algorithm AS 140: Clustering the Nodes of a Directed Graph

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