Distributed text classification with an ensemble kernel-based learning approach

  • Authors:
  • Catarina Silva;Uroš Lotrič;Bernardete Ribeiro;Andrej Dobnikar

  • Affiliations:
  • Department of Informatics Engineering, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal and Center of Informatics and Systems, University of Coimbra, Coimbra, ...;Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia;Department of Informatics Engineering, Center of Informatics and Systems, University of Coimbra, Coimbra, Portugal;Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constructing a single text classifier that excels in any given application is a rather inviable goal. As a result, ensemble systems are becoming an important resource, since they permit the use of simpler classifiers and the integration of different knowledge in the learning process. However, many text-classification ensemble approaches have an extremely high computational burden, which poses limitations in applications in real environments. Moreover, state-of-the-art kernel-based classifiers, such as support vector machines and relevance vector machines, demand large resources when applied to large databases. Therefore, we propose the use of a new systematic distributed ensemble framework to tackle these challenges, based on a generic deployment strategy in a cluster distributed environment. We employ a combination of both task and data decomposition of the text-classification system, based on partitioning, communication, agglomeration, and mapping to define and optimize a graph of dependent tasks. Additionally, the framework includes an ensemble system where we exploit diverse patterns of errors and gain from the synergies between the ensemble classifiers. The ensemble data partitioning strategy used is shown to improve the performance of baseline state-of-the-art kernel-based machines. The experimental results show that the performance of the proposed framework outperforms standard methods both in speed and classification.