Faster compression methods for a weighted graph using locality sensitive hashing

DOI10.1016/J.INS.2017.07.033MaRDI QIDQ780991zbMATH OpenOpenAlexFDO

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

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

graph summarizationlocality sensitive hashingmin-wise hashingpersonalized summary graphset-based merging

Mathematics Subject Classification ID

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

Recommendations

• An efficient weighted graph aggregation algorithm
• Set-based approximate approach for lossless graph summarization
• Graph summarization with quality guarantees
• Graph compression by BFS
• Speeding up algorithms on compressed web graphs

Cites work

• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• The structure of scientific collaboration networks

Cited in

(7)

• Sparse graph based self-supervised hashing for scalable image retrieval
• Effective lossless condensed representation and discovery of spatial co-location patterns
• An efficient weighted graph aggregation algorithm
• Graph Summarization with Latent Variable Probabilistic Models
• Distance-preserving graph compression techniques
• Improved space-efficient approximate nearest neighbor search using function inversion
• Set-based approximate approach for lossless graph summarization

Describes a project that uses

Uses Software

• WebGraph
• ArnetMiner

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780991)