Research Article
Classification of Text Documents Using B-Tree
@INPROCEEDINGS{10.1007/978-3-642-27308-7_66, author={B. Harish and D. Guru and S. Manjunath}, title={Classification of Text Documents Using B-Tree}, proceedings={Advances in Computer Science and Information Technology. Computer Science and Engineering. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part II}, proceedings_a={CCSIT PATR II}, year={2012}, month={11}, keywords={Text documents Term sequence B-Tree Classification}, doi={10.1007/978-3-642-27308-7_66} }- B. Harish
D. Guru
S. Manjunath
Year: 2012
Classification of Text Documents Using B-Tree
CCSIT PATR II
Springer
DOI: 10.1007/978-3-642-27308-7_66
Abstract
In this paper, we propose an unconventional method of representing and classifying text documents, which preserves the sequence of term occurrence in a test document. The term sequence is effectively preserved with the help of a novel datastructure called ‘Status Matrix’. In addition, in order to avoid sequential matching during classification, we propose to index the terms in B-tree, an efficient index scheme. Each term in B-tree is associated with a list of class labels of those documents which contain the term. Further the corresponding classification technique has been proposed. To corroborate the efficacy of the proposed representation and status matrix based classification, we have conducted extensive experiments on various datasets.