Sciweavers

7 search results - page 1 / 2
» An Experimental Investigation of Graph Kernels on a Collabor...
Sort
View
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
13 years 10 months ago
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
François Fouss, Luh Yen, Alain Pirotte, Mar...
ICPR
2008
IEEE
13 years 11 months ago
Alternative similarity functions for graph kernels
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...
Jérôme Kunegis, Andreas Lommatzsch, C...
ML
2008
ACM
146views Machine Learning» more  ML 2008»
13 years 4 months ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
CSCW
2002
ACM
13 years 4 months ago
On the recommending of citations for research papers
Collaborative filtering has proven to be valuable for recommending items in many different domains. In this paper, we explore the use of collaborative filtering to recommend resea...
Sean M. McNee, Istvan Albert, Dan Cosley, Prateep ...
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 4 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec