<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Convolutional Siamese Network for Developing Similarity Knowledge in the SelfBACK Dataset</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kyle Martin</string-name>
          <email>k.martin@rgu.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nirmalie Wiratunga</string-name>
          <email>n.wiratunga@rgu.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sadiq Sani</string-name>
          <email>s.sani@rgu.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stewart Massie</string-name>
          <email>s.massie@rgu.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jeremie Clos</string-name>
          <email>j.clos@rgu.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computing Science and Digital Media, Robert Gordon University</institution>
          ,
          <addr-line>Aberdeen AB25 1HG, Scotland</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <fpage>85</fpage>
      <lpage>94</lpage>
      <abstract>
        <p>The Siamese Neural Network (SNN) is a neural network architecture capable of learning similarity knowledge between cases in a case base by receiving pairs of cases and analysing the dierences between their features to map them to a multi-dimensional feature space. This paper demonstrates the development of a Convolutional Siamese Network (CSN) for the purpose of case similarity knowledge generation on the SelfBACK dataset. We also demonstrate a CSN is capable of performing classication on the SelfBACK dataset to an accuracy which is comparable with a standard Convolutional Neural Network.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Keywords: Case-Based Reasoning sation SelfBACK</title>
      <sec id="sec-1-1">
        <title>Introduction</title>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Siamese Neural Networks</title>
    </sec>
    <sec id="sec-3">
      <title>Categori</title>
      <p>Similarity knowledge is an essential component of an eective Case-Based
Reasoning (CBR) system, but its generation can be a daunting task. Large complex
datasets, where inter-feature relationships may exist, present a challenge to
traditional similarity generation measures. Although similarity-based retrieval can
oer numerous advantages during the retrieval phase, this can have a large initial
cost. It is little wonder that recent research is targeting methods of harnessing
deep learning methods to improve similarity knowledge generation.</p>
      <p>A Siamese Neural Network (SNN) is a deep learning architecture which can
learn similarity knowledge at a case-to-case level. SNNs have proven eective at
learning similarity knowledge for a range of dierent domains including
smartphone gesture classication and face verication [2; 4]. This paper presents the
application of an SNN architecture to the SelfBACK 1 dataset2, which contains
1The SelfBACK project is funded by European Union’s H2020 research and innovation
programme under grant agreement No. 689043. More details available: http://www.selfback.eu
2The SelfBACK dataset associated with this paper is publicly accessible from
https://github.com/selfback/activity-recognition
Copyright © 2017 for this paper by its authors. Copying permitted for private and
academic purpose. In Proceedings of the ICCBR 2017 Workshops. Trondheim, Norway
the accelerometer data for 34 users labelled with one of 6 activities. The main
contribution of this paper is to demonstrate the successful application of an SNN
as a means to develop similarity knowledge within a case base. In addition, this
paper demonstrates that an SNN can perform a classication task on a level
which is competitive with a typical Convolutional Neural Network (CNN).</p>
      <p>This paper is organised into the following sections. Section 2 gives an
overview of the research regarding learning similarity measure for use in CBR,
as well as the SNN architecture and how it may be used as a means to develop
similarity knowledge between cases which can be used for classication. Section
3 contains a description of the SelfBACK dataset and how it was used within
the context of the presented research. Section 3 also describes our evaluation
and details the setup of our experiments, including our classication method
and network architecture, as well as pair creation method. Section 4 contains
the results of our experiments and Section 5 highlights further work we aim to
complete within this research area.
2
2.1</p>
      <sec id="sec-3-1">
        <title>Related Works</title>
      </sec>
      <sec id="sec-3-2">
        <title>Learning Similarity Measures</title>
        <p>
          Learning eective similarity measures between cases can counter many of the
