<!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>People Identification Based on Sitting Patterns</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nguyen Gia</string-name>
          <email>gia@ht.sfc.keio.ac.jp</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Takuya Takimoto</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nguyen Doan Minh Giang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jin Nakazawa</string-name>
          <email>jin@ht.sfc.keio.ac.jp</email>
          <email>kaz@ht.sfc.keio.ac.jp</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kazunori Takashio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hideyuki Tokuda</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Environment and Information Studies, Keio University</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <fpage>33</fpage>
      <lpage>37</lpage>
      <abstract>
        <p>This paper proposes a people identification method based on the sitting patterns. This method uses weak evidences from pressure sensors, accelerometer sensors, and light sensors placed on a chair to recognize who is sitting on the chair without any psychological and physical burden on users. We discuss how we have implemented the system using softmax regression model, gradient descent algorithm and nearest neighbor search algorithm. Our experimental result shows that this method can be used in places which has private properties such as a home or small a office. Nowadays, there are several biometric people identification methods such as fingerprint based[1], iris based[2] or by the using of vein[3]. These biometric identifiers are strong and suitable for applications that request high accuracy such as security applications. However these identifiers annoy user with the requests for specific actions. For example, in the case of fingerprint, users have to properly touch a fingerprint scanner or in the case of retina, users have to look at retina scanner for a while, which might cause a psychological and physical burden on users. These methods also need delicate and expensive devices such as fingerprint scanner or retina scanner. In such situations as inside of a house or a small office with a small number of users, we do not need high accuracy as those available with strong identifiers. For example, in a small office, which employees come from some different country, an employee comes to the office, sits on a public chair and turns on a public computer. And then, a greeting sound of his/her country comes out of the speaker and that computers' language will be automatically change to his/her native language. Is it interesting? For the other scenario, an office has a meeting but the boss is in a business trip so he/she uses a robot for teleconference. The robot stands in the middle of meeting room and when the boss wants to talk with one of his/her employees, he/she only has to let the robot knows the employees' name instead of rotating robot by hand. Both of these scenarios can be realized with one of the above people identification methods, but using biometric identifiers for this scene is wasteful and unnecessary. Any mistake of people recognition in these scenes is not a big problem, users can easily overcome it by simple actions. So, it is acceptable to inference to the user who is sitting beforehand based on weaker evidences. Collecting weak evidences also can be implemented without any psychological and physical burden of users. This paper proposes an easy deployment and inexpensive people identification method that uses weak evidences from pressure sensors, accelerometer sensors and light sensor placed on a chair. The reason of using pressure sensor is the difference of weight among users. Also, we think that the sitting patterns are different between users so we use accelerometer sensors to recognize the movement of the chair when user sit in it. The light sensor is used to measure the coverage of user in the chair. We have used softmax regression model, a supervised learning algorithm and gradient descent algorithm, an algorithm to solve optimization problem to inference who is sitting in the chair Remainder of this paper is organized as follows. Section 2 describes the design and implementation of system. The softmax regression model, gradient descent algorithm, nearest neighbor search algorithm and how they are used are discussed in Section 3. Section 4 shows the result of our experiment while Section 5 is about related work. Conclusions and future work are described in Section 6.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Design and Implementation</title>
    </sec>
    <sec id="sec-3">
      <title>Hardware</title>
      <sec id="sec-3-1">
        <title>We use SunSPOT[8] for accelerometer sensor and light sensor.</title>
      </sec>
      <sec id="sec-3-2">
        <title>SunSPOT (Sun Small Programmable Object Technology) as shown</title>
        <p>in Figure 1(a) is a wireless sensor network mote which developed by
