Semi-supervised classification and betweenness computation on large, sparse, directed graphs
From MaRDI portal
(Redirected from Publication:632618)
Recommendations
Cites work
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 2230269 (Why is no real title available?)
- scientific article; zbMATH DE number 7646009 (Why is no real title available?)
- Introduction to semi-supervised learning.
- Kernels and regularization on graphs.
- Machine Learning: ECML 2004
- Random walk with restart: fast solutions and applications
- Randomized Shortest-Path Problems: Two Related Models
- SVM kernel by electric network
Cited in
(9)- Finding the best not the most: regularized loss minimization subgraph selection for graph classification
- A bag-of-paths framework for network data analysis
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Similarity-based classification in partially labeled networks
- Review of statistical network analysis: models, algorithms, and software
- ELECTRIC NETWORK CLASSIFIERS FOR SEMI-SUPERVISED LEARNING ON GRAPHS
- Graph regularization centrality
- Directed LPA: propagating labels in directed networks
- A second order cone programming approach for semi-supervised learning
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)