Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming (Q5057261): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex nomination, consistent estimation, and adversarial modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue Ratio Test for the Number of Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed membership stochastic blockmodels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4558156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and exchangeable random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex nomination schemes for membership prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latent Space Approaches to Social Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial singular value decomposition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial solvability of convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2834517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5381123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex nomination via seeded graph matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The Multidimensional Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized solution of the orthogonal Procrustes problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex nomination: the canonical sampling and the extended spectral nomination schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Dot Product Graph Models for Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic dimensionality selection from the scree plot via the use of profile likelihood / rank
 
Normal rank

Latest revision as of 02:55, 31 July 2024

scientific article; zbMATH DE number 7633318
Language Label Description Also known as
English
Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
scientific article; zbMATH DE number 7633318

    Statements

    Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 December 2022
    0 references
    correlated graphs
    0 references
    generalized random dot product graphs
    0 references
    point set registration
    0 references
    vertex nomination
    0 references
    0 references
    0 references

    Identifiers