A fast permuation-based algorithm for block clustering

DOI10.1007/BF02564706MaRDI QIDQ1382953zbMATH OpenOpenAlexFDO

Authors José M. Renom, Isabel Llatas, A. J. Quiroz

Publication date 1997

Published in Test (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02564706

zbMATH Keywords

block clusteringpermutation distributionBayesian sequential analysisBinary splitting

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Sequential statistical analysis (62L10) Bayesian problems; characterization of Bayes procedures (62C10)

Recommendations

• A FastMap-based algorithm for block modeling
• Improved Clustering Algorithms for the Bipartite Stochastic Block Model
• Block clustering based on difference of convex functions (DC) programming and DC algorithms
• Spectral clustering and block models: a review and a new algorithm
• Clustering in block Markov chains
• A fast algorithm for robust constrained clustering
• Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs

Cites work

• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• A Method for Comparing Two Hierarchical Clusterings

Cited in

(1)

• A general partition cluster algorithm

This page was built for publication: A fast permuation-based algorithm for block clustering

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