A study on compressing graphical structures

Basak Guler, Aylin Yener, Prithwish Basu, Carl Andersen, Ananthram Swami

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations

    Abstract

    Many real-world systems such as the WWW, Semantic Web, logical expressions, and social networks can be represented in graphical forms. This paper studies compressing graphical structures from a graph entropy point of view. We show that structural entropy is equal to the chromatic entropy of the characteristic graph, termed the structural characteristic graph. We establish the relation between structural entropy and graph entropy, and investigate the cases when (conditional) graph entropy is equal to (conditional) chromatic entropy.

    Original languageEnglish (US)
    Title of host publication2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages823-827
    Number of pages5
    ISBN (Electronic)9781479970889
    DOIs
    StatePublished - Feb 5 2014
    Event2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014 - Atlanta, United States
    Duration: Dec 3 2014Dec 5 2014

    Publication series

    Name2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014

    Other

    Other2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014
    Country/TerritoryUnited States
    CityAtlanta
    Period12/3/1412/5/14

    All Science Journal Classification (ASJC) codes

    • Signal Processing
    • Information Systems

    Fingerprint

    Dive into the research topics of 'A study on compressing graphical structures'. Together they form a unique fingerprint.

    Cite this