2014 | OriginalPaper | Chapter
A Nonlinear Classifier Based on Factorization Machines Model
Authors : XiaoLong Liu, YanMing Zhang, ChengLin Liu
Published in: Pattern Recognition
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Polynomial Classifier (PC) is a powerful nonlinear classification method that has been widely used in many pattern recognition problems. Despite its high classification accuracy, its computational cost for both training and testing is polynomial with the dimensionality of input data, which makes it unsuitable for large-scale problems. In this work, based on the idea of factorization machines (FMs), we propose an efficient classification method which approximates PC by performing a low-rank approximation to the coefficient matrix of PC. Our method can largely preserve the accuracy of PC, while has only linear computational complexity with the data dimensionality. We conduct extensive experiments to show the effectiveness of our method.