Skip to main navigation Skip to search Skip to main content

Minability through compression

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We offer an experimental proof that the application of compression to data files can be used as a evaluation technique for minability of the data. This is based on the fact that the presence of patterns embedded in data has an influence of compressibility.

Original languageEnglish
Title of host publicationProceedings - 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013
PublisherIEEE Computer Society
Pages32-36
Number of pages5
ISBN (Print)9781479930357
DOIs
StatePublished - 2013
Event15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013 - Timisoara, Romania
Duration: Sep 23 2013 → Sep 26 2013

Publication series

NameProceedings - 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013

Conference

Conference15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013
Country/TerritoryRomania
CityTimisoara
Period9/23/13 → 9/26/13

ASJC Scopus Subject Areas

  • Software
  • Modeling and Simulation

Keywords

  • Data mining
  • Kronecker product
  • Lossless compression
  • LZW
  • Market basket data
  • Patterns

Fingerprint

Dive into the research topics of 'Minability through compression'. Together they form a unique fingerprint.

Cite this