Automata and graph compression

Mehryar Mohri, Michael Riley, Ananda Theertha Suresh

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

Abstract

We present a theoretical framework for the compression of automata, which are widely used representations in speech processing, natural language processing and many other tasks. As a corollary, our framework further covers graph compression. We introduce a probabilistic process of graph and automata generation that is similar to stationary ergodic processes and that covers real-world phenomena. We also introduce a universal compression scheme LZA for this probabilistic model and show that LZA significantly outperforms other compression techniques such as gzip and the UNIX compress command for several synthetic and real data sets.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2989-2993
Number of pages5
Volume2015-June
ISBN (Print)9781467377041
DOIs
StatePublished - Sep 28 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: Jun 14 2015Jun 19 2015

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period6/14/156/19/15

Fingerprint

Speech processing
UNIX
Automata
Compression
Graph in graph theory
Processing
Cover
Ergodic Processes
Speech Processing
Stationary Process
Probabilistic Model
Natural Language
Corollary
Statistical Models
Framework

Keywords

  • graphs
  • Lempel-Ziv
  • universal compression

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Mohri, M., Riley, M., & Suresh, A. T. (2015). Automata and graph compression. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (Vol. 2015-June, pp. 2989-2993). [7283005] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7283005

Automata and graph compression. / Mohri, Mehryar; Riley, Michael; Suresh, Ananda Theertha.

Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. p. 2989-2993 7283005.

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

Mohri, M, Riley, M & Suresh, AT 2015, Automata and graph compression. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. vol. 2015-June, 7283005, Institute of Electrical and Electronics Engineers Inc., pp. 2989-2993, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7283005
Mohri M, Riley M, Suresh AT. Automata and graph compression. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June. Institute of Electrical and Electronics Engineers Inc. 2015. p. 2989-2993. 7283005 https://doi.org/10.1109/ISIT.2015.7283005
Mohri, Mehryar ; Riley, Michael ; Suresh, Ananda Theertha. / Automata and graph compression. Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. pp. 2989-2993
@inproceedings{b808a4d596c94c0bbd975e46f88413ac,
title = "Automata and graph compression",
abstract = "We present a theoretical framework for the compression of automata, which are widely used representations in speech processing, natural language processing and many other tasks. As a corollary, our framework further covers graph compression. We introduce a probabilistic process of graph and automata generation that is similar to stationary ergodic processes and that covers real-world phenomena. We also introduce a universal compression scheme LZA for this probabilistic model and show that LZA significantly outperforms other compression techniques such as gzip and the UNIX compress command for several synthetic and real data sets.",
keywords = "graphs, Lempel-Ziv, universal compression",
author = "Mehryar Mohri and Michael Riley and Suresh, {Ananda Theertha}",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/ISIT.2015.7283005",
language = "English (US)",
isbn = "9781467377041",
volume = "2015-June",
pages = "2989--2993",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Automata and graph compression

AU - Mohri, Mehryar

AU - Riley, Michael

AU - Suresh, Ananda Theertha

PY - 2015/9/28

Y1 - 2015/9/28

N2 - We present a theoretical framework for the compression of automata, which are widely used representations in speech processing, natural language processing and many other tasks. As a corollary, our framework further covers graph compression. We introduce a probabilistic process of graph and automata generation that is similar to stationary ergodic processes and that covers real-world phenomena. We also introduce a universal compression scheme LZA for this probabilistic model and show that LZA significantly outperforms other compression techniques such as gzip and the UNIX compress command for several synthetic and real data sets.

AB - We present a theoretical framework for the compression of automata, which are widely used representations in speech processing, natural language processing and many other tasks. As a corollary, our framework further covers graph compression. We introduce a probabilistic process of graph and automata generation that is similar to stationary ergodic processes and that covers real-world phenomena. We also introduce a universal compression scheme LZA for this probabilistic model and show that LZA significantly outperforms other compression techniques such as gzip and the UNIX compress command for several synthetic and real data sets.

KW - graphs

KW - Lempel-Ziv

KW - universal compression

UR - http://www.scopus.com/inward/record.url?scp=84969795612&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969795612&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7283005

DO - 10.1109/ISIT.2015.7283005

M3 - Conference contribution

SN - 9781467377041

VL - 2015-June

SP - 2989

EP - 2993

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -