Unsupervised classification via convex absolute value inequalities
From MaRDI portal
Publication:4981845
DOI10.1080/02331934.2014.947501zbMath1310.62077OpenAlexW2079646975MaRDI QIDQ4981845
Publication date: 20 March 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.947501
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (4)
Unsupervised and semisupervised classification via absolute value inequalities ⋮ On the global convergence of the inexact semi-smooth Newton method for absolute value equation ⋮ Sufficient conditions for the unsolvability and solvability of the absolute value equation ⋮ Convex Maximization via Adjustable Robust Optimization
Uses Software
Cites Work
- Unnamed Item
- On unique solvability of the absolute value equation
- Systems of linear interval equations
- Absolute value equations
- Absolute value programming
- Absolute value equation solution via concave minimization
- Minimum-support solutions of polyhedral concave programs*
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
This page was built for publication: Unsupervised classification via convex absolute value inequalities