A simple method for generating additive clustering models with limited complexity
From MaRDI portal
Publication:1604804
DOI10.1023/A:1014112506867zbMATH Open1014.68067OpenAlexW2155247865WikidataQ57710721 ScholiaQ57710721MaRDI QIDQ1604804FDOQ1604804
Authors: Michael D. Lee 
Publication date: 8 July 2002
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014112506867
Recommendations
- Generating additive clustering models with minimal stochastic complexity.
- On the complexity of additive clustering models
- Regarding the complexity of additive clustering models: comment on Lee (2001).
- An extraction and regularization approach to additive clustering
- scientific article; zbMATH DE number 1302162
- Clustering in linear and additive mixed models
- Lowdimensional additive overlapping clustering
- Finding Additive Biclusters with Random Background
- Weak hierarchies associated with similarity measures - An additive clustering technique
- A simple approach to sparse clustering
Cited In (8)
- On the complexity of additive clustering models
- 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
- Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm
- Improved biclustering of microarray data demonstrated through systematic performance tests
- Generating additive clustering models with minimal stochastic complexity.
- Clustering and the efficient use of cognitive resources
This page was built for publication: A simple method for generating additive clustering models with limited complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604804)