Sun Microsystems. One SunSPOT device has three types of sensor
including an accelerometer sensor, a light sensor and a temperature
sensor. In this research, we only use one SunSPOT device to sense
accelerometer and light data. These data can be sent to a computer
for processing through a base station as shown in Figure 1(b).
(a) SunSPOT device</p>
        <p>(b) SunSPOT base station</p>
      </sec>
      <sec id="sec-3-3">
        <title>We also attach to the chair four pressure sensors. We use FSR406</title>
        <p>for a pressure sensor and Figure 2 shows how it can be viewed in
fact. We want to use as least as possible sensors to reduce the cost of
the system and we think that four is a good number. It is enough for
people recognition issue based on weak evidences.
The software diagram of this system is shown in Figure 4 . The data
receiver module receives data from sensors and forwards it to the
data processing module. In here, the data is normalized to be used in
the learning module. In the learning module, the system uses softmax
regression model and gradient descent algorithm to inference to the
user who are sitting beforehand, output result and get confirmation
from user through the user interaction module.</p>
      </sec>
      <sec id="sec-3-4">
        <title>We consider the people identification problem with a small number</title>
        <p>of users as a classification problem. The system classifies the data
from sensors into groups. A group represents a user so the number
of groups equal to the number of users exists in the data training set.</p>
      </sec>
      <sec id="sec-3-5">
        <title>When a user sit down on the chair, a set of data will be created. The</title>
        <p>system will determine which group that this data set belongs to. By
this way, the system can recognize the user who is sitting beforehand.</p>
      </sec>
      <sec id="sec-3-6">
        <title>We used Nearest Neighbor Search Algorithm to resolve this classi</title>
        <p>
          fication problem. The ”weight” used in the nearest neighbor search
algorithm are determined by Softmax Regression Model and
Gradient Descent Algorithm. The softmax regression model is discussed
in subsection below.
Softmax Regression Model[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] is a supervised learning algorithm
used for multi-class classification. In Softmax Regression Model,
we have a training set { (x(1), y(1)), (x(2), y(2)), . . . , (x(n), y(n))}
of n labeled examples, where the input features are m dimensional
vector x(i) ∈ &lt;m and the label y can take on k different values,
y(i) ∈ { 1, 2, . . . , k} . Given a test input x, we want our
hypothesis to estimate the probability that P (y = j| x) for each value of
j = 1, 2, . . . , k. I.e., we want to estimate the probability of the class
label taking on each of the k different possible values. Thus, our
hypothesis will output a k dimensional vector (whose elements sum to
        </p>
      </sec>
      <sec id="sec-3-7">
        <title>1) giving us our k estimated probabilities. Concretely, our hypothesis</title>
        <p>hθ(x) takes the form:
2P (y(i) = 1| x(i); θ)3
6P (y(i) = 2| x(i); θ)7
hθ(x(i)) = 664 ... 775 =</p>
        <p>P (y(i) = k| x(i); θ)
2eθ1T x(i) 3
Pjk=1 1eθjT x(i) 66466eθ2T...x(i) 7777
eθkT x(i) 5</p>
        <p>Here, m dimensional vectors θ1, θ2, . . . , θk ∈ &lt;m are the
parameters of this model and θiT is the transpose vector of θi. Notice that
the term Pjk=1 e1θjT x(i) normalizes the distribution, so that it sums to
one. For convenience, we will also write θ to denote all the
parameters of our mode.</p>
      </sec>
      <sec id="sec-3-8">
        <title>If we know the hθ function, we can determine the class label that</title>
        <p>given input vector x belong to. That is the class label that have
maximum estimated probability. But the hθ function is expressed by the
θ parameters, so we have to find all the θ parameters.</p>
      </sec>
      <sec id="sec-3-9">
        <title>The cost function of Softmax Regression Model is shown in the equation below.</title>
        <p>J (θ) = − n1 » Xn Xk Q(i, j) log
i=1 j=1
eθjT x(i)
l=1 eθlT x(i)
Pk
–</p>
      </sec>
      <sec id="sec-3-10">
        <title>Here, Q(i, j) is defined as follow:</title>
      </sec>
      <sec id="sec-3-11">
        <title>In Softmax Regression, we also have:</title>
        <p>Q(i, j) =
 1
