An extraction and regularization approach to additive clustering

DOI10.1007/S003579900056zbMATH Open0951.91068OpenAlexW2004706398WikidataQ57710731 ScholiaQ57710731MaRDI QIDQ1963871FDOQ1963871

Authors: Michael D. Lee 

Publication date: 3 February 2000

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

Full work available at URL: https://doi.org/10.1007/s003579900056

Recommendations

• Generating additive clustering models with minimal stochastic complexity.
• On the complexity of additive clustering models
• A simple method for generating additive clustering models with limited complexity
• Algorithms for additive clustering of rectangular data tables
• scientific article; zbMATH DE number 1302162

zbMATH Keywords

overlapping clusteringADCLUSadditive clustering

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20)

Cited In (10)

• On the complexity of additive clustering models
• An algorithm to obtain additive trees based upon the preservation of the clusters structure
• A simple method for generating additive clustering models with limited complexity
• Regarding the complexity of additive clustering models: comment on Lee (2001).
• Additive clustering and qualitative factor analysis methods for similarity matrices
• Algorithms for additive clustering of rectangular data tables
• Summary and semi-average similarity criteria for individual clusters
• Improved biclustering of microarray data demonstrated through systematic performance tests
• Generating additive clustering models with minimal stochastic complexity.
• Title not available (Why is that?)

This page was built for publication: An extraction and regularization approach to additive clustering

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