Considerations and Algorithms for Compression of Sets

Jesper Larsson

doi:10.1109/DCC.2013.83

Considerations and Algorithms for Compression of Sets

Jesper Larsson

Algorithms

Publikation: Konferencebidrag - EJ publiceret i proceeding eller tidsskrift › Poster › Forskning › peer review

Abstract

We consider compression of unordered sets of distinct elements. After a discus- sion of the general problem, we focus on compressing sets of fixed-length bitstrings in the presence of statistical information. We survey techniques from previous work, suggesting some adjustments, and propose a novel compression algorithm that allows transparent incorporation of various estimates for probability distribution. Our experimental results allow the conclusion that set compression can benefit from incorporat- ing statistics, using our method or variants of previously known techniques.

Originalsprog	Engelsk
Publikationsdato	2013
DOI	https://doi.org/10.1109/DCC.2013.83
Status	Udgivet - 2013
Begivenhed	Data Compression Conference 2013 - The Cliff Lodge Convention Center, Snowbird, Utah, USA Varighed: 20 mar. 2013 → 22 mar. 2013 Konferencens nummer: 23 http://www.cs.brandeis.edu/~dcc/

Konference

Konference	Data Compression Conference 2013
Nummer	23
Lokation	The Cliff Lodge Convention Center
Land/Område	USA
By	Snowbird, Utah
Periode	20/03/2013 → 22/03/2013
Internetadresse	http://www.cs.brandeis.edu/~dcc/

Emneord

Set compression
Bitstring compression
Probability distribution incorporation
Statistical information
Compression algorithms

Adgang til dokumentet

10.1109/DCC.2013.83

http://dx.doi.org/10.1109/DCC.2013.83

Citationsformater

@conference{5feffc825c1248cb97d90c89e6d4a2f7,

title = "Considerations and Algorithms for Compression of Sets",

abstract = "We consider compression of unordered sets of distinct elements. After a discus- sion of the general problem, we focus on compressing sets of fixed-length bitstrings in the presence of statistical information. We survey techniques from previous work, suggesting some adjustments, and propose a novel compression algorithm that allows transparent incorporation of various estimates for probability distribution. Our experimental results allow the conclusion that set compression can benefit from incorporat- ing statistics, using our method or variants of previously known techniques.",

keywords = "Set compression, Bitstring compression, Probability distribution incorporation, Statistical information, Compression algorithms, Set compression, Bitstring compression, Probability distribution incorporation, Statistical information, Compression algorithms",

author = "Jesper Larsson",

note = "Publication information missing. For what event was the poster produced? Is there an abstract, a prototype, a video? 13.09.2013 ; Data Compression Conference 2013, DCC 2013 ; Conference date: 20-03-2013 Through 22-03-2013",

year = "2013",

doi = "10.1109/DCC.2013.83",

language = "English",

url = "http://www.cs.brandeis.edu/\textasciitilde{}dcc/",

}

TY - CONF

T1 - Considerations and Algorithms for Compression of Sets

AU - Larsson, Jesper

N1 - Conference code: 23

PY - 2013

Y1 - 2013

N2 - We consider compression of unordered sets of distinct elements. After a discus- sion of the general problem, we focus on compressing sets of fixed-length bitstrings in the presence of statistical information. We survey techniques from previous work, suggesting some adjustments, and propose a novel compression algorithm that allows transparent incorporation of various estimates for probability distribution. Our experimental results allow the conclusion that set compression can benefit from incorporat- ing statistics, using our method or variants of previously known techniques.

AB - We consider compression of unordered sets of distinct elements. After a discus- sion of the general problem, we focus on compressing sets of fixed-length bitstrings in the presence of statistical information. We survey techniques from previous work, suggesting some adjustments, and propose a novel compression algorithm that allows transparent incorporation of various estimates for probability distribution. Our experimental results allow the conclusion that set compression can benefit from incorporat- ing statistics, using our method or variants of previously known techniques.

KW - Set compression

KW - Bitstring compression

KW - Probability distribution incorporation

KW - Statistical information

KW - Compression algorithms

KW - Set compression

KW - Bitstring compression

KW - Probability distribution incorporation

KW - Statistical information

KW - Compression algorithms

U2 - 10.1109/DCC.2013.83

DO - 10.1109/DCC.2013.83

M3 - Poster

T2 - Data Compression Conference 2013

Y2 - 20 March 2013 through 22 March 2013

ER -

Considerations and Algorithms for Compression of Sets

Abstract

Konference

Emneord

Adgang til dokumentet

Fingeraftryk

Citationsformater