Faster compression methods for a weighted graph using locality sensitive hashing

DOI10.1016/J.INS.2017.07.033zbMath1436.68246OpenAlexW2740846521MaRDI QIDQ780991

Waqas Nawaz, Kifayat Ullah Khan, Tu Nguyen Anh, Young-Koo Lee, Batjargal Dolgorsuren

Publication date: 16 July 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.07.033

zbMATH Keywords

locality sensitive hashinggraph summarizationmin-wise hashingpersonalized summary graphset-based merging

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Signed and weighted graphs (05C22)

Related Items (2)

Effective lossless condensed representation and discovery of spatial co-location patterns ⋮ Sparse graph based self-supervised hashing for scalable image retrieval

Uses Software

• WebGraph
• ArnetMiner

Cites Work

• From the Cover: The structure of scientific collaboration networks
• Unnamed Item

This page was built for publication: Faster compression methods for a weighted graph using locality sensitive hashing