Grčar, M.; Fortuna, B.; Mladenič, D. & Grobelnik, M.: kNN Versus SVM in the Collaborative Filtering Framework. In: Data Science and Classification (2006), S. 251-260 [Volltext][Kurzfassung][BibTeX]
We present experimental results of confronting the k-Nearest Neighbor (kNN) algorithm with Support Vector Machine (SVM) in
the collaborative filtering framework using datasets with different properties. While k-Nearest Neighbor is usually used forthe collaborative filtering tasks, Support Vector Machine is considered a state-of-the-art classification algorithm. Sincecollaborative filtering can also be interpreted as a classification/regression task, virtually any supervised learning algorithm(such as SVM) can also be applied. Experiments were performed on two standard, publicly available datasets and, on the otherhand, on a real-life corporate dataset that does not fit the profile of ideal data for collaborative filtering. We concludethat the quality of collaborative filtering recommendations is highly dependent on the quality of the data. Furthermore, wecan see that kNN is dominant over SVM on the two standard datasets. On the real-life corporate dataset with high level ofsparsity, kNN fails as it is unable to form reliable neighborhoods. In this case SVM outperforms kNN.