Semi-supervised classification and betweenness computation on large, sparse, directed graphs
From MaRDI portal
Publication:632618
DOI10.1016/j.patcog.2010.11.019zbMath1209.68418MaRDI QIDQ632618
Masashi Shimbo, Hugues Bersini, Amin Mantrach, Pascal Francq, Marco Saerens, Nicolas van Zeebroeck
Publication date: 25 March 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.11.019
kernel methods; semi-supervised classification; graph mining; within-network classification; graph-based classification; betweenness centrality; kernel on a graph; large-scale graphs
68T05: Learning and adaptive systems in artificial intelligence
68M10: Network design and communication in computer systems
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Review of statistical network analysis: models, algorithms, and software, Graph regularization centrality, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, A second order cone programming approach for semi-supervised learning, Finding the best not the most: regularized loss minimization subgraph selection for graph classification, A bag-of-paths framework for network data analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Random walk with restart: fast solutions and applications
- Introduction to Semi-Supervised Learning
- Learning Theory and Kernel Machines
- Randomized Shortest-Path Problems: Two Related Models
- Machine Learning: ECML 2004
