A bag-of-paths framework for network data analysis

DOI10.1016/j.neunet.2017.03.010zbMath1434.68535arXiv1302.6766OpenAlexW1777267699WikidataQ36359248 ScholiaQ36359248MaRDI QIDQ2181053

Fabrice Rossi, Ilkka Kivimäki, Amin Mantrach, Marco Saerens, Kevin Francoisse

Publication date: 18 May 2020

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

Full work available at URL: https://arxiv.org/abs/1302.6766

zbMATH Keywords

network scienceresistance distancesemi-supervised classificationlink analysiscommute-time distancedistance and similarity on a graph

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Computational aspects of data analysis and big data (68T09)

Related Items (3)

Design of biased random walks on a graph with application to collaborative recommendation ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The walk distances in graphs
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• A sum-over-paths extension of edit distances accounting for all sequence alignments
• Semi-supervised classification and betweenness computation on large, sparse, directed graphs
• Graphs, networks and algorithms
• Random walk with restart: fast solutions and applications
• Kernel methods in machine learning
• Statistical analysis of network data. Methods and models
• Operations research in transportation systems. Ideas and schemes of optimization methods for strategic planning and operations management
• The matrix-forest theorem and measuring relations in small social groups
• Modern multidimensional scaling: theory and applications
• Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• On proximity measures for graph vertices
• Data science, learning by latent structures, and knowledge discovery.
• Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
• Machine Learning in Complex Networks
• Hitting and commute times in large graphs are often misleading
• Graph-Based Semi-Supervised Learning
• Information Theory and Statistical Mechanics
• Introduction to Information Retrieval
• Introduction to Semi-Supervised Learning
• Markov Chains
• Computing Communities in Large Networks Using Random Walks
• Semisupervised Learning for Computational Linguistics
• Randomized Shortest-Path Problems: Two Related Models
• Studying New Classes of Graph Metrics
• Machine Learning: ECML 2004
• Networks
• Network Science

This page was built for publication: A bag-of-paths framework for network data analysis