Member, IEEE Pierre-Francois Marteau

Nicolas Bonnel

Gildas M Énier

P.-F Marteau

G Ménier

Discrete Elastic Inner Vector Spaces with Application to Time Series and Sequence Mining

Keywords: Vector space, Discrete time series, Sequence mining, Non-uniform sampling, Elastic inner product, Time warping

This paper proposes a framework dedicated to the construction of what we call discrete elastic inner product allowing one to embed sets of non-uniformly sampled multivariate time series or sequences of varying lengths into inner product space structures. This framework is based on a recursive definition that covers the case of multiple embedded time elastic dimensions. We prove that such inner products exist in our general framework and show how a simple instance of this inner product class operates on some prospective applications, while generalizing the Euclidean inner product. Classification experimentations on time series and symbolic sequences datasets demonstrate the benefits that we can expect by embedding time series or sequences into elastic inner spaces rather than into classical Euclidean spaces. These experiments show good accuracy when compared to the euclidean distance or even dynamic programming algorithms while maintaining a linear algorithmic complexity at exploitation stage, although a quadratic indexing phase beforehand is required.

INTRODUCTION

T IME series analysis in metric spaces has attracted much attention over numerous decades and in various domains such as biology, statistics, sociology, networking, signal processing, etc, essentially due to the ubiquitous nature of time series, whether they are symbolic or numeric. Among other characterizing tools, time warp distances (see [START_REF] Velichko | Automatic recognition of 200 words[END_REF], [START_REF] Sakoe | A dynamic programming approach to continuous speech recognition[END_REF], and more recently [START_REF] Chen | On the marriage of lp-norm and edit distance[END_REF], [START_REF] Marteau | Time warp edit distance with stiffness adjustment for time series matching[END_REF] among other references) have shown some interesting robustness compared to the Euclidean metric especially when similarity searching in time series data bases is an issue. Unfortunately, this kind of elastic distance does not enable direct construction of definite kernels which are useful when addressing regression, classification or clustering of time series. A fortiori, they do not make it possible to directly construct inner products involving some time elasticity, which are basically able to cope with some stretching or some compression along specific dimension. Recently, [START_REF] Marteau | Constructing positive elastic kernels with application to time series classification[END_REF] have shown that it is quite easy to propose inner product with time elasticity capability at least for some restricted time series spaces, basically spaces containing uniformly sampled time series, all of which have the same lengths (in such cases, time series can be embedded easily in Euclidean spaces).

The aim of this paper is to derive an extension from this preliminary work for the construction of time elastic inner products, to achieve the construction of an elastic inner product structure for a quasi-unrestricted set of sequential data or time series, i.e. sets for which the data is not necessarily uniformly sampled and may have any lengths. Section two of the paper gives the main notations used throughout this paper and presents a recursive construction for inner-like products. It then gives the conditions and the proof of existence of elastic inner products (and elastic vector spaces) defined on a quasi-unrestricted set of time series while explaining what we mean by quasi-unrestricted. The third section succinctly presents some preliminary applications, mainly to highlight some of the features of elastic inner product vector spaces such as orthogonality. The fourth section presents two effective experimentations, the first one relating to time series classification and the second one addressing symbolic sequences classification.

ELASTIC INNER PRODUCT VECTOR SPACES

Starting from the recursive structure of the Dynamic Time Warping (DTW) equation in which the non linear M ax operator is replaced by a Sum operator, we propose a quite general and parameterized recursive equation that we call elastic product. Our goal in this section is to derive the conditions for which such elastic product is an inner product that maintains a form of time elasticity.

Sequence and sequence element

Definition 2.1. Given a finite sequence A we denote by A(i) the i th element (symbol or sample) of sequence A. We will consider that A(i) ∈ S × T where (S, ⊕ S , ⊗ S ) is a vector space that embeds the multidimensional space variables (e.g. S ⊂ R d , with d ∈ N + ) and T ⊂ R embeds the timestamps variable, so that we can write A(i) = (a(i), t a(i) ) where a(i) ∈ S and t a(i) ∈ T , with the condition that t a(i) > t a(j) whenever i > j (timestamps strictly increase in the sequence of samples). A j i with i ≤ j is the subsequence consisting of the i th through the j th element (inclusive) of A. So A j i = A(i)A(i + 1)...A(j). Λ denotes the null element. By convention A j i with i > j is the null time series, e.g. Ω.

Sequence set

Definition 2.2. The set of all finite discrete time series is thus embedded in a spacetime characterized by a single discrete temporal dimension, that encodes the timestamps, and any number of spatial dimensions that encode the value of the time series at a given timestamp. We note U = {A p 1 |p ∈ N} the set of all finite discrete time series. A p 1 is a time series with discrete index varying between 1 and p. We note Ω the empty sequence (with null length) and by convention A 0 1 = Ω so that Ω is a member of set U. |A| denotes the length of the sequence A. Let U p = {A ∈ U | |A| ≤ p} be the set of sequences whose length is shorter or equal to p. Finally let U * be the set of discrete time series defined on (S -{0 S }) × T , i.e. the set of time series that do not contain the null spatial value. We denote by 0 S the null value in S.

Scalar multiplication on U

* Definition 2.3. For all A ∈ U * and all λ ∈ R, C = λ ⊗ A ∈ U * is such that for all i ∈ N such that 0 ≤ i ≤ |A|, C(i) = (λ.a(i), t a(i) ) and thus |C| = |A|.

Addition on U *

Definition 2.4. For all (A, B) ∈ (U * ) 2 , the addition of A and B, noted C = A⊕B ∈ U * , is defined in a constructive manner as follows: let i, j and k be in N.

k = i = j = 1, As long as 1 ≤ i ≤ |A| and 1 ≤ j ≤ |B|, if t a(i) < t b(j) , C(k) = (a(i), t a(i) ) and i ← i + 1, k ← k + 1 else if t a(i) > t b(j) , C(k) = (b(j), t b(j) ) and j ← j + 1, k ← k + 1 else if a(i) + b(j) = 0, C(k) = (a(i) + b(j), t a(i) ) and i ← i + 1, j ← j + 1, k ← k + 1 else i ← i + 1, j ← j + 1
Three comments need to be made at this level to clarify the semantic of the operator ⊕: i) Note that the ⊕ addition of two time series of equal lengths and uniformly sampled coincides with the classical addition in vector spaces. Fig. 1 gives an example of the addition of two time series that are not uniformly sampled and that have different lengths, except that zero values are discarded to ensure that the sum of two time series will remain a member of U * . ii) Implicitly (in light of the last case described in Def.

2.4), any sequence element of the sort (0 S , t), where 0 S is the null value in S and t ∈ T must be assimilated to the null sequence element Λ. For instance, the addition of

