A divide-and-conquer algorithm for binary matrix completion (Q2187387)
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 7207297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer algorithm for binary matrix completion |
scientific article; zbMATH DE number 7207297 |
Statements
A divide-and-conquer algorithm for binary matrix completion (English)
0 references
2 June 2020
0 references
binary matrix completion
0 references
linear programming
0 references
recommender systems
0 references
0 references
0 references
0.89122814
0 references
0.88223684
0 references
0.8822367
0 references
0.8739555
0 references
0.87337935
0 references
0.87086415
0 references
0.8698065
0 references
0.8670177
0 references
0.86480933
0 references
0.86480933
0 references
