Generating additive clustering models with minimal stochastic complexity.

DOI10.1007/S00357-001-0033-YMaRDI QIDQ1566091zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael D. Lee

Publication date 2002

Published in Journal of Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00357-001-0033-y

zbMATH Keywords

overlapping clusteringadditive clusteringstochastic complexity

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20)

Recommendations

• On the complexity of additive clustering models
• A simple method for generating additive clustering models with limited complexity
• An extraction and regularization approach to additive clustering
• Regarding the complexity of additive clustering models: comment on Lee (2001).
• scientific article; zbMATH DE number 1302162

Cited in

(9)

• On the complexity of additive clustering models
• On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model
• A simple method for generating additive clustering models with limited complexity
• Regarding the complexity of additive clustering models: comment on Lee (2001).
• Approximating a similarity matrix by a latent class model: a reappraisal of additive fuzzy clustering
• An extraction and regularization approach to additive clustering
• Prototypes, exemplars and the response scaling parameter: a Bayes factor perspective
• A tutorial on Bayes factor estimation with the product space method
• Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach

This page was built for publication: Generating additive clustering models with minimal stochastic complexity.

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