Semi-supervised classification and betweenness computation on large, sparse, directed graphs
DOI10.1016/J.PATCOG.2010.11.019zbMATH Open1209.68418OpenAlexW2169847772MaRDI QIDQ632618FDOQ632618
Authors: Amin Mantrach, Nicolas van Zeebroeck, Pascal Francq, Masashi Shimbo, H. Bersini, Marco Saerens
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
Recommendations
kernel methodssemi-supervised classificationgraph miningwithin-network classificationgraph-based classificationbetweenness centralitykernel on a graphlarge-scale graphs
Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10)
Cites Work
- Kernels and regularization on graphs.
- Title not available (Why is that?)
- Machine Learning: ECML 2004
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to semi-supervised learning.
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Random walk with restart: fast solutions and applications
- SVM kernel by electric network
- Randomized Shortest-Path Problems: Two Related Models
Cited In (9)
- Directed LPA: propagating labels in directed networks
- ELECTRIC NETWORK CLASSIFIERS FOR SEMI-SUPERVISED LEARNING ON GRAPHS
- Graph regularization centrality
- Finding the best not the most: regularized loss minimization subgraph selection for graph classification
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- A bag-of-paths framework for network data analysis
- A second order cone programming approach for semi-supervised learning
- Similarity-based classification in partially labeled networks
- Review of statistical network analysis: models, algorithms, and software
Uses Software
This page was built for publication: Semi-supervised classification and betweenness computation on large, sparse, directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632618)