0
if y(i) = j
otherwise
P (y(i) = j| x(i); θ) =
eθjT x(i)
l=1 eθlT x(i)
Pk</p>
      </sec>
      <sec id="sec-3-12">
        <title>Now, the training is mean finding all θ parameters that minimize</title>
        <p>the cost function. There are several methods to do it such as gradient
descent algorithm or limited-memory BFGS algorithm. In this paper,
we used gradient descent algorithm that is described below.
3.2</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Gradient Descent Algorithm</title>
      <sec id="sec-4-1">
        <title>The gradient descent algorithm[5] is a algorithm used to choosing θ</title>
        <p>to minimize the cost function J (θ). It starts with some ”initial guess”
for θ, and that repeatedly change θ to make J (θ) smaller, until
hopefully converge to a value of θ that minimizes J (θ). The gradient
descent algorithm repeatedly performs the update:
θj := θj − α</p>
        <p>J (θ)
∂
∂θj</p>
      </sec>
      <sec id="sec-4-2">
        <title>This update is simultaneously performed for all value of j. Here, α is called the learning rate.</title>
      </sec>
      <sec id="sec-4-3">
        <title>To using gradient descent algorithm to minimize the cost function</title>
        <p>of softmax regression model, we need to compute the partial
derivative of cost function J (θ). It is shown by the equation below.</p>
        <p>i=1
∇θj J (θ) = − n1 Xn »x(i)(Q(i, j) − P (y(i) = j| x(i); θ))
–</p>
        <p>In particular, ∇θj J (θ) is itself a m dimensional vector, so that its
l-th element is ∂θ∂jl J (θ), the partial derivative of J (θ) with respect
to the l-th element of θj . So we can use it to compute the update
value of all parameters in softmax regression model.</p>
      </sec>
      <sec id="sec-4-4">
        <title>But, take a look, if we take each of our parameter vectors θj , and</title>
        <p>subtract fixed vector ψ from it, so that every θj is now replaced with
θj − ψ ( for every j = 1, 2, . . . , k), we have:</p>
        <p>P (y(i) = j| x(i); θ) =</p>
        <p>e(θj −ψ)T x(i)
Pk</p>
        <p>l=1 e(θl−ψ)T x(i)
=
eθjT x(i) e−ψT x(i)
l=1 eθlT x(i) e−ψT x(i) =
Pk
eθjT x(i)
l=1 eθlT x(i)
Pk</p>
      </sec>
      <sec id="sec-4-5">
        <title>It show that if the cost function J (θ) is minimized by some setting</title>
        <p>of parameters (θ1, θ2, . . . , θk), then it is also minimized by (θ1 −
ψ, θ2 − ψ, . . . , θk − ψ) for any value of ψ. Thus, the minimizer of</p>
      </sec>
      <sec id="sec-4-6">
        <title>J (θ) is not unique. To fix it, the cost function J (θ) is modified by</title>
        <p>adding a weight decay term λ2 Pik=1 Pjm=1 θi2j which penalizes large
values of the parameters. Our cost function is now
J (θ) = − n1 » Xn Xk Q(i, j) log</p>
      </sec>
      <sec id="sec-4-7">
        <title>With this weight decay term (for any λ &gt; 0), the cost function</title>
      </sec>
      <sec id="sec-4-8">
        <title>J (θ) is now strictly convex, and is guaranteed to have a unique min</title>
        <p>imize solution. Also, the gradient descent algorithm is guaranteed to
converge to the global minimum. To apply the gradient descent
algorithm, we also need the partial derivative of this new definition of</p>
      </sec>
      <sec id="sec-4-9">
        <title>J (θ). The partial derivate is shown below.</title>
        <p>i=1
