Much of the success in machine learning can be attributed to the ability of learning methods to adequately represent, extract, and exploit inherent structure present in the data under interest. Kernel methods represent a rich family of techniques that harvest on this principle. Domain-specific kernels are able to exploit rich structural information present in the input data to deliver state of the art results in many application areas, e.g. natural language processing (NLP), bio-informatics, computer vision and many others. The use of kernels to capture relationships in the input data has made Support Vector Machine (SVM) algorithm the state of the art tool in many application areas. Nevertheless, kernel learning remains a computationally expensive process. The contribution of this paper is to make learning with structural kernels, e.g. tree kernels, more applicable to real-world large-scale tasks. More specifically, we propose two important enhancements of the approximate cutting plane algorithm to train Support Vector Machines with structural kernels: (i) a new sampling strategy to handle class-imbalanced problem; and (ii) a parallel implementation, which makes the training scale almost linearly with the number of CPUs. We also show that theoretical convergence bounds are preserved for the improved algorithm. The experimental evaluations demonstrate the soundness of our approach and the possibility to carry out large-scale learning with structural kernels.
|Titolo:||Large-scale learning with structural kernels for class-imbalanced datasets|
|Autori:||Severyn, Aliaksei; Moschitti, Alessandro|
|Titolo del volume contenente il saggio:||Large-scale learning with structural kernels for class-imbalanced datasets|
|Luogo di edizione:||Budapest, Hungary|
|Anno di pubblicazione:||2011|
|Codice identificativo Scopus:||2-s2.0-84865211823|
|Appare nelle tipologie:||04.1 Saggio in atti di convegno (Paper in proceedings)|