A sparse nonnegative matrix factorization technique for graph matching problems (Q898325)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6517925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sparse nonnegative matrix factorization technique for graph matching problems |
scientific article; zbMATH DE number 6517925 |
Statements
A sparse nonnegative matrix factorization technique for graph matching problems (English)
0 references
8 December 2015
0 references
graph matching
0 references
nonnegative matrix factorization
0 references
sparse model
0 references
Hungarian algorithm
0 references
0.8394951224327087
0 references
0.785323977470398
0 references
0.7493544220924377
0 references
0.7445141077041626
0 references
