Publication Type:

Journal Article

Source:

International Journal of Applied Engineering Research, Research India Publications, Volume 10, Number 10, p.27355-27373 (2015)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84932157061&partnerID=40&md5=cd456748fe2fb466b0aaa0ce58b1ad59

Abstract:

Internet is a pool of information, which contains billions of text documents which are stored in compressed format. In literature there are many text classification algorithms which work on uncompressed text documents. Since web pages contain text data which are stored in compressed format and the text documents must be taken back to its original format for the purpose of data mining activities. The process of decompression of text documents consumes more computational time. So this work introduces a study on different text classification and clustering algorithms and their comparison in compressed domain. Various methods for representing text in compressed domain are explained and experiments are conducted on LZW method for comparison. Different classification and clustering algorithms are also discussed. A comparative analysis on all these methods is presented. © 2015, Research India Publications, All rights Reserved.

Notes:

cited By 0

Cite this Research Publication

S. Akshay, Nayana, K., and Karthika, S., “A survey on classification and clustering algorithms for uncompressed and compressed text”, International Journal of Applied Engineering Research, vol. 10, pp. 27355-27373, 2015.