Algorithms for additive clustering of rectangular data tables

DOI10.1016/j.csda.2008.04.014zbMath1452.62439OpenAlexW2026680798MaRDI QIDQ1023856

Iven van Mechelen, Dirk Depril, Boris G. Mirkin

Publication date: 16 June 2009

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2008.04.014

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (8)

Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries ⋮ Deriving optimal data-analytic regimes from benchmarking studies ⋮ Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering ⋮ ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions ⋮ Community detection in feature-rich networks using data recovery approach ⋮ adproclus ⋮ Block-relaxation approaches for fitting the INDCLUS model ⋮ Lowdimensional additive overlapping clustering

Cites Work

• A sequential fitting procedure for linear data analysis models
• A unifying model involving a categorical and/or dimensional reduction for multimode data
• The method of principal clusters
• An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
• Two-mode clustering methods: astructuredoverview
• Unnamed Item

This page was built for publication: Algorithms for additive clustering of rectangular data tables