A novel heuristic algorithm to solve penalized regression-based clustering model

DOI10.1007/S00500-019-04448-8MaRDI QIDQ2153681zbMATH OpenOpenAlexWikidataFDO

Authors Shadi Hasanzadeh Tavakkoli, Yahya Forghani, Reza Sheibani

Publication date 12 July 2022

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-019-04448-8

zbMATH Keywords

``sum-of-norms (SON) clusteringDC-ADMMDC-CDpenalized regression-based clustering (PRClust)

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• A new algorithm and theory for penalized regression-based clustering
• DC programming algorithm for clusterwise linear \(L_1\) regression
• Incremental DC optimization algorithm for large-scale clusterwise linear regression
• Block clustering based on difference of convex functions (DC) programming and DC algorithms
• A new efficient algorithm based on DC programming and DCA for clustering

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A new algorithm and theory for penalized regression-based clustering
• Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
• Coordinate descent algorithms for lasso penalized regression
• Feature relevance in Ward's hierarchical clustering using the L_p norm
• Fuzzy extensions of the DBSCAN clustering algorithm
• Model-based clustering based on sparse finite Gaussian mixtures
• Pathwise coordinate optimization
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms

Cited in

(1)

• A new algorithm and theory for penalized regression-based clustering

This page was built for publication: A novel heuristic algorithm to solve penalized regression-based clustering model

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