Learning from good and bad data
Learning from good and bad data
Foundations of deductive databases and logic programming
An introduction to support Vector Machines: and other kernel-based learning methods
An introduction to support Vector Machines: and other kernel-based learning methods
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Learning of Boolean Functions Using Support Vector Machines
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
On a Capacity Control Using Boolean Kernels for the Learning of Boolean Functions
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
A survey of kernels for structured data
ACM SIGKDD Explorations Newsletter
An Efficient Algorithm for Computing Kernel Function Defined with Anti-unification
Inductive Logic Programming
Efficiency versus convergence of Boolean kernels for on-line learning algorithms
Journal of Artificial Intelligence Research
An intentional kernel function for RNA classification
DS'07 Proceedings of the 10th international conference on Discovery science
Support vector inductive logic programming
DS'05 Proceedings of the 8th international conference on Discovery Science
Inductive logic programming: yet another application of logic
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
| Hi-index | 0.00 |
In this paper we explain the fundamental idea of designing a class of kernel functions, called the intentional kernel, for structured data. The intentional kernel is designed with the property that every structured data is defined by derivation. Derivation means transforming a data or an expression into another. Typical derivation can be found in the field of formal language theory: A grammar defines a language in the sense that a sequence belongs to a language if it is transformed from a starting symbol by repeated application of the production rules in the grammar. Another example is in mathematical logic: A formula is proved if it is obtained from axioms by repeated application of inference rules. Combining derivation with the kernel-based learning mechanism derives the class of the intentional kernel.