Faster compression methods for a weighted graph using locality sensitive hashing (Q780991)
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: Faster compression methods for a weighted graph using locality sensitive hashing |
scientific article; zbMATH DE number 7221585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster compression methods for a weighted graph using locality sensitive hashing |
scientific article; zbMATH DE number 7221585 |
Statements
Faster compression methods for a weighted graph using locality sensitive hashing (English)
0 references
16 July 2020
0 references
graph summarization
0 references
set-based merging
0 references
personalized summary graph
0 references
min-wise hashing
0 references
locality sensitive hashing
0 references
0.7635597586631775
0 references
0.7403514385223389
0 references
0.7113132476806641
0 references
0.6689914464950562
0 references
0.6642137169837952
0 references
