The paper “On Reverse Feature Engineering of Syntactic Tree Kernels” co-written by D. Pighin and A. Moschitti has been presented at CoNLL 2010 in Uppsala, Sweden on July 15th-16th, 2010
In this paper, we provide a theoretical framework for feature selection in tree ker- nel spaces based on gradient-vector com- ponents of kernel-based machines. We show that a huge number of features can be discarded without a significant decrease in accuracy. Our selection algorithm is as accurate as and much more efficient than those proposed in previous work. Com- parative experiments on three interesting and very diverse classification tasks, i.e. Question Classification, Relation Extrac- tion and Semantic Role Labeling, support our theoretical findings and demonstrate the algorithm performance.
The LK project is funded by the European Commission under Project No. 231126