Chapter

Advances of Computational Intelligence in Industrial Systems

Volume 116 of the series Studies in Computational Intelligence pp 81-97

Kernels for Text Analysis

  • Evgeni TsivtsivadzeAffiliated withTurku Centre for Computer Science (TUGS), Department of Information Technology, University of Turku
  • , Tapio PahikkalaAffiliated withTurku Centre for Computer Science (TUGS), Department of Information Technology, University of Turku
  • , Jorma BobergAffiliated withTurku Centre for Computer Science (TUGS), Department of Information Technology, University of Turku
  • , Tapio SalakoskiAffiliated withTurku Centre for Computer Science (TUGS), Department of Information Technology, University of Turku

* Final gross prices may vary according to local VAT.

Get Access

Summary

During past decade, kernel methods have proved to be successful in different text analysis tasks. There are several reasons that make kernel based methods applicable to many real world problems especially in domains where data is not naturally represented in a vector form. Firstly, instead of manual construction of the feature space for the learning task, kernel functions provide an alternative way to design useful features automatically, therefore, allowing very rich representations. Secondly, kernels can be designed to incorporate a. prior knowledge about the domain. This property allows to notably improve performance of the general learning methods and their simple adaptation to the specific problem. Finally, kernel methods are naturally applicable in situations where data representation is not in a vectorial form, thus avoiding extensive preprocessing step. In this chapter, we present the main ideas behind kernel methods in general and kernels for text analysis in particular as well as provide an example of designing feature space for parse ranking problem with different kernel functions.