Combining convolution kernels defined on heterogeneous sub-structures

Authors:
Minlie Huang;Xiaoyan Zhu
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China
Venue:
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2007

Citing 9
Cited 0

Text Categorization with Suport Vector Machines: Learning with Many Relevant Features

ECML '98 Proceedings of the 10th European Conference on Machine Learning
Composite Kernels for Hypertext Categorisation

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Text classification using string kernels

The Journal of Machine Learning Research
Kernel methods for relation extraction

The Journal of Machine Learning Research
New ranking algorithms for parsing and tagging: kernels over discrete structures, and the voted perceptron

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Extracting relations with integrated information using kernel methods

ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
A shortest path dependency kernel for relation extraction

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
The GENIA corpus: an annotated research abstract corpus in molecular biology domain

HLT '02 Proceedings of the second international conference on Human Language Technology Research
A dependency-based method for evaluating broad-coverage parsers

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to choose adequate sub-structures, particularly for objects such as trees, graphs, and sequences. In this paper, we study the problem of sub-structure selection for constructing convolution kernels by combining heterogeneous kernels defined on different levels of substructures. Sub-kernels defined on different levels of sub-structures are combined together to incorporate their individual strengths because each level of sub-structure reflects its own angle to view the object. Two types of combination, linear and polynomial combination, are investigated. We analyze from the perspective of feature space why combined kernels exhibit potential advantages. Experiments indicate that the method will be helpful for combining kernels defined on arbitrary levels of sub-structures.