A = (1, 1)(1, 2) with B = (-1, 1)(1, 2) is C = A ⊕ B = (2,
2): the addition of the two first sequence elements is (0, 1) that is assimilated to Λ and as such suppressed in C. iii) The ⊕ operator, when restricted to the set

U * is re- versible in that if C = A⊕B then A = C ⊕((-1)⊗B) or B = C ⊕ ((-1) ⊗ A)
. This is not the case if we consider the entire set U.

Elastic product (ep)

Definition 2.5. A function < ., . >:

U * × U * → R
is called an Elastic Product if, there exists a function f : S 2 → R, a strictly positive function g : T 2 → R + and three constants α, β and ξ in R such that, for any pair of sequences A p 1 , B q 1 , the following recursive equation holds:

< A p 1 , B q 1 > ep =    α• < A p-1 1 , B q 1 > ep β• < A p-1 1 , B q-1 1 > ep +f (a(p), b(q)) • g(t a(p) , t b(q) ) α• < A p 1 , B q-1 1 > ep (1)
This recursive definition requires defining an initialization. To that end we set,

∀A ∈ U * , < A, Ω > ep =< Ω, A > ep =< Ω, Ω > ep = ξ,
where ξ is a real constant (typically we set ξ = 0), and Ω is the null sequence, with the convention that A i j = Ω whenever i > j.

This paper addresses the most interesting question of the existence of elastic inner products on the set U * , i.e. without any restriction on the lengths of the considered time series nor the way they are sampled. If the choice of functions f and g, although constrained, is potentially large, we show hereinafter that the choice for constants α, β and ξ is unique.

Existence of elastic inner products(eip) defined on U

* Theorem 2.1. < ., . > ep is an inner product on (U * , ⊕, ⊗) iff: i) ξ = 0.
ii) g : (T × T ) → R is symmetric and strictly positive, iii) f is an inner product on (S, ⊕ S , ⊗ S ), if we extend the domain of f on S while setting f (0 S , 0 S ) = 0. iv) α = 1 and β = -1, Fig. 1. The ⊕ binary operator when applied to two discrete time series of variable lengths and not uniformly sampled. Co-occurring events have been slightly separated at the top of the figure for readability purposes.

proof of theorem 2.1

Proof of the direct implication

Let us suppose first that < ., . > ep is an inner product defined on U * . Then since < ., . > ep is positive-definite necessarily < Ω, Ω > ep = ξ = 0. Furthermore, for any A 1 = (a, t 1 ) and A 2 = (a, t 2 ) ∈ U * with a = 0 S , < A 1 , A 2 > ep = g(t 1 , t 2 ).f (a, a) = 0. Since < .; . > ep is symmetric, we get that g(t 1 , t 2 ) = g(t 2 , t 1 ) for any (t 1 , t 2 ) ∈ T 2 which establishes that g is symmetric. Since g is strictly positive by definition of < ., . > ep , i) and ii) are satisfied.

For any A = (a, t a ) ∈ U * , < A, A > ep = f (a, a)g(t a , t a ) > 0. Since g is strictly positive, then we get that f (a, a) > 0. If we set f (0 S , 0 S ) = 0, we establish that f is positive-definite on S.

Since ξ = 0, for any A, B, and C ∈ U * such that A = (a, t), B(b, t) and C = (c, t c ), we have:

< A ⊕ B, C > ep = f (a ⊕ S b, c).g(t, t c ). As < A ⊕ B, C > ep =< A, C > ep + < B, C > ep = f (a, c).g(t, t c ) + f (b, c).g(t, t c ) = (f (a, c) + f (b, c)).g(t, t c ), As g is strictly positive, we get that f (a ⊕ S b, c) = (f (a, c) + f (b, c)). Furthermore, < λ ⊗ A, C > ep = f (λ ⊗ S a, c).g(t, t c ). As < λ ⊗ A, C > ep = λ. < A, C > ep = λ.f (a, c).g(t, t c ) and g is strictly positive, we get that f (λ ⊗ S a, c) = λ.f (a, c).
This shows that f is linear, symmetric and positivedefinite. Hence it is an inner product on (S, ⊕ S , ⊗ S ) and iii) is satisfied.

Let us show that necessarily α = 1 and β = -1. To that end, let us consider any A p 1 , B q 1 and C r 1 in U * , such that p > 1, q > 1, r > 1 and such that t a(p) < t b(q) , i.e. if

X s 1 = A p 1 ⊕ B q 1 , then X s-1 1 = A p 1 ⊕ B q-1
1 . Since by hypothesis < ., . > ep is an inner product (U * , ⊕, ⊗), it is linear and thus we can write:

< A p 1 ⊕ B q 1 , C r 1 > ep =< A p 1 , C r 1 > ep + < B q 1 , C r 1 > ep . Decomposing < A p 1 ⊕ B q 1 , C r 1 > ep , we obtain: < A p 1 ⊕ B q 1 , C r 1 > ep = α. < A p 1 ⊕ B q-1 1 , C r 1 > ep + β. < A p 1 ⊕ B q-1 1 , C r-1 1 > ep +f (b(q), c(r)).g(t b(q) , t c(r) ) + α. < A p 1 ⊕ B q 1 , C r-1 1 > ep As < ., . > ep is linear we get: < A p 1 ⊕B q 1 , C r 1 > ep = α. < A p 1 , C r 1 > ep +α. < B q-1 1 , C r 1 > ep + β. < A p 1 , C r-1 1 > ep +β. < B q-1 1 , C r-1 1 > ep +f (b(q), c(r)).g(t b(q) , t c(r) )+ α. < A p 1 , C r-1 1 > ep +α. < B q 1 , C r-1 1 > ep Hence, < A p 1 ⊕B q 1 , C r 1 > ep = α. < A p 1 , C r 1 > ep +β. < A p 1 , C r-1 1 > ep + α. < A p 1 , C r-1 1 > ep + < B q 1 , C r 1 > ep If we decompose < A p 1 , C r 1 > ep , we get: < A p 1 ⊕B q 1 , C r 1 > ep = (α 2 +β +α) < A p 1 , C r-1 1 > ep +α.β. < A p-1 1 , C r-1 1 > ep +α.f (a(p), c(r)).g(t a(p) , t c(r) ) + α 2 . < A p-1 1 , C r 1 > ep + < B q 1 , C r 1 > ep Thus we have to identify < A p 1 , C r 1 > ep = α. < A p 1 , C r-1 1 > ep +β. < A p-1 1 , C r-1 1 > ep +f (a(p), c(r)).g(t a(p) , t c(r) ) + α. < A p-1 1 , C r 1 > ep with (α 2 +β+α) < A p 1 , C r-1 1 > ep +α.β. < A p-1 1 , C r-1 1 > ep +α.f (a(p), c(r)).g(t a(p) , t c(r) ) + α 2 . < A p-1 1 , C r 1 > ep .
The unique solution is α = 1 and β = -1. That is if < ., . > ep is an existing inner product, then necessarily α = 1 and β = -1, establishing iv).