∇θj J (θ) = − n1 Xn»x(i)(Q(i, j) − P (y(i) = j| x(i); θ)) + λθj
–</p>
      </sec>
      <sec id="sec-4-10">
        <title>By using gradient descent algorithm with this equation to mini</title>
        <p>mize the cost function J (θ), we will have a working implementation
of softmax regression model.
3.3</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Nearest Neighbor Search Algorithm</title>
      <p>
        Nearest neighbor search (NNS)[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ][
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], also known as proximity
search, similarity search or closest point search, is an optimization
problem for finding closest points in metric spaces. The problem
is: given a set S of points in a metric space M and a query point
q ∈ M , find the closest point in S to q. In many cases, M is taken to
be d-dimensional Euclidean space and distance is measured by
Euclidean distance. The Euclidean distance between points p and q is
the length of the line segment connecting them. In Cartesian
coordinates, if p = (p1, p2, . . . , pd) and q = (q1, q2, . . . , qd) are two
points in d-dimensional Euclidean space, then the distance from p to
q, or from q to p is given by:
dpq = dqp = p(q1 − p1)2 + (q2 − p2)2 + . . . + (qd − pd)2
v
u d
= tuX(qi − pi)2
i=1
      </p>
      <sec id="sec-5-1">
        <title>Now, if CP (q) is the closest point to q in set S, we have:</title>
        <p>n
CP (q) = { p| p ∈ S; dpq = min dSiq}
i=1</p>
      </sec>
      <sec id="sec-5-2">
        <title>We have discussed about softmax regression model, gradient descent algorithm and nearest neighbor search generally in subsections above. In this subsection, we describe how we use those algorithms in fact.</title>
        <p>We use one accelerometer sensor, one light sensor and four pressure
sensors placed on a chair for people recognition, so we have eight
values of sensor data.
•
•
•
•
•
•
•
•</p>
      </sec>
      <sec id="sec-5-3">
        <title>Ax: The X-axis accelerometer value</title>
      </sec>
      <sec id="sec-5-4">
        <title>Ay: The Y-axis accelerometer value</title>
      </sec>
      <sec id="sec-5-5">
        <title>Az: The Z-axis accelerometer value</title>
      </sec>
      <sec id="sec-5-6">
        <title>Light: The light sensor value value</title>
      </sec>
      <sec id="sec-5-7">
        <title>A1: The first pressure sensor value</title>
      </sec>
      <sec id="sec-5-8">
        <title>A2: The second pressure sensor value</title>
      </sec>
      <sec id="sec-5-9">
        <title>A3: The third pressure sensor value</title>
      </sec>
      <sec id="sec-5-10">
        <title>A4: The fourth pressure sensor value</title>
      </sec>
      <sec id="sec-5-11">
        <title>When a user sitting down to the chair, an array of 15 records, each has 8 values</title>
        <p>r = (Ax, Ay, Az, Light, A1, A2, A3, A4)
will be created. This array is called RA and it describes the
information of one sitting time of a user. In our data training set, there are 10</p>
      </sec>
      <sec id="sec-5-12">
        <title>RA for one user. So if the number of user is k, the number of RA in data training set is n = 10k.</title>
        <p>RA = { r1, r2, . . . , r15}</p>
        <p>We use nearest neighbor search with 8-dimensional Euclidean
space for this classification problem. But the Euclidean distance
function we use has a litter different to general function. Because
these eight sensor data affect to result in different ways, we modify
the Euclidean distance function like this:
v
u 8
dpq = tuX θi(qi − pi)2</p>
        <p>i=1</p>
      </sec>
      <sec id="sec-5-13">
        <title>The parameters θ1, θ2, . . . , θ8 is the ”weight” of each sensor data and</title>
        <p>we use softmax regression model and gradient descent algorithm to
determine them. Our people identify process can be described as
following:</p>
      </sec>
      <sec id="sec-5-14">
        <title>When a user sit in the chair, a RA is created. We take the aver</title>
        <p>age of all records of this RA and the average of all records of all
