Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-00399-8_10 | PAKDD Workshops |
Keywords | DocType | Volume |
kernel-based learning mechanism,combining derivation,intentional kernel,repeated application,formal language theory,kernel function,structured data,fundamental idea,typical derivation,inference rule,formal language | Conference | 5433 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Koichiro Doi | 1 | 31 | 7.59 |
| Akihiro Yamamoto | 2 | 135 | 26.84 |