issues that plague the retrieval phase of CBR systems, such as retrieving suitable
results from extremely large and complex case bases, or retrieving results for
cases where some features cannot be explicitly described [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. However, the
process of learning similarity knowledge can itself present an issue, and as such
it has been the focus of much research.
        </p>
        <p>
          Knowledge-Intensive Similarity Measures (KISMs) have been shown to
improve retrieval in case bases where domain-specic knowledge is a key component
[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. While the main intention of standard similarity measures is to numerically
quantify the simillitude between two cases based upon explicit feature values,
K-ISMs use domain-specic knowledge to weight more important features for
return [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This has been shown to improve retrieval accuracy in complex
domains, and domains that rely on expert knowledge to query. However, the
acqusition and encoding of domain-knowledge into similarity measures is an
extremely expensive process which can often require the input of a domain expert.
One of the advantages of the presented SNN architecture is that it can weight
features automatically without the input of a domain expert and is signicantly
less time-consuming.
2.2
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>The Siamese Neural Network Architecture</title>
        <p>An SNN architecture consists of two neural networks that share identical weights
and are joined at one or more layers. SNNs receive case pairs as input to both
the training and testing phases to develop simlarity knowledge at an
object-toobject level. An example architecture is shown in Figure 1. During the training
phase, these pairs are labelled as either ‘genuine’ (if the examples share the
same class) or ‘impostor’ (if the examples are of dierent classes). This allows
the network to develop a multi-dimensional space based upon cases features,
where ‘genuine’ pairs are pushed closer together and ‘impostor’ pairs are pulled
further away from each other. The output of the identical neural networks (or
‘sub-networks’) are feature vectors for each member of the input pair. The
distance between these vectors is measured at the similarity layer to ascertain
whether they belong to the same class based upon a threshold.</p>
        <p>
          SNNs use ‘contrastive loss’, which was introduced in [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Contrastive loss is
calculated by summing the results of the individual loss formulas for genuine
and impostor pairs. Genuine pairs are penalized by loss LG for being too far
apart, while negative pairs are penalized by LI if their distance falls within the
given margin value. Sub-network weights are then updated by backpropagating
the loss with respect to the weights. This means that genuine pairs are pushed
closer together over the course of training, whilst ensuring that impostor pairs
maintain at least a set distance apart. The similarity metric is therefore directly
learned by the network, as it is implicitly dened by the loss function.
        </p>
        <p>The equations for contrastive loss are detailed in Equations (1), (2) and (3).
YA and YP are binary values which are equal to 0 for genuine pairs and 1 for
impostor pairs, where YA is the actual label, YP is the predicted label and M
is the margin.</p>
        <p>LG = (1</p>
        <p>YA)YP 2
LI = YA(max(M</p>
        <p>YP ; 0))2
L = LG + LI
(1)
(2)
(3)
2.3</p>
      </sec>
      <sec id="sec-3-4">
        <title>Similarity and Classication in SNNs</title>
        <p>
          Initially made popular by [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] to identify similarities for face verication, many
research eorts have taken advantage of an SNN’s capability to develop
similarity knowledge, in areas ranging from smartphone gesture classication [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], to
similar text retrieval [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. In [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], the authors demonstrate that their SNN can
outperform state-of-the-art text similarity measures by mapping term vectors to
a low dimensional space. Their results indicate that the SNN can signicantly
outperform other methods on both low and high dimensional data. The
drawback was that the algorithm did not scale well to large amounts of examples.
        </p>
        <p>
          Although introduced as a method of signature verication and binary
classication [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], recent research has shown that SNNs are able to generalise to
multiclass classication. In [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], the authors demonstrate that a Convolutional
Siamese Network (CSN) can achieve very close to the state of the art and
human levels of recognition in a one-shot learning setting on the omniglot dataset,
which contains 40 distinct classes. A CSN is a type of SNN where the parallel
neural networks are replaced with two identical Convolutional Neural Networks
(CNNs). A CNN itself is a feed forward neural network which arranges its
neurons in multiple dimensions in order to operate eectively on high dimensional
data. One of the main advantages of using CNNs is that they can learn local
feature detectors and are fairly robust to distortions of network input [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          In [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], the authors demonstrated visual search on multiple domains by
performing nearest neighbour on the output feature vectors from an CSN. Their
ndings showed that CSNs could be used to learn the similarity between
images and that a nearest neighbour algorithm could be performed to retrieve the
most similar images for a given example. Their ndings demonstrated that the
feature vectors produced by a CSN have potential use as a means to increase
utility of more conventional classication techniques.
        </p>
        <p>We can observe from the range of examples above that SNNs are capable of
learning similarity knowledge and performing classication upon a wide range
of domains. However, there remain areas which require further exploration. In
particular, literature regarding the structuring of pair creation is lacking, as is
research which utilises SNNs within ensemble classiers.
3</p>
      </sec>
      <sec id="sec-3-5">
        <title>Evaluation</title>
        <p>The aims of this paper are two-fold; to show that an SNN could generate
similarity knowledge within a case base, and to demonstrate the performance of an
SNN as a method of human activity classication. To this end, we performed
two experiments upon the SelfBACK dataset.
3.1</p>
      </sec>
      <sec id="sec-3-6">
        <title>The Dataset</title>
        <p>
          The SelfBack dataset consists of time series data collected from 34 users
performing dierent activities over a short period of time. Data was collected by
mounting a tri-axial accelerometer on the thigh and right-hand wrist of
participants at a sampling rate of 100Hz as they completed a script of set activities,
performing each for an average of three minutes [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Frequency coecients were
obtained by applying Discrete Cosine Transforms (DCT) and Discrete Fourier
Transforms (FFT) to the raw accelerometer data.
        </p>
        <p>Our experiments used the thigh dataset due to time limitations. Data was
split into 5 second windows, meaning that there were between 160 and 180 cases
per user and 1,500 features per case. This resulted in 6,084 cases of thigh data.
These were then labelled as one of 6 activities (standing, upstairs, downstairs,
walking, jogging, sitting) to create the full dataset.
3.2</p>
      </sec>
      <sec id="sec-3-7">
        <title>Experimental Setup</title>
        <p>Firstly, we implemented a Convolutional Siamese Network (CSN) upon the raw
accelerometer thigh data, DCT thigh data and FFT thigh data. Pairs of cases
were fed into the CSN and the convolutional sub-networks of the CSN learned to
produce representative feature vectors of each case. We tested that the network
had learned feature vectors which were representative of the original cases by
measuring the euclidean distance between pair vectors at the similarity layer and
comparing this to a threshold to identify whether a pair of examples belonged
to the same class (a genuine pair) or to dierent classes (an impostor pair). If
we identied that the distance between the genuine pair was less than a certain
threshold (i.e. the space that should exist between cases of opposing classes)
and the distance between the impostor pair was greater than this threshold,
then we could reasonably assume that the case had been mapped to the correct
space (or a very close approximation of it). We therefore used the percentage
of correctly identied pairs as our accuracy metric.</p>
        <p>Secondly, we implemented a CSN and CNN to perform classication on the
raw thigh accelerometer data. The raw data was used in order to demonstrate
a comparison between the two architectures which was unaected by
preprocessing of the data. For this experiment, we completed a similar process to the
previous experiment until the CSN had learned representative feature vectors
for each case in the test set. Each feature vector from the test set was then
compared with 6 randomly selected class representative vectors generated from
cases in the training set. The distance between the unlabelled test vector and
each class representative vector was measured, and the test case was identied
as belonging to the same class as the nearest class representative vector. The
accuracy of the experiment was the percentage of correctly classied cases.
3.3</p>
      </sec>
      <sec id="sec-3-8">
        <title>Network Architecture</title>
        <p>A CSN was constructed from 2 sub-networks, which had 2 convolutional layers,
a attening layer and 2 fully connected layers. The rst layers used tanh
activation functions, while the nal layer used a softmax function. The network was
optimised using Stochastic Gradient Descent and the hyperparameters in Table
1. The output of the sub-networks was a representative feature vector for each
case member of the pair. Euclidean distance between these vectors could then
be measured and compared with the threshold.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Parameter</title>
    </sec>
    <sec id="sec-5">
      <title>Learning Rate Learning Decay Nesterov Momentum</title>
    </sec>
    <sec id="sec-6">
      <title>Value 0.01 0.000001 0.9</title>
      <p>In order to be comparable with the CSN, the CNN created for comparison
purposes was a close replica of one of the sub-networks outlined above. The only
major dierence was the use of categorical cross-entropy for the loss function
and backpropagating this loss with respect to the weights.</p>
      <p>Implementations were run for10 epochs as the loss had reached a suciently
low value by this point. Experiments were repeated 5 times and a mean
percentage of accuracy calculated. There were many random elements at numerous
stages of all implementations and so running for multiple iterations and taking
the mean of the result accuracy was the only method to ensure that results were
legitimately indicative of network performance.
Data was split between train and test sets using leave-p-out cross-validation
(LPOCV), meaning that the test set comprised of cases from p users, while
all remaining users made up the training set. LPOCV was used due to the
real-world constraints of the SelfBACK project, which involves being able to
identify users’ activities based upon their similarity to other users. This oered
an improvement in accuracy over randomly splitting the dataset, though the
larger training set caused minor overtting. Experiments were completed with
p set to 5 and 10, to test the eect that increasing test set size had on results.</p>
      <p>At run time, the dataset is normalised using standard normal distribution,
Equation (4), where is the mean of the training set and is the standard
deviation of the training set. These values were taken from the training set
because the test data represented a population of unknown size and distribution.
x 2 X j
x
(4)
3.5</p>
      <sec id="sec-6-1">
        <title>Pair Creation</title>
        <p>Pair creation in all experiments was completed after the data had been split into
training and test sets to ensure that there was no cross contamination which
could eect the results. For pair creation, we dened d as the number of cases
in the full dataset and p as the number of cases to be left out for testing. The
training set therefore contained n = d p cases.</p>
        <p>Initially, we attempted to exhaustively create all pairs by matching every case
with every other case. However, this resulted in the creation of P1d cases, which
made pair formation extremely slow. Instead, two pairs were created for every
case in the dataset; a genuine pair (with a random case of the same class) and an
impostor pair (with a random case of a dierent class). This meant that every
case was represented at least twice. We enforced equal genuine and impostor
pair creation because generating truly random pairs led to an imbalance of more
impostor pairs than genuine, at a ratio of approximately 5:1, and had a negative
eect on classication. The number of training and test pairs were therefore 2n
and 2p respectively.
4
4.1</p>
      </sec>
      <sec id="sec-6-2">
        <title>Results</title>
      </sec>
      <sec id="sec-6-3">
        <title>Learning Similarity Knowledge with a CSN</title>
        <p>The CSN was able to develop good similarity knowledge for all three time and
frequency representations of the thigh dataset, though best results were obtained
from the thigh DCT data. This is indicated by the percentage of correctly
identied pair relationships, which is shown in Table 2.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>SelfBACK Thigh Data</title>
    </sec>
    <sec id="sec-8">
      <title>Test User Set</title>
    </sec>
    <sec id="sec-9">
      <title>Pair Identication Accuracy Raw DCT FFT</title>
      <p>Raw
DCT
FFT</p>
      <p>Even the minimum result of 92.17% obtained on the raw thigh dataset using
L10OCV demonstrates that more than 92% of test cases have been mapped to
appropriate feature vectors. With this in mind, distance between these vectors
can act as a proxy for similarity measurements at a case-to-case level. These
results support the argument that cases of the same class are grouped closer
together within the feature space and lend evidence to the idea that the CSN
can be used to form the basis for similarity-based retrieval in a CBR system.
4.2</p>
      <p>Comparing a CSN and CNN on the SelfBACK Dataset
As a classier, the CSN did not perform as well as the CNN, although it acheived
over 90% classication accuracy on both experiments. Although the CSN
performed competitively on the L5OCV, the CNN displayed much higher accuracy
on the L10OCV experiments, as shown in Table 3.</p>
    </sec>
    <sec id="sec-10">
      <title>Architecture Test User Set Classication Accuracy CSN</title>
      <p>These results indicate that the CSN requires more training data to be able
to classify cases than a typical CNN does. The low variance in results across
iterations, and resistance to increasing test set size, by both architectures,
supports the idea that they generalise well even to large test sets. Although the
CSN did not perform as well at classifying cases as the CNN, we argue that
the generation of similarity knowledge as a by-product of the classication
process is a non-negligible contribution. The main benet of using the CSN over
a traditional CNN implementation is that the output of the CSN produces
feature vectors of the original case base which are good representations of how
each case ts into the case base as a whole and allows direct, accurate distance
measurements as a proxy for measuring similarity between cases.</p>
      <p>On reection, there may be a couple of reasons that the CSN did not perform
as strongly on the classication task as the CNN. A more structured method
of classifying the output test feature vector, such as exhaustive k-nn sorting or
informed class representative selection, could potentially oer better
classication results and may be worth further study. It is a distinct possiblity that
the class representative which was randomly selected for comparison with the
test vector was a poor representative of the class, and that may have inuenced
the classication of test cases. Exhaustively comparing the test case with all
training cases, or using a method of selection to pick class representatives may
improve classication accuracy.
5</p>
      <sec id="sec-10-1">
        <title>Conclusion and Further Work</title>
        <p>We have demonstrated that a CSN is capable of learning similarity knowledge
on the SelfBACK dataset. In addition, we have demonstrated that a CSN can
use this similarity knowledge to perform human activity classication on the
SelfBACK dataset and can perform competitively with a CNN on this task.</p>
        <p>
          In future work we would like to further explore SNN’s capacity to develop
simlarity knowledge between cases in order to determine whether this could be
used in some manifestation to develop similarity knowledge between features.
Our end goal is to use this similarity knowledge in order to populate the
similarity arcs which exist between information entities in a Case Retrieval Network
(CRN) [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. If this could be applied, it would oer an inexpensive method to
develop ecient coverage of extensive case bases and reduce the initial cost
often associated with CRNs in this task. In addition, it would be interesting to
explore dierent methods of pair generation and dierent methods of utilising
the similarity knowledge generated by a CSN for classication.
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Bell</surname>
            , S. and Bala,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Lerning Visual Similarity for Product Design with Convolutional Neural Networks</article-title>
          .
          <source>In: Proceedings of the 42nd International Conference and Exhibition on Computer Graphics and Interactive Techniques</source>
          ,
          <string-name>
            <surname>SIGGRAPH</surname>
          </string-name>
          <year>2015</year>
          . Los Angeles, CA, USA. 9 -
          <issue>13</issue>
          <year>August 2015</year>
          . New York, NY, USA: ACM
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Berlemont</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lefebvre</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <year>2015</year>
          .
          <article-title>Siamese Neural Network Based Similarity Metric for Inertial Gesture Classication and Rejection</article-title>
          .
          <source>In: 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition</source>
          ,
          <string-name>
            <surname>FG</surname>
          </string-name>
          <year>2015</year>
          . Ljubljana, Slovenia. 4 - 8 May
          <year>2015</year>
          . Red Hook,
          <string-name>
            <surname>NY</surname>
          </string-name>
          , USA: Curran Associates, Inc
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Bromley</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guyon</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , LeCun,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Sackinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            and
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          <year>1993</year>
          .
          <article-title>Signature Verication Using a "Siamese" Time Delay Neural Network</article-title>
          .
          <source>International Journal of Pattern Recognition and Articial Intelligence</source>
          , Vol
          <volume>7</volume>
          (
          <issue>4</issue>
          ) pp.
          <fpage>669</fpage>
          -
          <lpage>688</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Chopra</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hadsell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and LeCun,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <year>2005</year>
          .
          <article-title>Learning a Similarity Metric Discriminatively, with Application to Face Verication</article-title>
          .
          <source>In: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision</source>
          and Patter Recognition,
          <string-name>
            <surname>CVPR</surname>
          </string-name>
          <year>2005</year>
          . San Diego, CA, USA.
          <fpage>20</fpage>
          -
          <lpage>25</lpage>
          June 2005. Washington, DC, USA: IEEE Computer Society
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Dalal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Athavale</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Jindal</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>Case Retrieval Optimisation of Case-Based Reasoning Through Knowledge-Intensive Similarity Measures</article-title>
          .
          <source>International Journal of Computer Applications</source>
          , Vol
          <volume>34</volume>
          (
          <issue>3</issue>
          ) pp.
          <fpage>12</fpage>
          -
          <lpage>18</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Koch</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zemel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Salakhutdinov</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <year>2015</year>
          .
          <article-title>Siamese Neural Networks for One-Shot Learning</article-title>
          .
          <source>In: Proceedings of the 32nd International Conference on Machine Learning</source>
          ,
          <string-name>
            <surname>ICML</surname>
          </string-name>
          <year>2015</year>
          .
          <article-title>Lille Grand Palais</article-title>
          ,
          <source>Lille. 6 11 July</source>
          <year>2015</year>
          . Red Hook,
          <string-name>
            <surname>NY</surname>
          </string-name>
          , USA: Curran Associates, Inc
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>LeCun</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bottou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Haner</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <year>1998</year>
          .
          <article-title>Gradient-Based Learning Applied to Document Recognition</article-title>
          .
          <source>Proceedings of the IEEE</source>
          , Vol
          <volume>86</volume>
          (
          <issue>11</issue>
          ) pp.
          <fpage>2278</fpage>
          -
          <lpage>2324</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Lenz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Burkhard</surname>
            ,
            <given-names>H. D.</given-names>
          </string-name>
          <year>1996</year>
          .
          <article-title>Case Retrieval Nets: Basic Ideas and Extensions</article-title>
          .
          <source>In: Proceedings of the 20th Annual German Conference on Articial Intelligence</source>
          , KI-96. Dresden, Germany.
          <fpage>17</fpage>
          -
          <issue>19</issue>
          <year>September 1996</year>
          . Berlin, Germany: Springer-Verlag
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Sani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiratunga</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Massie</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>SELFBACK - Activity Recognition for Self-management of Low Back Pain</article-title>
          .
          <source>In: Proceedings of the 36th SGAI International Conference on Articial Intelligence</source>
          ,
          <source>AI-2016</source>
          . Cambridge, England.
          <fpage>13</fpage>
          -
          <issue>15</issue>
          <year>December 2016</year>
          . Cham, Switzerland: Springer Nature
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Stahl</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <year>2006</year>
          .
          <article-title>Combining Case-Based and Similarity-Based Product Recommendation</article-title>
          .
          <source>In: Proceedings of the 8th European Conference of Advances in Case-Based Reasoning, ECCBR 2006. Fethiye, Turkey. 4 - 7 September</source>
          <year>2006</year>
          . Berlin, Germany: Springer-Verlag
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Stahl</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gabel</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <year>2006</year>
          .
          <article-title>Optimising Similarity Assessment in CaseBased Reasoning</article-title>
          .
          <source>In: Proceedings of the 21st National Conference on Articial Intelligence, AAAI-06</source>
          . Boston, Massachusetts.
          <fpage>16</fpage>
          -
          <issue>20</issue>
          <year>July 2006</year>
          . Berlin, Germany: Springer-Verlag
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Yih</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          et al.
          <year>2011</year>
          .
          <article-title>Learning Discriminative Projections for Text Similarity Measures</article-title>
          .
          <source>In: Proceedings of the Fifteenth Conference on Computational Natural Language Learning, CONLL 11. Portland</source>
          ,
          <string-name>
            <surname>OR</surname>
          </string-name>
          , USA.
          <fpage>23</fpage>
          -
          <issue>24</issue>
          <year>June 2011</year>
          . Stroudsburg, PA, USA: ACL
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>