RA in data training set and use softmax regression model to compute
the parameters used in nearest neighbor search algorithm.The
gradient descent algorithm is implemented with learning rate α = 0.001
and λ = 0.001 to minimize the cost function in softmax regression
model. Finally, we use nearest neighbor algorithm with determined
parameters to classify the new RA to one of k class labeled. The
result is the user whom this class labeled stand for. There are always
10 RA for one user in our data training set, but the data training set is
dynamic. When a user sit down to the chair, after the system receives
the confirmation from the user, in data training set, the oldest RA of
this user is replaced by the newest RA. By this way, the system can
adapt with the change of users’ sitting pattern.
4</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Evaluation</title>
      <sec id="sec-6-1">
        <title>We evaluated this system in two cases. In the first case, we evaluated</title>
        <p>with a group of five people and in the other case, we evaluated with
a group of ten people. In both case, one person must sit in a chair
twenty times, ten for training and ten for testing. Figure 5 shows
the result of first case while Figure 6 shows the result of last one.</p>
      </sec>
      <sec id="sec-6-2">
        <title>In the case of group of five people, we achieved an accuracy as 90 percentage and 72 percentage in the case of ten people.</title>
      </sec>
      <sec id="sec-6-3">
        <title>In the case of five people, there were three people who are iden</title>
        <p>tified with the accuracy as 100%. One people with the accuracy as
90%, it means that there was only one mistake.</p>
      </sec>
      <sec id="sec-6-4">
        <title>With the achievement accuracy as 72% in the case of ten peoples,</title>
        <p>this method certainly can be used in a small office or inside a house
with a small number of users.
5</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Related Works</title>
      <p>
        Masafumi Yamada et al.[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] have used 32 pressure sensors placed on
a chair to people recognition. They have tested with a group of eight
people who are required to sit 20 times, 19 for training and only one
for testing. The result is shown in the Figure 7. Their system does
not recognize user at the time user was sitting down but after few
seconds, when the values of sensor get steady.The value of sensors
were collected starting from a few seconds before the user starts
sitting until the values of the sensor get steady after sitting. From the
data they cut out two parts. One of them is the part during the user is
sitting down, labeled as ”Sitting part” . Another is the part after the
sensor value gets steady, labeled as ”Stable part”. The classifier used
is nearest neighbor method. Every testing data are classified to the
nearest training data. Used features are classified into four groups to
investigate how useful the information of pressure sensors is.
      </p>
      <sec id="sec-7-1">
        <title>Feature Set1 (FS1): 32 sensors Ω values (32)</title>
      </sec>
      <sec id="sec-7-2">
        <title>Feature Set2 (FS2): sum of 32 sensors Ω values (1)</title>
      </sec>
      <sec id="sec-7-3">
        <title>Feature Set3 (FS3): time difference of FS1 (32)</title>
      </sec>
      <sec id="sec-7-4">
        <title>Feature Set4 (FS4): normalized sensor values of FS3 (1)</title>
      </sec>
      <sec id="sec-7-5">
        <title>As we can see, the achieved accuracy in steady part is about 90% but only 56% in the sitting part for average with a group of eight people.</title>
        <p>We have proposed a people identification method based on sitting
patterns of user. This method used weak evidences collected by
accelerometer sensor, light sensor, and pressure sensor placed on a
chair to inference who is sitting on it. We considered this problem as
a classification problem and use nearest neighbor search algorithm
with ”weight” to resolve it. The ”weight” used in nearest neighbor
search algorithm is determined by softmax regression model while
the cost function is minimized by gradient descent algorithm. We
also presented the result of experiments which shown that this
people identification has the accuracy enough to be used in places which
have private properties such as inside of a house or a small office.</p>
      </sec>
      <sec id="sec-7-6">
        <title>How to due with other evidences and what is the best way to place</title>
        <p>sensor to a chair are the things to be discussed in the future.
