Semi-supervised classification and betweenness computation on large, sparse, directed graphs (Q632618)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Semi-supervised classification and betweenness computation on large, sparse, directed graphs |
scientific article; zbMATH DE number 5870555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-supervised classification and betweenness computation on large, sparse, directed graphs |
scientific article; zbMATH DE number 5870555 |
Statements
Semi-supervised classification and betweenness computation on large, sparse, directed graphs (English)
0 references
25 March 2011
0 references
graph mining
0 references
semi-supervised classification
0 references
within-network classification
0 references
betweenness centrality
0 references
graph-based classification
0 references
kernel methods
0 references
kernel on a graph
0 references
large-scale graphs
0 references
0 references
0.7506887912750244
0 references
0.7343962788581848
0 references
0.7242467403411865
0 references
