Algorithms for additive clustering of rectangular data tables
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1082102 (Why is no real title available?)
- A sequential fitting procedure for linear data analysis models
- A unifying model involving a categorical and/or dimensional reduction for multimode data
- An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
- The method of principal clusters
- Two-mode clustering methods: astructuredoverview
Cited in
(15)- An extraction and regularization approach to additive clustering
- adproclus
- Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries
- Deriving optimal data-analytic regimes from benchmarking studies
- Additive biclustering: a comparison of one new and two existing ALS algorithms
- scientific article; zbMATH DE number 3982318 (Why is no real title available?)
- An overlapping cluster algorithm to provide non-exhaustive clustering
- An overlapping co-clustering algorithm by maximizing modularity
- Community detection in feature-rich networks using data recovery approach
- Measuring the component overlapping in the Gaussian mixture model
- Clustering objects described by juxtaposition of binary data tables
- Block-relaxation approaches for fitting the INDCLUS model
- Lowdimensional additive overlapping clustering
- ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions
- Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering
This page was built for publication: Algorithms for additive clustering of rectangular data tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1023856)