Moreover, the evolution of performance increasing the number of people
need to be studied. We also intend to implement a module to
recognize the posture of user or the users’ mood.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>ACKNOWLEDGEMENTS</title>
      <sec id="sec-8-1">
        <title>This research was partly supported by National Institute of Information and Communications Technology (NICT).</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.K.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pankanti</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Bolle</surname>
          </string-name>
          , '
          <article-title>An Identity Authentication System Using Fingerprints'</article-title>
          ,
          <source>Proc. IEEE</source>
          , vol.
          <volume>85</volume>
          , no.
          <issue>9</issue>
          , pp.
          <volume>1</volume>
          ,
          <issue>365</issue>
          -
          <fpage>1</fpage>
          ,
          <issue>388</issue>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Personal identification based on iris texture analysis'</article-title>
          ,
          <source>IEEE Trans. Pattern Anal. Mach. Intell</source>
          , vol.
          <volume>25</volume>
          , p.
          <fpage>1519</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hill</surname>
          </string-name>
          , 'Retina Identification, Biometrics: Personal Identification' in Networked Society,
          <string-name>
            <given-names>A.K.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bolle</surname>
          </string-name>
          , and S. Pankanti, eds., Kluwer Academic, pp.
          <fpage>123</fpage>
          -
          <lpage>141</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Do</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Ng</surname>
          </string-name>
          . '
          <article-title>Transfer learning for text classification'</article-title>
          .
          <source>In Proceedings of Neural Information Processing Systems (NIPS)</source>
          ,
          <year>2005</year>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Burges</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Shaked</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Renshaw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lazier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Deeds</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Hamilton</surname>
          </string-name>
          , and G. Hullender, '
          <article-title>Learning to Rank using Gradient Descent'</article-title>
          .
          <source>In ICML '05 Proceedings of the 22nd international conference on Machine learning.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Peter</surname>
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Yianilos</surname>
          </string-name>
          , '
          <article-title>Data structures and algorithms for nearest neighbor search in general metric spaces'</article-title>
          .
          <source>SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Stefan</given-names>
            <surname>Berchtold</surname>
          </string-name>
          , Christian Bohm, Daniel A.Keim,
          <string-name>
            <surname>Hans-Peter Kriegel</surname>
          </string-name>
          , '
          <article-title>A cost model for nearest neighbor search in high-dimensional data space'</article-title>
          .
          <source>PODS '97 Proceedings of the sixteenth ACM SIGACTSIGMOD-SIGART symposium on Principles of database systems .</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8] http://www.sunspotworld.com,
          <year>August</year>
          ,
          <year>2011</year>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Yamada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Toyama</surname>
          </string-name>
          , M. Kudo, '
          <article-title>Person Recognition by Pressure Sensors'</article-title>
          .
          <source>Knowledge-Based Intelligent Information and Engineering Systems, Lecture Notes in Computer Science</source>
          , Vol.
          <volume>3684</volume>
          ,
          <string-name>
            <surname>Rajiv</surname>
            <given-names>Khosla</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Robert J.</given-names>
            <surname>Howlett</surname>
          </string-name>
          , Lakhmi C. Jain (Eds.), Springer,
          <year>2005</year>
          ,
          <fpage>703</fpage>
          -
          <lpage>708</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Michael</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Bastian</surname>
          </string-name>
          ,
          <string-name>
            <surname>Jacob H. Gunther</surname>
          </string-name>
          , Todd K. Moon, '
          <article-title>A simplified natural gradient learning algorithm'</article-title>
          .
          <source>Journal Advances in Artificial Neural Systems</source>
          , Vol.
          <year>2011</year>
          , Article No.
          <volume>3</volume>
          ,
          <string-name>
            <given-names>Hinwadi</given-names>
            <surname>Publishing</surname>
          </string-name>
          <string-name>
            <surname>Corp</surname>
          </string-name>
          , Newyork,
          <year>2011</year>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>