Abstract
This paper presents a method, called Adaptive Directed Acyclic Graph (ADAG), to extend Support Vector Machines (SVMs) for multiclass classification. The ADAG is based on the previous approach, the Decision Directed Acyclic Graph (DDAG), and is designed to remedy some weakness of the DDAG caused by its structure. We prove that the expected accuracy of the ADAG is higher than that of the DDAG, and also empirically evaluate our approach by comparing the ADAG with the DDAG on two data sets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
