On the complexity of additive clustering models

DOI10.1006/jmps.1999.1299zbMath1003.91034OpenAlexW2124194529WikidataQ52068544 ScholiaQ52068544MaRDI QIDQ1598977

Michael D. Lee

Publication date: 30 January 2003

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5fe11e6287218c436e8dc532b43d847688502a4e

zbMATH Keywords

Bayesian information criterionadditive clusteringmodel complexitymarginal probability densitycluster cardinalityevaluative measures

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20)

Related Items

A new zero-inflated negative binomial methodology for latent category identification ⋮ Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering ⋮ Regarding the complexity of additive clustering models: comment on Lee (2001). ⋮ On the minimum description length complexity of multinomial processing tree models ⋮ Model selection by normalized maximum likelihood

Uses Software

• MAPCLUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
• Representation of structure in similarity data: problems and prospects
• Estimating the dimension of a model
• An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
• Additive clustering and qualitative factor analysis methods for similarity matrices
• An extraction and regularization approach to additive clustering
• Matrix Analysis
• The Selection of Prior Distributions by Formal Rules
• Bayes Factors