Semi-supervised classification and betweenness computation on large, sparse, directed graphs

DOI10.1016/j.patcog.2010.11.019zbMath1209.68418OpenAlexW2169847772MaRDI 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

zbMATH Keywords

kernel methodssemi-supervised classificationgraph miningwithin-network classificationgraph-based classificationbetweenness centralitykernel on a graphlarge-scale graphs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Finding the best not the most: regularized loss minimization subgraph selection for graph classification ⋮ A bag-of-paths framework for network data analysis ⋮ Graph regularization centrality ⋮ A second order cone programming approach for semi-supervised learning ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ Review of statistical network analysis: models, algorithms, and software

Uses Software

• NetKit
• SGTlight

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

This page was built for publication: Semi-supervised classification and betweenness computation on large, sparse, directed graphs