Efficient Formulations for 1-SVM and their Application to Recommendation Tasks

The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We introduce new formulations for the 1-SVM that can manipulate graph kernels quite efficiently. We demonstrate that the proposed formulations fully utilize the sparse structure of the Laplacian matrix, which enables the proposed approaches to be applied to recommendation tasks having a large number of customers and products in practical computational times. Results of various numerical experiments demonstrating the high performance of the proposed approaches are presented.

• Type: Journal
• Year: 2006
• Where: JCP
• Authors: Yasutoshi Yajima, Tien-Fang Kuo
• Keywords: JCP 2006, Laplacian Matrix, Recommendation Tasks, Support Vector Machines