Classifying unlabeled short texts using a fuzzy declarative approach

  • Authors:

  • Francisco P. Romero;Pascual Julián-Iranzo;Andrés Soto;Mateus Ferreira-Satler;Juan Gallardo-Casero

  • Affiliations:

  • Department of Information Technologies and Systems, University of Castilla La Mancha, Ciudad Real, Spain 13071;Department of Information Technologies and Systems, University of Castilla La Mancha, Ciudad Real, Spain 13071;Department of Computer Science, Universidad Autònoma del Carmen, Campeche, Mèxico CP 24160;Department of Information Technologies and Systems, University of Castilla La Mancha, Ciudad Real, Spain 13071;Department of Information Technologies and Systems, University of Castilla La Mancha, Ciudad Real, Spain 13071

  • Venue:
  • Language Resources and Evaluation
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Web 2.0 provides user-friendly tools that allow persons to create and publish content online. User generated content often takes the form of short texts (e.g., blog posts, news feeds, snippets, etc). This has motivated an increasing interest on the analysis of short texts and, specifically, on their categorisation. Text categorisation is the task of classifying documents into a certain number of predefined categories. Traditional text classification techniques are mainly based on word frequency statistical analysis and have been proved inadequate for the classification of short texts where word occurrence is too small. On the other hand, the classic approach to text categorization is based on a learning process that requires a large number of labeled training texts to achieve an accurate performance. However labeled documents might not be available, when unlabeled documents can be easily collected. This paper presents an approach to text categorisation which does not need a pre-classified set of training documents. The proposed method only requires the category names as user input. Each one of these categories is defined by means of an ontology of terms modelled by a set of what we call proximity equations. Hence, our method is not category occurrence frequency based, but highly depends on the definition of that category and how the text fits that definition. Therefore, the proposed approach is an appropriate method for short text classification where the frequency of occurrence of a category is very small or even zero. Another feature of our method is that the classification process is based on the ability of an extension of the standard Prolog language, named Bousi~Prolog , for flexible matching and knowledge representation. This declarative approach provides a text classifier which is quick and easy to build, and a classification process which is easy for the user to understand. The results of experiments showed that the proposed method achieved a reasonably useful performance.