Proof of the converse implication

Let us suppose that i), ii), iii) and iv) are satisfied and show that < ., . > ep is an inner product on U * . First, by construction, since f and g are symmetric, so is < ., . > ep .

It is easy to show by induction that < ., . > ep is nondecreasing with the length of its arguments, namely, ∀A p

1 and B q 1 in U * , < A p 1 , B q 1 > ep -< A p 1 , B q-1 1 > ep ≥ 0. Let n = p + q.
The proposition is true at rank n = 0. It is also true if A p 1 = Ω, whatever B q 1 is, or B q 1 = Ω, whatever < A p 1 is. Suppose it is true at a rank n ≥ 0, and consider A p 1 = Ω and B q 1 = Ω such that p + q = n. By decomposing < A p 1 , B q 1 > ep we get:

< A p 1 , B q 1 > ep -< A p 1 , B q-1 1 > ep = -< A p-1 1 , B q-1 1 > ep +f (a(p), b(q)).g(t a(p) , t b(q) )+ < A p-1 1 , B q 1 > ep Since f (a(p), b(q)
).g(t a(p) , t b(q) ) > 0 and the proposition is true by inductive hypothesis at rank n, we get that

< A p 1 , B q 1 > ep -< A p 1 , B q-1 1 > ep ) > 0.
By induction the proposition is proved.

Let us show by induction on the length of the time series the positive definiteness of < ., . > ep . At rank 0 we have

< Ω, Ω > ep = ξ = 0. At rank 1, let us consider any time series of length 1, A 1 1 . < A 1 1 , A 1 1 > ep = f (a(1), a (1)
).g(t a(1) , t a(1) ) > 0 by hypothesis on f and g. Let us suppose that the proposition is true at rank n > 1 and let consider any time series of length n + 1,

A n+1 1 . Then, since α = 1 and β = -1, we get < A n+1 1 , A n+1 1 > ep = 2. < A n+1 1 , A n 1 > ep -< A n 1 , A n 1 > ep + f (a(n + 1), a(n + 1)).g(t a(n+1) , t a(n+1) ). Since < A n+1 1 , A n 1 > ep -< A n 1 , A n 1 > ep ≥ 0, and f (a(n + 1), a(n + 1)).g(t a(n+1) , t a(n+1) ) > 0, < A n+1 1 , A n+1 1 > ep > 0,
showing that the proposition is true at rank n + 1. By induction, the proposition is proved, which establishes the positive-definiteness of < ., .

> ep since < A p 1 , A p 1 > ep = 0 only if A p 1 = Ω.
Let us consider any λ ∈ R, and any A p 1 , B q 1 in U * and show by induction on

n = p + q that< λ ⊗ A p 1 , B q 1 > ep = λ. < A p 1 , B q 1 > ep :
The proposition is true at rank n = 0. Let us suppose that the proposition is true at rank n ≥ 0, i.e. for all r ≤ n, and consider any pair A p 1 , B q 1 of time series such that p + q = n + 1. We have:

< λ⊗A p 1 , B q 1 > ep = α. < λ⊗A p 1 , B q-1 1 > ep +β. < λ⊗A p-1 1 , B q-1 1 > ep +f (λ⊗ S a(p), b(q)).g(t a(p) , t b(q) )+α. < λ ⊗ A p-1 1 , B q 1 > ep Since f is linear on (S, ⊕ S , ⊗ S )
, and since the proposition is true by hypothesis at rank n, we get that

< λ ⊗ A p 1 , B q 1 > ep = λ.α < A p 1 , B q-1 1 > ep +λ.β. < A p-1 1 , B q-1 1 > ep +λ.f (a(p), b(q)).g(t a(p) , t b(q) ) + λ.α. < A p-1 1 , B q 1 > ep = λ. < A p 1 , B q 1 > ep .
By induction, the proposition is true for any n, and we have proved this proposition.

Furthermore, for any

A p 1 , B q 1 and C r 1 in U * , let us show by induction on n = p + q + r that < A p 1 ⊕ B q 1 , C r 1 > ep =< A p 1 , C r 1 > ep + < B q 1 , C r 1 > ep . Let X s 1 be equal to A p 1 ⊕ B q 1 .
The proposition is obviously true at rank n = 0. Let us suppose that it is true up to rank n ≥ 0, and consider any A p 1 , B q 1 and C r 1 such that p + q + r = n + 1. Three cases need then to be considered:

1) if X s-1 1 = A p-1 1 ⊕ B q-1 1 , then t a(p) = t b(q) = t and < A p 1 ⊕ B q 1 , C r 1 > ep = α. < A p 1 ⊕ B q 1 , C r-1 1 > ep + β. < A p-1 1 ⊕ B q-1 1 , C r-1 1 > ep + f ((a(p) + b(q)), c(r)).g(t, t c(r) )+ α. < A p-1 1 ⊕ B q-1 1 , C r 1 > ep .
Since f is linear on (S, ⊕ S , ⊗ S ), and the proposition true at rank n, we get the result.

2) if X s-1

1 = A p 1 ⊕ B q-1 1 , then t a(p) < t b(q) = t and < A p 1 ⊕ B q 1 , C r 1 > ep = α. < A p 1 ⊕ B q 1 , C r-1 1 > ep +β. < A p 1 ⊕ B q-1 1 , C r-1 1 > ep +f (b(q), c(r)).g(t, t c(r) ) + α. < A p 1 ⊕ B q-1 1 , C r 1 > ep .
Having α = 1 and β = -1 with the proposition supposed to be true at rank n we get the result.

3) if X s-1

1 = A p-1 1 ⊕ B q-1 1
, we proceed similarly to case 2). Thus the proposition is true at rank n + 1, and by induction the proposition is true for all n. This establishes the linearity of < ., . > ep . This ends the proof of the converse implication and theorem 2.1 is therefore established .

