An Efficient Text Compression Algorithm - Data Mining Perspective

Oswald, C.; Ghosh, Anirban; Sivaselvan, B.

doi:10.1007/978-3-319-26832-3_53

Cited by 10 publications

(7 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

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%

An efficient and novel data clustering and run length encoding approach to image compression

Oswald

Haritha

Raja

et al. 2021

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

The paper explores the domain of lossy compression, specifically incorporating data mining techniques in the process of image encoding. Clustering is employed to group similar pixels in the image and henceforth use cluster labels in compressing the image. The proposed approach replaces the Discrete Cosine Transform phase of Conventional JPEG with a combination of clustering and Run Length Encoding so as to handle redundant data in the image effectively. Simulation with respect to benchmark data indicates improved compression (42.5%) in relation to existing solutions. Image quality metrices such as PSNR, structural similarity have also been tested and it is observed that the proposed approach achieves significant compression ratio with negligible loss in visual quality.

show abstract

Section: Related Workmentioning

confidence: 99%

An efficient and novel data clustering and run length encoding approach to image compression

Oswald

Haritha

Raja

et al. 2021

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…It gives good results based on some assumptions. Start/Stop code, Burrow Wheeler Transform, Self-Deleting Codes, Location Based Encoding, Elias codes, Move to Front Encoding, etc are some of the other techniques [1,[13][14][15]. These methods exhibit single character or word based encoding mechanism and the way in which the statistical model is built, determines the quality of compression.…”

Section: Related Workmentioning

confidence: 99%

“…In LZ78 class of algorithms, a tree is used to maintain the dictionary where available memory size is limited and they have complex decoding than LZ77 [19]. Other variations are LZT, LZRW1, ZIP, LZP1, DMC, Context Tree Weighting, Win RAR, RAR, LZJ, LZP2, GZIP, bzip2, LZW, LZFG, UNIX Compress, V.42bis, CRC etc [1,15,17,[20][21][22]. Limitations such as huge memory requirement, low compression and time inefficiency, relying on word based encoding are present in most of these above techniques.…”

Section: Related Workmentioning

confidence: 99%

“…Limitations such as huge memory requirement, low compression and time inefficiency, relying on word based encoding are present in most of these above techniques. [15] has shown that text compression by frequent pattern mining technique is better than conventional Huffman but time taken to compress is more. Our approach require lesser time than [15] using efficient hash based Frequent Pattern Mining mechanism.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Hash based Frequent Pattern Mining approach to Text Compression

Oswald¹,

Srinidhi²,

Vishnu³

et al. 2017

Proceedings of the First EAI International Conference on Computer Science and Engineering

Self Cite

View full text Add to dashboard Cite

The paper explores the compression perspective of Data Mining. Huffman Encoding is enhanced through Frequent Pattern Mining, a non-trivial phase in Association Rule Mining(ARM) technique, in the field of Data Mining. The seminal Apriori algorithm has been modified in such a way that optimal number of patterns(sequence of characters) are obtained. These patterns are employed in the Encoding process of our algorithm, instead of single character based code assignment approach of Conventional Huffman Encoding. Our approach is built on an efficient hash based data structure, which minimizes the compression time by employing an efficient and novel technique for finding the frequency of the patterns. Simulation over benchmark corpus clearly shows the efficiency of our proposed work in relation to Conventional Huffman Encoding in terms of compression ratio and time.

show abstract

“…Huffman coding (Huffman, 1952) is very popular in data compression area. Nowadays it is used in data compression for wireless and sensor networks (Săcăleanu et al, 2011;Renugadevi and Darisini, 2013), data mining (Oswald and Sivaselvan, 2018;Oswald et al, 2015). It is also found efficient for data compression in low resource systems (Radhakrishnan et al, 2016;Matai et al, 2014;Wang and Lin, 2016).…”

Section: Introductionmentioning

confidence: 99%

Huffman Based Code Generation Algorithms: Data Compression Perspectives

Habib¹,

Islam²,

Rahman³

2018

Journal of Computer Science

View full text Add to dashboard Cite

This article proposes two dynamic Huffman based code generation algorithms, namely Octanary and Hexanary algorithm, for data compression. Faster encoding and decoding process is very important in data compression area. We propose tribit-based (Octanary) and quadbitbased (Hexanary) algorithm and compare the performance with the existing widely used single bit (Binary) and recently introduced dibit (Quaternary) algorithms. The decoding algorithms for the proposed techniques have also been described. After assessing all the results, it is found that the Octanary and the Hexanary techniques perform better than the existing techniques in terms of encoding and decoding speed.

show abstract

An Efficient Text Compression Algorithm - Data Mining Perspective

Cited by 10 publications

References 16 publications

An efficient and novel data clustering and run length encoding approach to image compression

An efficient and novel data clustering and run length encoding approach to image compression

Hash based Frequent Pattern Mining approach to Text Compression

Huffman Based Code Generation Algorithms: Data Compression Perspectives

Contact Info

Product

Resources

About