2017
DOI: 10.1007/s12652-017-0540-2
|View full text |Cite
|
Sign up to set email alerts
|

An optimal text compression algorithm based on frequent pattern mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(10 citation statements)
references
References 40 publications
0
10
0
Order By: Relevance
“…The LZW works by saving new phrases in empty dictionary entries and replacing phrases in the input text by pointers to the corresponding dictionary entries. Oswald et al have come up with few efficient text compression algorithms based on the perspective on knowledge engineering (data mining) 14‐20 …”
Section: Related Workmentioning
confidence: 99%
“…The LZW works by saving new phrases in empty dictionary entries and replacing phrases in the input text by pointers to the corresponding dictionary entries. Oswald et al have come up with few efficient text compression algorithms based on the perspective on knowledge engineering (data mining) 14‐20 …”
Section: Related Workmentioning
confidence: 99%
“…Well established approaches for volume reduction without compromising information density are compression or information extraction. Commercial lossless compression tools include LZ77, bzip2, GZip and RAR [44]. Many compression methods focus on video and image data [50], text [44], or all combined.…”
Section: Immediate Processing and Actuation Without Transmissionmentioning
confidence: 99%
“…To further improve CR specific for text files, Lempel-Ziv-Welch (LZW) based methods are widely studied [39]- [41]. Oswald et al [42] explore text compression in the perspective of Data Mining. They enhance Huffman Encoding by frequent pattern mining.…”
Section: Related Workmentioning
confidence: 99%