Abstract
In this paper, we systematize a family of constrained quadratic classifiers that belong to the class of one-class classifiers. One-class classifiers such as the single-class support vector machine or the subspace methods are widely used for pattern classification and detection problems because they have many advantages over binary classifiers. We interpret subspace methods as rank-constrained quadratic classifiers in the framework. We also introduce two constraints and a method of suppressing the effect of competing classes to make them more accurate and retain their advantages over binary classifiers. Experimental results demonstrate the advantages of our methods over conventional classifiers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.