On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching (Q2834517)
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: On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching |
scientific article; zbMATH DE number 6655095
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching |
scientific article; zbMATH DE number 6655095 |
Statements
22 November 2016
0 references
vertex nomination
0 references
graph matching
0 references
graph inference
0 references
stochastic block model
0 references
graph mining
0 references
0.87410235
0 references
0.86802167
0 references
0.8625161
0 references
0.8549796
0 references
0.8547686
0 references
0.8513265
0 references
On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching (English)
0 references
