Regarding the complexity of additive clustering models: comment on Lee (2001).
type: Item
instance of: scholarly article
title: Regarding the complexity of additive clustering models: comment on Lee (2001).
zbMATH Open document ID: 1041.91050
DOI: 10.1016/S0022-2496(02)00026-3
author: Daniel J. Navarro
published in: Journal of Mathematical Psychology
publication date: 2003-08-25T00:00:00Z
Mathematics Subject Classification ID: 91C20
zbMATH DE Number: 1970555
zbMATH Keywords: clustering
zbMATH Keywords: complexity
zbMATH Keywords: Hadamard inequality
MaRDI profile type: Publication
cites work: Q5619190
cites work: Bayes Factors
cites work: On the complexity of additive clustering models
cites work: Generating additive clustering models with minimal stochastic complexity.
cites work: Counting probability distributions: Differential geometry and model selection
cites work: Fisher information and stochastic complexity
Recommended article: On the complexity of additive clustering models
Recommended article: A simple method for generating additive clustering models with limited complexity
Recommended article: Generating additive clustering models with minimal stochastic complexity.
Recommended article: An extraction and regularization approach to additive clustering
Recommended article: Studying Complexity of Model-based Clustering
Recommended article: Q4247429
Recommended article: On the complexity of some cluster analysis problems
Recommended article: Q4605968
Recommended article: Finding Additive Biclusters with Random Background
Recommended article: Q3115213
description: scientific article; zbMATH DE number 1970555