An optimal text compression algorithm based on frequent pattern mining

Data Compression as a research area has been explored in depth over the years resulting in Huffman Encoding, LZ77, LZW, GZip, RAR, etc. Much of the research has been focused on conventional character/word based mechanism without looking at the larger perspective of pattern retrieval from dense and l...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of ambient intelligence and humanized computing Jg. 9; H. 3; S. 803 - 822
Hauptverfasser:	Oswald, C., Sivaselvan, B.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2018 Springer Nature B.V
Schlagworte:	Algorithms Artificial Intelligence Codes Coding Compression ratio Computational Intelligence Data compression Data integrity Data mining Datasets Dictionaries Engineering Entropy Huffman codes Original Research Pattern analysis Robotics and Automation Tables (data) User Interfaces and Human Computer Interaction Apriori algorithm Frequent pattern mining Lossless compression Huffman encoding Compression ratio
ISSN:	1868-5137, 1868-5145
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!