The existence of functions f and g entering into the definition of < ., . > ep and satisfying the conditions allowing for the construction of an inner product on (U * , ⊕, ⊗) is ensured by the following proposition:

Proposition 2.2. The functions f : S 2 → R defined as f (a, b) =< a, b > S where < ., . > S is an inner product on (S, ⊕ S , ⊗ S ) and g : T 2 → R defined as f (t a , t b ) = e -ν•d(ta,t b )
, where d is a distance defined on T 2 and ν ∈ R + , satisfy the conditions required to construct an elastic inner product on (U * , ⊕, ⊗).

The proof of Prop.2.2 is obvious. This proposition establishes the existence of ep inner products, that we will denote eip (Time Elastic Inner Product). An eip as thus the following structure:

< A p 1 , B q 1 > eip =        < A p-1 1 , B q 1 > eip -< A p-1 1 , B q-1 1 > eip + g(t a(p) , t b(q) )• < (a(p), b(q) > eip(S) < A p 1 , B q-1 1 > eip (2)
With the initialization:

∀A ∈ U * , < A, Ω > eip =< Ω, A > eip =< Ω, Ω > eip = ξ,
where ξ is a real constant (typically we set ξ = 0), and Ω is the null sequence, with the convention that A i j = Ω whenever i > j.

Note that < ., . > S can be chosen to be a eip as well, in the case where a second time elastic dimension is required. This leads naturally to recursive definitions for ep and eip. Proposition 2.3. For any n ∈ N, and any discrete subset

T = {t 1 , t 2 , • • • , t n } ⊂ R, let U n,
R,T be the set of all time series defined on R × T whose lengths are n (the time series in U n,R,T are considered to be uniformly sampled). Then, the eip on U n,R constructed from the functions f and g defined in Prop. 2.2 tends towards the Euclidean inner product when ν → ∞ if S is an Euclidean space and < a, b > S is the Euclidean inner product defined on S.

The proof of Prop.2.3 is straightforward and is omitted. This proposition shows that eip generalizes the classical Euclidean inner product.

Algorithmic complexity

The general complexity associated to the calculation of the eip of two time series of lengths p and q as specified by Eq.2 is O(p • q). Basically this is the same complexity as that required for the calculation of the complete dynamic programming solutions such as the Dynamic Time Warping (DTW) [START_REF] Velichko | Automatic recognition of 200 words[END_REF] [13] algorithm evaluated on these two time series. Nevertheless, as discussed in section 3.3, Prop. 3.2 allows for efficient implementations of retrieval process (in linear time complexity) once a straightforward indexing phase has been implemented. This result is demonstrated in practice the experimentation section (sec. 4).

SOME PRELIMINARY APPLICATIONS

We present in the following sections some applications to highlight the properties of Elastic Inner Product Vector Spaces (EIP V S).

Distance in EIP V S

The following proposition provides U * with a norm and a distance, both induced by a eip. Proposition 3.1. For all A p 1 ∈ U * , and any < ., . > eip defined on

(U * , ⊕, ⊗) < A p 1 , A p 1 > eip is a norm on U * .
For all pair (A p 1 , B q 1 ) ∈ (U * ) 2 , and any eip defined on

(U * , ⊕, ⊗), δ eip (A p 1 , B q 1 ) = < A p 1 ⊕ (-1. ⊗ B q 1 ), A p 1 ⊕ (-1. ⊗ B q 1 ) > eip = < A p 1 , A p 1 > eip + < B q 1 , B q 1 > eip -2• < A p 1 , B q 1 > eip defines a distance metric on U * .
The proof of Prop. 3.1 is straightforward and is omitted.

Orthogonalization in EIP V S

To exemplify the effect of elasticity in EIP V S, we give below the result of the Gram-Schmidt orthogonalization algorithm for two families of independent univariate time series. The first family is composed of uniformly sampled time series having increasing lengths. The second family (a sine-cosine basis) is composed of uniformly sampled time series, all of which have the same length.

The tests which are described in the next sections were performed on a set U * of discrete time series whose elements are defined on (R -{0} × [0; 1]) 2 using the following eip:

< A p 1 , B q 1 > eip =        < A p 1 , B q-1 1 > eip -< A p-1 1 , B q-1 1 > eip + a(p)b(q) • e -ν.|t a(p) -t b(q) | 2 < A p-1 1 , B q 1 > eip (3)
Fig. 2. Result of the orthogonalization of the family of length time series defined in Eq.4 using ν = .01: except for the first spike located at time 0, each original spike is replaced by two spikes, one negative the other positive.

Orthogonalization of an independent family of time series with increasing lengths

The family of time series we are considering is composed of 11 time series uniformly sampled, whose lengths are 11 samples:

(1, 0) (ǫ, 0)(1, 1/10) (ǫ, 0)(ǫ, 0)(1, 1/10) • • • (ǫ, 0)(ǫ, 1/10)(ǫ, 2/10) • • • (1, 1) (4)
Since, the zero value cannot be used for the space dimension, we replaced it by ǫ, which is the smallest non zero positive real for our test machine (i.e. 2 -1074 ). The result of the Gram-Schmidt orthogonalization process using ν = .01 on this basis is given in Fig. 2.

Orthogonalization of a sine-cosine basis

An orthonormal family of discrete sine-cosine functions is not anymore orthogonal in a EIP V S. The result of the Gram-Schmidt orthogonalization process using ν = .01 when applied on a discrete sine-cosine basis is given in Fig. 3, in which only the 8 first components are displayed. The lengths of the waves are 128 samples.

Indexing for fast retrieval in time series data bases

Prop.2.3 shows how the elastic inner product generalizes the Euclidean inner product when time series are embedded into a finite dimensional vector space (one dimension per timestamps). We consider in this subsection such embeddings with the convention that if a time series has no value for a given timestamps a zero value is added on the dimension corresponding to the missing timestamps. Each time series is thus represented by a finite dimensional vector, let say in R n . Proposition 3.2. Given a symmetric and strictly positive function g, let consider the so-called n × n symmetric elastic matrix in R n 2 defined as:

E =       g(t 1 , t 1 ) g(t 1 , t 2 ) g(t 1 , t 3 ) • • • g(t 1 , t n ) g(t 2 , t 1 ) g(t 2 , t 2 ) g(t 2 , t 3 ) • • • g(t 2 , t n ) g(t 3 , t 1 ) g(t 3 , t 2 ) g(t 3 , t 3 ) • • • g(t 3 , t n ) • • • • • • • • • • • • • • • g(t n , t 1 ) g(t n , t 2 ) g(t n , t 3 ) • • • g(t n , t n )      
and two time series A n 1 and B n 1 represented by two vectors in R n . Then the elastic inner product defined recursively as:

< A n 1 , B n 1 > eip =        < A n-1 1 , B n 1 > eip -< A n-1 1 , B n-1 1 > eip + a(n)b(n) • g(t a(n) , t b(n) ) < A n 1 , B n-1 1 > eip ( 5
)
identifies to the following matrix products

[A n 1 ] T E [B n 1 ]
This result is quite interesting in the scope of time series information retrieval especially when addressing very large databases. Let D = {B(i) n 1 } i=1•••m be a time series database of size m, and consider the indexing phase that consists in constructing

D E = {E [B(i) n 1 ]} i=1•••m .
Then the retrieval of all the time series in D elastically similar to a given request A n 1 will require the computation of < A n 1 , B(i) n 1 > eip , for i ∈ {1, • • • , m}, which reduces to evaluating:

< A n 1 , B(i) n 1 > eip = [A n 1 ] T [EB(i) n 1 ] (6)
for i ∈ {1, • • • , m} which is done in linear complexity. Basically this construction breaks the quadratic complexity of the eip at retrieval stage and meets the same linear complexity as the classical Euclidean inner product.

Moreover one can notice that the eip defined by Eq.5 has it continuous time equivalent that expresses as: < a, b >= a(t)b(τ )g(t, τ ) dtdτ

Kernel methods in EIP V S

A wide range of literature exists on kernel theory, among which [START_REF] Berg | Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions[END_REF], [START_REF] Scholkopf | Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond[END_REF] and [START_REF] Shawe | Kernel Methods for Pattern Analysis[END_REF] present some large syntheses of major results. We give hereinafter basic definitions and immediate results regarding kernel construction based on eip. Definition 3.1. A kernel on a non empty set U refers to a complex (or real) valued symmetric function ϕ(x, y) :

U × U → C (or R).
Definition 3.2. Let U be a non empty set. A function ϕ : U × U → C is called a positive (resp. negative) definite kernel if and only if it is Hermitian (i.e. ϕ(x, y) = ϕ(y, x) where the overline stands for the conjugate number) for all x and y in U and n i,j=1 c i cj ϕ(x i , x j ) ≥ 0 (resp. n i,j=1 c i cj ϕ(x i , x j ) ≤ 0), for all n in N, (x 1 , x 2 , ..., x n ) ∈ U n and (c 1 , c 2 , ..., c n ) ∈ C n . Definition 3.3. Let U be a non empty set. A function ϕ : U × U → C is called a conditionally positive (resp. conditionally negative) definite kernel if and only if it is Hermitian (i.e. ϕ(x, y) = ϕ(y, x) for all x and y in U ) and

n i,j=1 c i cj ϕ(x i , x j ) ≥ 0 (resp. n i,j=1 c i cj ϕ(x i , x j ) ≤ 0), for all n ≥ 2 in N, (x 1 , x 2 , ..., x n ) ∈ U n and (c 1 , c 2 , ..., c n ) ∈ C n with n i=1 c i = 0.
In the last two above definitions, it is easy to show that it is sufficient to consider mutually different elements in U , i.e. collections of distinct elements x 1 , x 2 , ..., x n . Definition 3.4. A positive (resp. negative) definite kernel defined on a finite set U is also called a positive (resp. negative) semidefinite matrix. Similarly, a positive (resp. negative) conditionally definite kernel defined on a finite set is also called a positive (resp. negative) conditionally semidefinite matrix.

Definiteness of eip based kernel Proposition 3.3. A eip is a positive definite kernel.

The proof of Prop. 3.3 is straightforward and is omitted. The consequence is that numerous definite (positive or negative) kernels can be derived from a eip; among other immediate derivations it can be stated that:

• (< ., . > eip ) p is positive definite for all p ∈ N (polynomial kernel). • δ eip defined by Prop.3.1 is negative definite.

• e -ν•δeip is positive definite for all ν > 0.

• e -ν•(δeip) p is positive definite for all ν > 0 and any 0 < p ≤ 2. • e <A,B>eip is positive definite. Some experimentations on Support vector Machine involving elastic kernels are reported in Sec.4.

Elastic Cosine similarity in EIP V S, with application to symbolic (e.g. textual) information retrieval

Similarly to the definition of the cosine of two vectors in Euclidean space, we define the elastic cosine of two sequences by using any ep that satisfies the conditions of theorem 2.1. Definition 3.5. Given two sequences, A and B, the elastic cosine similarity of these two sequences is given using a time elastic inner product < X, Y > e and the induced norm X e = √ < X, X > e as

similarity = eCOS(θ) = <A•B>e A e B e
In the case of textual or sequential data information retrieval, namely text matching or sequence matching, the timestamps variable coincides with the index of words into the text or sequence, and the spatial dimensions encode the words or symbol into a given dictionary or alphabet. For instance, in text mining, each word can be represented using a vector whose dimension is the size of the set of concepts (or senses) that covers the conceptual domain associated to the dictionary, and each coordinate value, that is selected into [0; 1], encodes the degree of presence of the concept or senses into the considered word. In any case, the elastic cosine similarity measure takes value into [0; 1], 0 indicating the lowest possible similarity value between two sequential data and 1 the greatest possible similarity value between two sequential data. The elastic cosine similarity takes into account the order of occurrence of the words or symbols into the sequential data which could be an advantage compared to the Euclidean cosine measure that does not cope at all with the words or symbols ordering.

Let us consider the following elastic inner product dedicated to text matching. In the following definition, A p 1 and B q 1 are sequences of words that represent textual content. Definition 3.6.

< A p 1 , B q 1 > eiptm =        < A p-1 1 , B q 1 > eiptm -< A p-1 1 , B q-1 1 > eiptm + e -ν.|t a(p) -t b(q) | 2 δ(a(p), b(q)) < A p 1 , B q-1 1 > eiptm (7)
where a(p) and b(q) are vectors whose coordinates identify words with weightings, δ(a, b) =< a, b > is the Euclidan inner product, and ν a time stiffness parameter.

Proposition 3.4. For ν = 0 and δ redefined as δ(a, b) = 1 if a = b, 0 otherwise, the elastic inner product defined in Eq.7 coincides with the euclidean inner product between two vectors whose coordinates correspond to term frequencies observed into the A p 1 and B q 1 text sequences. If, we change the definition of δ by the δ(a, b) = (IDF (a)) 2 if a = b, 0 otherwise, where IDF (a) is the inverse document frequency of term a into the considered collection, then for ν = 0,

< A p 1 , B q 1 > eiptm coincides

with the euclidean inner product between two vectors whose coordinates correspond to the TF-IDF (term frequency times the inverse document frequency) of terms occurring into the A p

1 and B q 1 text sequences. The proof of proposition 3.4 is straightforward an is omitted.

Thus, the elastic cosine measure derived from the elastic inner product defined by Eq.7 generalizes somehow the cosine measure implemented in the vector space model [START_REF] Salton | Introduction to Modern Information Retrieval[END_REF] and commonly used in the text information retrieval community.

To exemplify the behavior of the elastic cosine similarity on sequential data, we consider the four sequences depicted in Eq.8. The variations of the elastic cosine as a function of ν evaluated on pairwise sequences are reported in Fig. 4 A

= [abababab] B = [aaaabbbb] C = [bbbbaaaa] D = [bbaa] (8)
In Fig. 4 the extreme left part of the curves, characterized with high ν values, corresponds, when applied on sequences having the same length and represented by vectors, to the cosine similarity constructed with the Euclidean inner product. The right part of the curves, characterized with very low ν values, corresponds to the cosine similarity evaluated using the tf(-idf) vector space model. The center part of the figure, characterized with medium ν values shows that elasticity allows to better discriminating between the sequences.

EXPERIMENTATIONS

Time series classification

We empirically evaluate the effectiveness of the distance induced by an elastic inner product comparatively to the Euclidean and the Dynamic Time Warping distances using some classification tasks on a set of time series coming from quite different application fields. The classification task we have considered consists of assigning one of the possible categories to an unknown time series for the 20 data sets available at the UCR repository [START_REF] Keogh | The ucr time series classification-clustering datasets[END_REF]. As time is not explicitly given for these datasets, we used the index value of the samples as the timestamps for the whole experiment.

For each dataset, a training subset (TRAIN) is defined as well as an independent testing subset (TEST). We use the training sets to train two kinds of classifiers:

• the first one is a first near neighbor (1-NN) classifier:

first we select a training data set containing time series for which the correct category is known. To assign a category to an unknown time series selected from a testing data set (different from the train set), we select its nearest neighbor (in the sense of a distance or similarity measure) within the training data set, then, assign the associated category to its nearest neighbor. For that experiment, a leave one out procedure is performed on the training dataset to optimize the meta parameter ν of the considered elastic distance.

• the second one is a SVM classifier [START_REF] Boser | A training algorithm for optimal margin classifiers[END_REF], [START_REF] Vapnik | The Nature of Statistical Learning Theory[END_REF] configured with a Gaussian RBF kernel whose parameters are C > 0, a trade-off between regularization and constraint violation and σ that determines the width of the Gaussian function. Based on the average error rate obtained on the five classification tasks, the optimal values of meta parameters are selected as the ones leading to the minimal average error rate. For the elastic kernel, the meta parameter ν is also optimized using this 5-folded cross-validation method performed on the training datasets.

The classification error rates are then estimated on the TEST datasets on the basis of the parameter values optimized on the TRAIN datasets. We have used the LIBSVM library [START_REF] Chang | LIBSVM: a library for support vector machines[END_REF] to implement the SVM classifiers.

We tested the time elastic inner product < A, B > eip (Eq.3). Precisely, we used the timewarp distance induced by < A, B > eip , basically

δ eip (A, B) = (< A -B, A -B > eip ) 1/2 = (< A, A > eip + < B, B > eip -2. < A, B > eip ) 1/2 .
To speed up the computation at exploitation stage, we have used the construction proposed in Sec.3.3 Prop.3.2 with the following elastic Matrix E, where ν > 0 :

E =        1.0 e -ν|t1-t2| 2 e -ν|t1-t3| 2 • • • e -ν|t1-tn| 2 e -ν|t2-t1| 2 1.0 e -ν|t2-t3| 2 • • • e -ν|t2-tn| 2 e -ν|t3-t1| 2 e -ν|t3-t2| 2 1.0 • • • e -ν|t3-tn| 2 • • • • • • • • • • • • • • • e -ν|tn-t1| 2 e -ν|tn-t2| 2 e -ν|tn-t3| 2 • • • 1.0       
The databases

D E = {EB(i) n 1 } i=1•••m
are thus constructed off-line from the TRAIN datasets, once the optimization procedure of the ν parameter has been completed. D E is then exploited on-line by the 1-NN and SVM classifiers.

Meta parameters

δ eip is characterized by the meta parameter ν (the stiffness parameter) that is optimized for each dataset on the train data by minimizing the classification error rate of a first near neighbor classifier. For this kernel, ν is selected in {100, 10, 1, .1, .01, ..., 1e -5, 0}.

To explore the potential benefits of an elastic inner product against the Euclidean inner product, we also tested the Euclidean Distance δ ed which, as already stated, is the limit when ν → ∞ of δ eip .

The kernels exploited by the SVM classifiers are the Gaussian kernels K eip (A, B) = e -δeip(A,B) 2 /(2•σ 2 ) and K ed (A, B) = e -δ ed (A,B) 2 /(2•σ 2 ) . The meta parameter C is selected from the discrete set {2 -8 , 2 -7 , ..., 1, 2, ..., 2 10 }, and σ 2 from {2 -5 , 2 -4 , ..., 1, 2, ..., 2 10 }.

Table 1 gives for each data set and each tested kernels (K ed and K eip ) the corresponding optimized values of the meta parameters.

According to the classification results, this experiment shows that the distance induced by the elastic inner product δ eip is significantly more effective for the considered tasks comparatively to the Euclidean distance. It exhibits, on average, the lowest error rates for most of the tested datasets and for both the 1-NN and SVM classifiers, as shown in Table 2 and Figures 5 and6. The stiffness parameter ν in δ eip seems to play a significant role in these classification tasks, and this for a quite large majority of data sets.

Only one dataset, yoga, is better classified by the 1-NN δ ed classifier on the test data, although the error rate on the train data is lower for the 1-NN δ eip classifier. For the SVM classifiers, only two datasets, Face (all) and Coffee, are significantly better classified on the test data by SVM K ed classifiers. Nevertheless, for these two datasets, K eip reaches a better (or best) score on the train data. We are facing here the trade-off between learning and generalization capabilities. The meta parameter ν is selected such as to minimized the classification error on the train data. If this strategy is on average a winning strategy, some datasets show that it does not always lead to a good trade-off, this is the case for Face (all) and yoga datasets.

However, δ dtw based classifiers outperform δ eip based classifiers on a majority of datasets. The average ranking of the classifiers shows clearly that δ eip ranks in between δ ed and δ dtw . δ eip can be considered as a compromise between the linear Euclidean distance and the nonlinear δ dtw . It maintains a low computational cost and nevertheless compensates some of the limitations of the Euclidean distance that it is very sensitive to distortions in the time axis. It should be noted that δ eip can cope with sample substitution, deletion and insertion as well as δ dtw . In addition, δ eip can deal with sample permutations while δ dtw cannot.

Sequence classification

We report here a protein classification experiment carried out using the Protein Classification Benchmark Collection (PCBC) [18] [1]. This benchmark contains structural and functional annotations of proteins. The two datasets that we have exploited, SCOP95 and CATH95, are available at http://hydra.icgeb.trieste.it/benchmark.

The entries of the SCOP95 dataset are characterized by sequences with variable lengths and relatively little sequence similarity (less than 95% sequence identity) between the protein families.

The CATH95 dataset contains near-identical protein families of variable lengths in which the proteins have a high sequence similarity (more than 95% sequence identity).

Basically, the considered classification tasks involve protein domain sequence and structure comparisons at various levels of the structural hierarchies. We have considered the following 14 PCB subsets: We evaluate the elastic cosine similarity based on the eip defined for symbolic sequences (Def.3.6, Eq.7) comparatively to five other similarity measures commonly used in Bioinformatics:

• BLAST [START_REF] Altschul | Basic local alignment search tool[END_REF]: the Basic Local Alignment Search Tool is a very popular family of fast heuristic search methods used for finding similar regions between two or more nucleotides or amino acids.

• SW [START_REF] Smith | Identification of common molecular subsequences[END_REF]: The SmithWaterman algorithm is used for performing local sequence alignment, for determining similar regions between two nucleotide or protein sequences. Instead of looking at the sequence globally as NW does, the SmithWaterman algorithm compares subsequences of all possible lengths. • NW [START_REF] Saul | A general method applicable to the search for similarities in the amino acid sequence of two proteins[END_REF]: The Needleman Wunsch algorithm performs a maximal global alignment of two strings. It is commonly used in bioinformatics to align protein sequences or nucleotides. • LA kernel [START_REF] Saigo | Protein homology detection using string alignment kernels[END_REF]: The Local Alignment kernel is used to detect local alignment between strings by convolving simple basic kernels. Its construction mimic the local alignment scoring schemes proposed in the SW algorithm.

• PRIDE [START_REF] Carugo | Protein fold similarity estimated by a probabilistic approach based on c(alpha)-c(alpha) distance comparison[END_REF]: The PRIDE score is estimated as the PRobability of IDEntity between two protein 3D structures. The calculation of similarity between two proteins, is based on the comparison of histograms of the pairwise distances between C -α residues whose distribution is highly characteristic of protein folds. The average AUC (area under the ROC Curve) measure is evaluated for 1-NN classifiers exploiting respectively BLAST, SW, NW, LA, PRIDE and eCOS(ν) as alignment methods. One can notice that these datasets are quite well suited for global alignment since, as shown in table 3, the NW algorithm performs better than the SW algorithm. The eip structure that considers global alignment is thus well adapted to the task. We show on these experiments that for ν = .05 the eCOS classifier in average performs significantly better than BLAST heuristics [START_REF] Altschul | Basic local alignment search tool[END_REF] and LA [START_REF] Saigo | Protein homology detection using string alignment kernels[END_REF], the local alignment kernel for string. Furthermore, it performs almost as well as the SW and NW algorithms. The PRIDE method [START_REF] Carugo | Protein fold similarity estimated by a probabilistic approach based on c(alpha)-c(alpha) distance comparison[END_REF] gets the best results, but it uses the tertiary structure of the proteins while all the other methods exploit the primary structure. Here again, a ranking based on eCOS similarity has a complexity that could be maintained linear at exploitation stage (i.e. when testing numerous sequences against massive datasets). These very positive results offer perspective in fast filtering of biological symbolic sequences.

Experimental complexity

To evaluate in practice the computational cost of δ eip , we compare it with two other distances, namely δ ed (the Euclidean distance) which has a linear complexity, and δ dtw , the Dynamic Time Warping distance which has a quadratic complexity. In addition we evaluate the computational cost of the indexed version of δ eip that we refer to as δ i-eip . The experiment consists in producing random datasets of 100 time series of increasing lengths (10, 100, 1000 and 10000 samples) and computing the 100x100 distance matrices. Figure 7 gives the elapsed time in second, according to a logarithmic scale, for the four distances as a function of the length of the time series. When compared to δ dtw , δ eip is evaluated very efficiently using the matrix computation given in Eq.6, although, without any off line indexing of the time series, δ eip cannot compete with δ ed when the length of the time series increases. The δ i-eip curve has clearly the same slope than the δ ed curve, showing that the offline indexed version of δ eip is characterized with a linear complexity, that includes a nevertheless linear overhead when compared to δ ed , mainly due to the loading of the index.

CONCLUSION

This paper has proposed what we call a family of elastic inner products able to cope with non-uniformly sampled time series of various lengths, as far as they do not contain the zero or null symbol value. These constructions allow one to embed any such time series in a single inner space, that some how generalizes the notion of Euclidean inner space. The recursive structure of the proposed construction offers the possibility to manage several elastic dimensions. Some applicative benefits can be expected in time series or sequence analysis when time elasticity is an issue, for instance in the field of numeric or symbolic sequence data mining.

If the algorithmic complexity required to evaluate an elastic inner product is in general quadratic, its computation can be much more efficiently performed than dynamic programming algorithms. In addition we have shown that for some information retrieval applications for which embeddings of time series or symbolic sequences into a finite dimensional Euclidean space is possible, one can break this quadratic complexity down to a linear complexity at exploitation time, although a quadratic computational cost should still be paid once during a preprocessing step at indexing phase. The preliminary experiments we have carried out on some time series and symbolic sequence classification tasks show that embedding time series into elastic inner product space may brought significant accuracy improvement when compared to Euclidean inner product space embeddings as they compensate, at least partially, the limitations of Euclidean distance which is very sensitive to distortions in the time axis. Although our experiments show that Dynamic Programming matching algorithms outperforms on a majority of dataset distances that are derived from an elastic inner product, on some datasets such distances lead to similar accuracies .

The experiment carried out on symbolic sequences alignment involves sequences of various lengths. It shows also some very interesting perspectives in the scope of fast filtering of massive data, since the accuracy obtained by a 1-NN symbolic elastic cosine classifier with a potentially linear complexity at exploitation time is somehow comparable to the one obtained using dynamic programming algorithms (NW and SW) whose complexity are quadratic when the alignment search space is not restricted.

Finally, the general recursive structure of the elastic inner product opens perspectives in the processing of more complex data such as tree data mining for which considering several elastic dimensions may be relevant and efficient. The possibility to decompose complex structures onto sets of elastic basis vectors opens perspectives in various areas of application such as data compression, multi-dimensional scaling or matching pursuits.

Fig. 3 .

 3 Fig. 3. Orthogonalization of the sine-cosine basis using ν = .01: the waves are slightly deformed jointly in amplitude and in frequency. For readability of the figure, we have presented the 8 first components

Fig. 4 .

 4 Fig. 4. Elastic cosine as a function of ν evaluated on pairwise sequences selected in {A = [abababab] , B = [aaaabbbb] , C [bbbbaaaa] , D = [bbaa]}. The timestamps correspond to the index of occurrence of the symbol into the sequence (i = 1, 2, • • • ,).

  To determine the C and σ hyper parameter values, we adopt a 5-folded cross-validation method on each training subset. According to this procedure, given a predefined training set TRAIN and a test set TEST, we adapt the meta parameters based on the training set TRAIN: we first divide TRAIN into 5 stratified subsets T RAIN 1 , T RAIN 2 , • • • , T RAIN 5 ; then for each subset T RAIN i we use it as a new test set, and regard (T RAIN -T RAIN i ) as a new training set;

Fig. 5 .

 5 Fig. 5. Comparison of error rates (in %) between two 1-NN classifiers based on the Euclidean Distance (1-NN δ ed ), and the distance induced by a time-warp inner product (1-NN δ eip ). The straight line has a slope of 1.0 and dots correspond, for the pair of classifiers, to the error rates on the train (star) or test (circle) data sets. A dot below (resp. above) the straight line indicates that distance δ eip has a lower (resp. higher) error rate than distance δ ed . Black 'x' indicate error rates evaluated on the training data, while the red squares indicate error rates evaluated on the test data.

Fig. 6 .

 6 Fig. 6. Comparison of error rates (in %) between two SVM classifiers, the first one based on the Euclidean Distance Gaussian kernel (SVM K ed ), and the second one based on a Gaussian kernel induced by a time-warp inner product (SVM K eip ). The straight line has a slope of 1.0 and dots correspond, for the pair of classifiers, to the error rates on the train (star) or test (circle) data sets. A dot below (resp. above) the straight line indicates that SVM K eip has a lower (resp. higher) error rate than distance SVM K ed . Black 'x' indicate error rates evaluated on the training data, while the red squares indicate error rates evaluated on the test data.

Fig. 7 .

 7 Fig. 7. Elapsed time in second as a function of the time series length for 10000 distance computations and for the four experimented distances: δ ed (cross symbol, plain grey line), δ eip (triangle symbol plain line), δ i-eip (round symbol, dashed lines) and δ dtw (square symbol, plain line).

•

  PCB00001 SCOP 95 Superf amily F amily • PCB00002 SCOP 95 Superf amily 5f old • PCB00003 SCOP 95 F old Superf amily • PCB00004 SCOP 95 F old 5f old • PCB00005 SCOP 95 Class F old • PCB00006 SCOP 95 Class 5f old • PCB00007 CAT H95 Homology Similarity • PCB00008 CAT H95 Homology 5f old • PCB00009 CAT H95 T opology Homology • PCB00010 CAT H95 T opology 5f old • PCB00011 CAT H95 A rchitecture T opology (1.

	45)|(1.75)	(1.85)|(1.5)	(2.65)|(2.4)	(1.8)|(1.7)	(1.25)|(1.6)
	• PCB00012 CAT H95 Architecture 5f old
	• PCB00013 CAT H95 Class Architecture
	• PCB00014 CAT H95 Class 5f old

TABLE 3

 3 Comparative study using the PCBC protein datasets available at http://hydra.icgeb.trieste.it/benchmark. The assessment measure is the average AUC values based on the ROC curves obtained by the first near neighbor classification rules when BLAST, SW, NW, LA, PRIDE and eCOS(ν=1,.1,.05, .01, .001) similarity measures are used.Best average AUC values are in boldface characters.

	1NN	BLAST	SW	NW	LA	PRIDE	(ν = 1) (ν = .1) (ν = .05) (ν = .01)	(ν = .001)	(Best)
	SCOP95 supfam fam 1	70.01	83.52	83.95	78.78	89.48	77.70	81.99	82.94	83.63	80.74	83.63
	SCOP95 supfam fam kfold 2	94.87	97.74	97.73	96.71	97.41	91.02	94.84	95.02	94.15	91.44	95.02
	SCOP95 fold supfam 3	56.87	64.82	67.47	58.38	84.72	75.20	79.27	79.09	75.71	69.89	79.27
	SCOP95 fold supfam kfold 4	90.30	93.77	94.54	91.38	95.82	88.93	93.40	93.32	90.67	85.79	93.4
	SCOP95 class fold 5	60.18	61.04	62.90	56.90	78.27	59.25	65.65	67.13	67.23	64.45	67.23
	SCOP95 class fold kfold 6	92.23	92.14	92.85	88.28	93.24	80.43	88.38	88.76	85.32	79.81	88.76
	CATH95 H S 7	97.90	99.20	99.29	98.81	95.47	95.42	97.03	96.84	95.78	91.81	97.03
	CATH95 H S kfold 8	96.63	98.30	98.32	97.80	95.02	95.10	97.28	97.22	96.36	93.67	97.28
	CATH95 T H 9	57.33	64.75	66.97	61.44	76.71	73.25	78.57	79.12	77.38	70.20	79.12
	CATH95 T H kfold 10	89.76	92.60	93.14	90.66	90.96	88.98	93.02	92.78	90.28	84.25	93.02
	CATH95 A T 11	54.52	56.82	57.97	54.12	67.37	57.78	61.63	62.09	61.33	59.70	62.09
	CATH95 A T kfold 12	90.21	91.28	91.77	88.91	84.89	82.44	88.28	88.14	84.96	80.09	88.28
	CATH95 C A 13	64.81	71.28	69.87	69.17	55.72	37.74	46.33	49.79	62.61	63.63	63.63
	CATH95 C A kfold 14	90.80	89.74	90.51	86.21	80.63	76.75	83.29	83.94	80.57	75.71	83.94
	Average	79.03	82.64	83.38	79.83	84.69	77.14	82.07	82.58	81.86	77.94	84.00