Approximating a Class of Classification Problems

DOI10.1007/11671541_8MaRDI QIDQ5450809zbMATH OpenOpenAlexFDO

Authors Ioannis Milis

Publication date 14 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11671541_8

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
• scientific article; zbMATH DE number 1629976
• Improved approximations for hard optimization problems via problem instance classification
• A constant factor approximation algorithm for a class of classification problems
• The Hardness of Metric Labeling

Cited in

(11)

• A microchoice bound for continuous-space classification algorithms
• Estimating the probability of a class at a point by the approximation of one discriminant function
• On the approximability of the largest sphere rule ensemble classification problem
• A predicative approach to the classification problem
• A constant factor approximation algorithm for a class of classification problems
• Classification from a Computable Viewpoint
• Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
• scientific article; zbMATH DE number 4020249 (Why is no real title available?)
• scientific article; zbMATH DE number 1966536 (Why is no real title available?)
• Unsolvability Cores in Classification Problems
• On a minimum linear classification problem

This page was built for publication: Approximating a Class of Classification Problems

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