On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications
From MaRDI portal
Publication:5084663
Recommendations
- Interpretable clustering: an optimization approach
- A new method for solving supervised data classification problems
- A dual reformulation and solution framework for regularized convex clustering problems
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
- An aggregate and iterative disaggregate algorithm with proven optimality in machine learning
Cites work
- A fast algorithm for clusterwise linear regression
- Algorithms for Generalized Clusterwise Linear Regression
- An algorithm for clusterwise linear regression based on smoothing techniques
- Clusterwise linear regression modeling with soft scale constraints
- Compressive sensing for cut improvement and local clustering
- Data Mining and Knowledge Discovery Handbook
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Estimating the components of a mixture of normal distributions
- Functional Operators (AM-21), Volume 1
- Fuzzy weighted c-harmonic regressions clustering algorithm
- Generalized alternating projection for weighted-\(\ell_{2,1}\) minimization with applications to model-based compressive sensing
- scientific article; zbMATH DE number 3872359 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Local linear convergence for alternating and averaged nonconvex projections
- Low rank matrix completion by alternating steepest descent methods
- Model-based regression clustering for high-dimensional data: application to functional data
- On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Rough Sets and Current Trends in Computing
- The Planar k-Means Problem is NP-Hard
- Transversality and alternating projections for nonconvex sets
This page was built for publication: On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084663)
