On the approximability of the largest sphere rule ensemble classification problem

DOI10.1016/J.IPL.2015.06.012MaRDI QIDQ2353652zbMATH OpenOpenAlexFDO

Authors Vahan V. Mkrtchyan, K. Subramani

Publication date 15 July 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.06.012

zbMATH Keywords

approximationapproximation algorithmsNP-completenessinapproximabilityfeasibilityweighted rule ensemble classification reversal problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• A nearest-neighbor-based ensemble classifier and its large-sample optimality
• Approximating a Class of Classification Problems
• Efficient learning of large sets of locally optimal classification rules
• Ensembles of classifiers based on approximate reducts
• On the optimality of the max-depth and max-rank classifiers for spherical data.
• Performance of the majority voting rule in solving the density classification problem in high dimensions
• scientific article; zbMATH DE number 5957262

This page was built for publication: On the approximability of the largest sphere rule ensemble classification problem

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