On the complexity of additive clustering models
type: Item
instance of: scholarly article
title: On the complexity of additive clustering models
zbMATH Open document ID: 1003.91034
author: Michael D. Lee
published in: Journal of Mathematical Psychology
publication date: 2003-01-30T00:00:00Z
Mathematics Subject Classification ID: 91C20
zbMATH DE Number: 1749377
zbMATH Keywords: Bayesian information criterion
zbMATH Keywords: additive clustering
zbMATH Keywords: evaluative measures
zbMATH Keywords: model complexity
zbMATH Keywords: cluster cardinality
zbMATH Keywords: marginal probability density
describes a project that uses: MAPCLUS
MaRDI profile type: Publication
OpenAlex ID: W2124194529
Wikidata QID: Q52068544
cites work: MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
cites work: Q5619190
cites work: An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
cites work: Matrix Analysis
cites work: Q5179661
cites work: Bayes Factors
cites work: The Selection of Prior Distributions by Formal Rules
cites work: An extraction and regularization approach to additive clustering
cites work: Q4023358
cites work: Q4039873
cites work: Additive clustering and qualitative factor analysis methods for similarity matrices
cites work: Q3995624
cites work: Estimating the dimension of a model
cites work: A Mathematical Theory of Communication
cites work: Representation of structure in similarity data: problems and prospects
DOI: 10.1006/JMPS.1999.1299
description: scientific article; zbMATH DE number 1749377