Algorithm AS 140: Clustering the Nodes of a Directed Graph

DOI10.2307/2346750zbMath0447.62063OpenAlexW2800481121MaRDI QIDQ3893164

Gary W. 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

maximum likelihoodalgorithm AS 140clustering nodes of directed graphtransfer algorithm

Mathematics Subject Classification ID

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

Related Items (3)

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

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