An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification

DOI10.1016/J.NEUNET.2012.03.001zbMATH Open1245.68155DBLPjournals/nn/FoussFYPS12OpenAlexW2105295920WikidataQ51382820 ScholiaQ51382820MaRDI QIDQ448318FDOQ448318

Authors: François Fouss, Kevin Francoisse, Luh Yen, Marco Saerens, Alain Pirotte 

Publication date: 30 August 2012

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2012.03.001

Recommendations

• Kernels on Graphs as Proximity Measures
• Kernels and regularization on graphs.
• Graph kernels: a survey
• Graph kernels
• On graph kernels: hardness results and efficient alternatives.

zbMATH Keywords

graph miningcollaborative recommendationkernels on graphssemisupervised classification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Principal component analysis.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elements of Information Theory
• 10.1162/15324430260185619
• Kernels and regularization on graphs.
• Title not available (Why is that?)
• Statistical analysis of network data. Methods and models
• Pattern classification.
• Title not available (Why is that?)
• Markov Chains
• The matrix-forest theorem and measuring relations in small social groups
• Multidimensional scaling.
• Graph kernels
• Introduction to Information Retrieval
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transformation of non positive semidefinite correlation matrices
• Modern multidimensional scaling: theory and applications
• Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
• Authoritative sources in a hyperlinked environment
• Title not available (Why is that?)
• Title not available (Why is that?)
• Machine Learning: ECML 2004
• Title not available (Why is that?)
• Laplacians and the Cheeger inequality for directed graphs
• The matrix of maximum out forests of a digraph and its applications
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Title not available (Why is that?)
• Computing Communities in Large Networks Using Random Walks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Laplace eigenvalues of graphs---a survey
• Diffusion kernels on statistical manifolds
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Graphs, networks and algorithms
• Title not available (Why is that?)
• Nonlinear Dimensionality Reduction
• A Survey of Eigenvector Methods for Web Information Retrieval
• An r-Dimensional Quadratic Placement Algorithm
• The electrical resistance of a graph captures its commute and cover times
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Detecting network communities: a new systematic and efficient algorithm
• On the effectiveness of Laplacian normalization for graph semi-supervised learning
• Kernels for Structured Data
• Graph-Based Semi-Supervised Learning and Spectral Kernel Design
• On proximity measures for graph vertices
• Spanning forests of a digraph and their applications
• On a duality between metrics and \(\Sigma\)-proximities
• On the properties of von Neumann kernels for link analysis
• Commute times for a directed graph using an asymmetric Laplacian
• Title not available (Why is that?)
• Introduction to semi-supervised learning.
• Title not available (Why is that?)
• On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Learning Theory
• Semisupervised Learning for Computational Linguistics
• Semi-supervised classification and betweenness computation on large, sparse, directed graphs
• Random walk with restart: fast solutions and applications

Cited In (14)

• Kernels and regularization on graphs.
• Learning representations from dendrograms
• Unsupervised representation learning with minimax distance measures
• An optimization model for collaborative recommendation using a covariance-based regularizer
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• Covariance and correlation measures on a graph in a generalized bag-of-paths formalism
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Do logarithmic proximity measures outperform plain ones in graph clustering?
• Semi-supervised classification and betweenness computation on large, sparse, directed graphs
• A bag-of-paths framework for network data analysis
• Efficient clustering of large uncertain graphs using neighborhood information
• On the properties of von Neumann kernels for link analysis
• Semi-supervised learning with regularized Laplacian
• Dissecting graph measure performance for node clustering in LFR parameter space

Uses Software

• NetKit

This page was built for publication: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448318)