Research Paper on Text Data Compression Algorithm using Hybrid Approach?
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 12)Publication Date: 2014-12-30
Authors : Amandeep Singh Sidhu; Er. Meenakshi Garg;
Page : 1-10
Keywords : Text data compression; Dynamic Bit Reduction method; Huffman coding; lossless data compression;
Abstract
Data Compression is an area that needs to be given almost attention is text quality assessment. Different methodologies have been defined for this purpose. Hence choosing the best machine learning algorithm is really important. In addition to different compression technologies and methodologies, selection of a good data compression tool is most important. There is a complete range of different data compression techniques available both online and offline working such that it becomes really difficult to choose which technique serves the best. Here comes the necessity of choosing the right method for text compression purposes and hence an algorithm that can reveal the best tool among the given ones. A data compression algorithm is to be developed which consumes less time while provides more compression ratio as compared to existing techniques. In this paper we represent a hybrid approach to compress the text data. This hybrid approach is combination of Dynamic Bit reduction method and Huffman coding.
Other Latest Articles
- Modified Multi Way Feedback Encryption Standard (MWFES) Ver-I
- Image Segmentation Using Two Step Splitting Function
- Survey on Digital Watermarking on Medical Images
- Smart System to Recognize EEG Signal for Finding Brain Diseases Using K-Means Clustering
- Hybrid Cryptographic Processor for Secure Communication Using FPGA
Last modified: 2014-12-02 21:25:30