Clustering and Embedding Using Commute Times
IEEE Transactions on Pattern Analysis and Machine Intelligence
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Evaluating Performance of Recommender Systems: An Experimental Comparison
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
On the properties of von Neumann kernels for link analysis
Machine Learning
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A graph-based approach for biomedical thesaurus expansion
Proceedings of the third international workshop on Data and text mining in bioinformatics
Network growth and the spectral evolution model
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Improved modeling of clinical data with kernel methods
Artificial Intelligence in Medicine
Interest prediction on multinomial, time-evolving social graphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Fast and accurate link prediction in social networking systems
Journal of Systems and Software
Two new graphs kernels in chemoinformatics
Pattern Recognition Letters
A link-analysis-based discriminant analysis for exploring partially labeled graphs
Pattern Recognition Letters
A Random Walk Model for Item Recommendation in Social Tagging Systems
ACM Transactions on Management Information Systems (TMIS)
| Hi-index | 0.00 |
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 von Neumann kernel, the regularized Laplacian kernel, the commute time kernel, and finally the Markov diffusion kernel and the cross-entropy diffusion matrix -- both introduced in this paper -- on a collaborative recommendation task involving a database. The database is viewed as a graph where elements are represented as nodes and relations as links between nodes. From this graph, seven kernels are computed, leading to a set of meaningful proximity measures between nodes, allowing to answer questions about the structure of the graph under investigation; in particular, recommend items to users. Crossvalidation results indicate that a simple nearest-neighbours rule based on the similarity measure provided by the regularized Laplacian, the Markov diffusion and the commute time kernels performs best. We therefore recommend the use of the commute time kernel for computing similarities between elements of a database, for two reasons: (1) it has a nice appealing interpretation in terms of random walks and (2) no parameter needs to be adjusted.