A training algorithm for optimal margin classifiers
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Solving the multiple instance problem with axis-parallel rectangles
Artificial Intelligence
Data mining: practical machine learning tools and techniques with Java implementations
Data mining: practical machine learning tools and techniques with Java implementations
An introduction to support Vector Machines: and other kernel-based learning methods
An introduction to support Vector Machines: and other kernel-based learning methods
Relational instance-based learning with lists and terms
Machine Learning - Special issue on inducive logic programming
A polynomial time computable metric between point sets
Acta Informatica
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
The Journal of Machine Learning Research
Question classification using support vector machines
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Learning comprehensible theories from structured data
Advanced lectures on machine learning
A survey of kernels for structured data
ACM SIGKDD Explorations Newsletter
Dual Clustering: Integrating Data Clustering over Optimization and Constraint Domains
IEEE Transactions on Knowledge and Data Engineering
Learning with kernels and logical representations
Probabilistic inductive logic programming
Local feature based tensor kernel for image manifold learning
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Support vector inductive logic programming
DS'05 Proceedings of the 8th international conference on Discovery Science
Hi-index | 0.00 |
Learning from structured data is becoming increasingly important. However, most prior work on kernel methods has focused on learning from attribute-value data. Only recently have researchers started investigating kernels for structured data. This paper describes how kernel definitions can be simplified by identifying the structure of the data and how kernels can be defined on this structure. We propose a kernel for structured data, prove that it is positive definite, and show how it can be adapted in practical applications.