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

From MaRDI portal
Revision as of 22:28, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Semi-supervised classification and betweenness computation on large, sparse, directed graphs
scientific article

    Statements

    Semi-supervised classification and betweenness computation on large, sparse, directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2011
    0 references
    0 references
    0 references
    0 references
    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 references
    0 references