Text classification by aggregation of SVD eigenvectors

4Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Text classification is a process where documents are categorized usually by topic, place, readability easiness, etc. For text classification by topic, a well-known method is Singular Value Decomposition. For text classification by readability, "Flesch Reading Ease index" calculates the readability easiness level of a document (e.g. easy, medium, advanced). In this paper, we propose Singular Value Decomposition combined either with Cosine Similarity or with Aggregated Similarity Matrices to categorize documents by readability easiness and by topic. We experimentally compare both methods with Flesch Reading Ease index, and the vector-based cosine similarity method on a synthetic and a real data set (Reuters-21578). Both methods clearly outperform all other comparison partners. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Symeonidis, P., Kehayov, I., & Manolopoulos, Y. (2012). Text classification by aggregation of SVD eigenvectors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7503 LNCS, pp. 385–398). https://doi.org/10.1007/978-3-642-33074-2_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free