Abstract
In this paper, we present a convex discriminant analysis formulation, which is extended to solve multi-label classification problems. The original Linear Discriminant Analysis energy optimization function is turned into another form as a convex formulation (namely, convex Approximate LDA, denoted as “convexALDA” for short) using the generalized eigen-decomposition. We give applications by incorporating convexALDA as a regularizer into discriminant regression analysis. Extensive experimental results on multi-label classification tasks and an extensive application scenario on communication characteristics of imperial examination system are provided. In this way we have a brand-new comprehension for it, and a new idea and method was also put forward for studying the system.
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 callMore From: International Journal on Artificial Intelligence Tools
Disclaimer: 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.
