<!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>Comparison of Neural Network and KNN classifiers, for recognizing hand-written digits</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Iwo Różycki</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Adam Wolszleger</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Applied Mathematics, Silesian University of Technology</institution>
          ,
          <addr-line>Kaszubska 23, 44-100 Gliwice</addr-line>
        </aff>
      </contrib-group>
      <fpage>16</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>This paper presents a comparison between two diferent types of classifiers, neural Network and KNN (k nearest neighbors) . The object is to decide which one better handles recognising numbers, from zero to ten, that have been handwritten. In this project we designed a program that analyses data from a database, and feeds this data to the classifiers, which in turn analyse the input from the user and make a prediction based on the information gained from the training data. The aim is to see whether there are any significant diferences when it comes to the accuracy and speed of the learning processes. The comparison will be made based on the accuracy of the predictions with diferent configurations and parameters. Both these classifiers work in a diferent way and can be used eficiently for diferent purposes and this paper will present data that will help decide whether either of these is better suited in this particular area.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Hand-written digits</kwd>
        <kwd>Handwritten signature verification</kwd>
        <kwd>Handwritten character recognition</kwd>
        <kwd>Neural networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>is true.</p>
      <p>
        The idea behind it, is that it can calculate
straightArtificial neural networks are computing systems, whi- line distance, also known as Euclidean distance,
bech are based on the anatomy of the human brain. The tween the input data and all that data that is available
brain is made up of billion of neurons, which are inter- and which represents all the possible classes, that the
connected by quadrillions of connections, called syn- input can be classified as. It therefore relies on this
apses, which allow the information to flow between data set to be complete and would be unable to
recogthe neurons. Currently, because of the huge network nize objects beyond what is already known to it.
of connections, the human brain exceeds any super- There are many aproahes to classify text, by ranking
computer in terms of processing power. Its structure evaluation [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], convolutional features extraction [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] or
can be used to create artificial networks, which use devoted benchmark [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. This project aims to compare
artificially created neurons and synapses, which are these classifiers in the area of recognizing
handwritable to process information and make predictions [1, ten digits. This is an important area, as recognition
2, 3] and guesses based on the knowledge gained [4, of handwriting is used in a variety of modern devices.
5]. This process is known as Deep Learning and it is We will test diferent configurations of parameters for
widely used today in voice recognition, driver less cars both neural networks and KNN and hopefully see
sigand can be found in devices we use every day, such as nificant diferences in performances in terms of
accusmart phones or TVs [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. In the process of deep learn- racy and speed.
ing, a computer model learns classification, directly
from data, in the form of images, sound or text. A well 1.1. Related works
constructed model can even exceed human ability.
      </p>
      <p>
        KNN, or k nearest neighbors is a much simple algo- These two classifiers have been compared in diferent
rithm, that classifies new data based on a similarity articles and areas of research. In one of them, they
measure, usually a distance function, to the already have been used to monitor the conditions of machines,
stored available cases [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The assumptions made by by analyzing the vibration of journal-bearings. In this
these algorithm ,is that similar things exist close to research another technique, which is more commonly
each other and it is most useful when that assumption used in this area, was also used for comparison. At
the end, the research has concluded that neural
netSYSTEM 2020: Symposium for Young Scientists in Technology, work performed better in this particular task. Another
Engineering and Mathematics, Online, May 20 2020 research, that will be mentioned is one where these
a"daimwworoolz1y6558@1@stusdtuednetn.pto.plsoll.spll.p(Al(.I.WRoólżsyzlcekgie);r) models where compared at classifying magnetic
resonance images (MRI). This is a very important area of
research, as MRI is not always easy to interpret by a
© 2020 Copyright for this paper by its authors. Use permitted under Creative
CPWrEooUrckReshdoinpgs IhStpN:/c1e6u1r3-w-0s.o7r3g CCoEmUmoRns WLiceonrsekAsthtriobuptioPnr4o.0cIneteerdnaitniognasl ((CCC EBYU4R.0)-.WS.org)
      </p>
      <p>As seen on the graph the function only exists
between 0 and 1 and it is used in models, that predict
probability as their output. This makes it ideal for this
project, as the aim is to produce a probability with
which the input resembles one of the digits. For the
back propagation algorithm we need to calculate the
error of the neurons to correctly modify the weights
of the synapses. For the last layer of neurons the
following equation was used:
Δ
=  ⋅ (
− 
) ⋅  ′( ) ⋅</p>
      <p>(4)</p>
      <p>Here Δ ′ represents the change in weight, ‘LR’ is
the learning rate, which is chosen for the network,
 ′( ) is the derivative of the activation function and
′ is the input from the j-th neuron from the
previous layer. We have defined a gradient of error for each
neuron to help us with the above equation. For the last
(5)
(6)
(7)
(8)
 
=  ′( ) ⋅ (
−</p>
      <p>)</p>
      <sec id="sec-1-1">
        <title>For the other layers:</title>
        <p>=  ′( ) ⋅ ∑   ⋅  

 =1</p>
      </sec>
      <sec id="sec-1-2">
        <title>Here the sum of the weights is multiplied by the er</title>
        <p>ror gradient from i-th neuron, that is connected to the
current neuron. Based on the equations above we can
simplify the }Δ ′ to the following:
Δ</p>
        <p>=  ⋅  ⋅</p>
      </sec>
      <sec id="sec-1-3">
        <title>For the KNN we have used the Euklidean distance as the measure of similarity. For this we have used the</title>
        <p>√
 ( ,  ) = ( 1 −  1)2 + ... + (  −   )2</p>
        <p>Here ‘X’ represents the known data and ‘Y’
represents the input. Based on the distances calculated the
algorithm, then calculates which class of objects
appears the most in the ‘k’ closest neighbors. The value
of ‘k’ was decided after experimenting on diferent
val ( ) =</p>
        <p>1
1 + exp(− )</p>
        <p>The derivative, which is used later for back
propagation,is as follows:
 ′( ) =</p>
        <p>1
1 + exp(− )
⋅ (1 −</p>
        <p>1
1 + exp(− )
)
(2)</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. Description of the proposed</title>
      <p>
        The deep learning process of the neural network is
based on the idea of data being fed into the neurons
(3) and modified, as it passes further along the diferent
tant features, which were then fed into a feed forward
back propagation neural network and a KNN
classiifer. In this particular research KNN came out on top
in terms of accuracy [
        <xref ref-type="bibr" rid="ref11 ref12 ref13 ref14 ref15 ref16">11, 12, 13, 14, 15, 16</xref>
        ]. As seen
by these examples of research, both neural network
and KNN can perform well in diferent conditions and
only by close comparison can we find out which one
performs better in a given area.
2.
      </p>
    </sec>
    <sec id="sec-3">
      <title>Mathematical model</title>
      <sec id="sec-3-1">
        <title>For this project we needed various functions to modify the data as it passed between the neurons. The function used to sum the inputs from the previous layer of neurons looked as follows:</title>
        <p />
        <p>=  1 ⋅  1 +  2 ⋅  2 +  3 ⋅  3 + ... +   ⋅   (1) following equation:</p>
        <p>The ‘X’ represents the output from a given neuron
and ‘W’ is the weight attached to the synapse. After
the input has been weighted and summed, it is
modiifed by the activation function. These functions act to
modify the input, so that the output from the model
can be interpreted and used as needed. The function,
that has been used in this project is the sigmoid
function and it shown on the following graph. The graph
ues.
shows the function that is used to model the data:
nique was used on the images, to extract most impor- layer it is calculated as follows:
system
layers. In order to achieve this we have to create a
model, that uses various functions to modify the data
appropriately. We start with the building block of the
neural network, which is a neuron. The neuron
receives information via synapses from the neurons that
are connected to it.</p>
        <p>Each synapse has a weight attached to it, which is
initially generated randomly, when the synapse is first
created. The data, that comes into a neuron is weighted
using the previously described equation. This means
that the input depends on both the output of the pre- Figure 2: Epoch number test
vious neuron, as well as the weight of the synapse
that connects them. When all the inputs have been
summed, the data is then modified by the activation
function of the neuron. The function used in this project set to determine their accuracy. This was calculated
in the sigmoid function, for the reasons described pre- based on how many times the model chose the correct
viously. The neurons within the network are orga- digit, based on the information gained from the
trainnized through layers. The two layers,the first and the ing data. We have used this accuracy to compare the
last, are present in all neural networks. The middle two models in diferent scenarios.
layers, known as hidden layers, are optional, but can
be added to improve the accuracy of the learning pro- 4. Experiments
cess of the network. The optimal number of the hidden
layers and the configuration of neurons within them For our experiments, we have decided to create
anwas decided on through testing of the network. For other set of training data, by augmenting the one we
the input data we have used bitmaps, sized 28x28 bits, already had. This was done by randomly modifying
that represent one the ten digits. For that we needed the pictures with one of four functions, which were
roenough neurons in the first layer for each individual tation by 90 degrees left or right, rotation by 90 degrees
bit of the picture. The number of neurons in the last horizontally(upside down) or adding ‘noise’, which was
layer represents the total number of classes that the in- just changing some of the pixels to black. This was
put can be classified as, which in this project was ten. done to see, whether there would be a significant
difThe experiments we conducted to choose the number ference for the classifiers when dealing with random
of hidden layers will be described later in the article. nature of the modifications of the data. The final data
To modify the weights of the synapses we have used sets had 60000 images for non-augmented data and
the back propagation algorithm, described in the pre- 120000 for the augmented data(this one had both the
vious section. augmented and non-augmented).</p>
        <p>The KNN classifier was much simpler to set up. In For the first test, we deiced to test how the
numthis algorithm the objects are classified based on their ber of epochs would afect the accuracy of the neural
closeness to data, that the algorithm was trained on. network, when using augmented and non-augmented
When an input is presented, the Euclidean distance be- data. For this we have kept the learning rate at 0.3
tween it and all the available options is calculated. The and have added a singular hidden layer of 32 neurons.
distances are then sorted and the smallest are at the This setup was chosen to decrease the learning time
top of the list. The value of ‘k’ determines the number and to allow us to complete further tests. We started
of distances that are considered during the voting pro- the experiment at 1 epoch and increased it gradually
cess, where the algorithm checks which class appears until 10 epochs. For the augmented data we have only
most frequently within these chosen distances. This increased this number to 5, because of the increased
class is then given as the prediction for the input. This size of data. The results are presented on the diagram
means that only the value of ‘k’ has to be determined below. From the diagram we can see that the
accubefore setting up the classifier. This has been chosen racy varied between 93.5% and almost 96% for the
nonbased on tests described later. augmented data.</p>
        <p>The data used for this project has been taken from The highest accuracy was reached at 9 epochs, and
the MINST database. It has been sorted into a test and the biggest diference can be observed as we increased
a training set. For this project we have trained both the number from 4 to 5. Above 5 epochs the accuracy
classifiers using the training set and then used the test
doesn’t fall below 95% and it remains rather constant. learning speeds. Even with a number as small as 10
The average accuracy for the non-augmented data is we can see, that the accuracy is still 86.86%.
95.05% with a standard deviation of 0.0071%. When In the next test we have added another hidden layer.
it comes to the augmented data the accuracy is vis- We have kept the same learning rate and number of
ibly decreased. Here is varied between 90% and 92%, epochs as in previous test and set added 50 neurons to
so there was slightly lower variation, but this might be the first hidden layer. The second one started with 10
due to lower number of epochs tested. The biggest dif- neurons and we have increased this number gradually.
ference between the two sets can be seen at 5 epochs, The results can be seen below. Here we can see the
rewhere it reaches 4.52%. The best accuracy can be ob- sults are less conclusive. The best accuracy of 93.49%
served at 3 epochs at 91.68%, and it seems to decrease was achieved at 30 neurons. This value is smaller, than
past this number. The average accuracy for augmented what was achieved with one hidden layer with 40
neudata was 90.92% with a standard deviation of 0.0059%. rons. The worst accuracy of 92.96% was achieved at 20
The average diference between the two sets at each neurons and this value is higher, than the worst
accunumber of epochs was calculated to be 3.69%. Based on racy with one hidden layer. Adding another set of
hidthese values, we can conclude that the neural network den layers leads to increased learning times, which has
was better at recognizing data without augmentation, to be taken under consideration. From this it can be
but even with random modifications it was able to cor- concluded, that adding another layer of neurons will
rectly guess the digit over 90% of the time. Across both not necessarily lead to higher accuracies, but might be
sets the average accuracy was calculated to be 93.67% a safer option. In our final setup we have decided to
with a standard deviation of 0.0212%. Another test was keep a single hidden layer, mostly due to decreased
designed to check, how the number of hidden layers learning time.
influenced the accuracy. In this test we kept the learn- The next test was designed to check how
changing rate at 0.3 and set the number of epochs to one. ing the value of ‘k’ would influence the accuracy of
We started with 10 neurons in the hidden layer. The the KNN classifier. This is the only parameter, that
results can be seen below. Here was can see, that as we could modify, therefore it is the only test done for
we increased the number of neurons the accuracy in- the KNN. Here we started with k=10 and increased the
creased. Here it ranged between 86.5% and went up number. KNN took a very long time, when we used the
to almost 95% for 200 neurons. We did a test with 200 whole of test set for accuracy calculation, so we
deneurons to check whether a bigger increase in num- cided to only use a 100 elements from the test set. The
ber led to larger increase in accuracy. The downside distances were calculated for the whole of the training
to increasing this number was higher learning times, set. Results of the test can be seen below. As can be
although the increase was small. seen on the graph, we have decided to increase the
val</p>
        <p>The biggest increase can be seen between 10 and ues drastically as gradual increase led to unsubstantial
20 neurons, where it reached 3.80%. Between 50 and diferences. From the graph we can see, that the
accu200 neurons the increase was only 0.45%. From this racy stays the same for low values of ‘k’, namely below
we can conclude, that the number of neurons in the 30 and then decreases as this number goes up. This
dehidden layer can be kept quite small and this won’t crease is more rapid as we reach values of 1000 and
adversely afect the accuracy and will lead to faster more. KNN handled non-augmented data better, as
mentation. In the table below we have recorded the
most prevalent answer for each case. From the table
we can see, that both classifiers were able to recognize
digits 0,2,3,5 and 8 quite well, but digits 7 and 9 posed a
dificulty. Neural network was able to correctly guess
the digit 80% with both data sets. KNN classifier was
able to guess the digit 70% of the time with both sets.</p>
        <p>
          The diferences were not big enough be safely
conclude which classifier was better. Preferentially this
test would be carried out a 100 or more times, to give
more meaningful results.
5. Conclusions
was the case with the neural network, but here the dif- After carrying out the project and analyzing the data,
ferences varied between 1-2%, and at k=1000 the accu- it cannot be safely concluded, that one classifier would
racy for augmented data was higher at 86% compared be better than the other one in the area of
recognizto 84%. The highest observed accuracy was higher ing handwritten digits. Although the tests, that were
for KNN at 96.00% compared to 95.65% for the neural concluded did show some diferences in the accuracy,
network. From this experiment we can conclude that especially when the data was augmented, not enough
lower values of ‘k’ lead to higher accuracy of the clas- tests were performed to show, that the diferences
besification process. This makes sense as higher values tween the classifiers were significant. What can be
of ‘k’ means higher distance values are taken into con- concluded from these tests is, that there is indeed a
sideration during the voting process. For comparison diference in how these perform. KNN seemed to
betwe collected the data from the experiments described ter handle data, that was augmented, probably due to
previously and put the together on a single diagram the fact that all the training data was available to it for
visible below. As can be seen on the graph, the accu- comparison with the test data. Neural network on the
racy for KNN, at low values of ‘k’, is higher when com- other hand increased in accuracy as we increased the
pared with the neural network. Increasing the number number of epochs, as this allowed the weights on the
of epochs lead to higher accuracies, which cannot be synapses to be changed, according to how many errors
said for increased values of k. The biggest diferences in judgment the network made. With the back
propcan be observed with augmented data. KNN achieved agation algorithm the network gets better each time
higher accuracy when compared with neural network, we train it on the training data, where the KNN
algowith the highest diference being 5%. At 3 epochs this rithm only needs to be given the training data once for
diference is lower. Based on this data we can say that it to work. Both classifiers show quite high accuracy,
KNN should, in theory be better at correctly predict- when dealing with our data, but this would preferably
ing the answer. We have designed one last experiment be increased to very close to a 100%, with correct
conto test this. We have drawn each digit 20 times and ifguration. More tests would have to be done, mostly
tested each classifier with and without the use of aug- to find the best possible setups for both these models
and to produce more statistically significant data.
Finally in the testing phase we noticed that there is a
slight improvement in accuracy if the images are
preifltered [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          ,
          <article-title>Intelligent home systems for ubiquitous user support by using neural networks and rule-based approach</article-title>
          ,
          <source>IEEE Transactions on Industrial Informatics</source>
          <volume>16</volume>
          (
          <year>2019</year>
          )
          <fpage>2651</fpage>
          -
          <lpage>2658</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bonanno</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. Capizzi,</surname>
          </string-name>
          <article-title>An hybrid neuro-wavelet approach for long-term prediction of solar wind</article-title>
          ,
          <source>Proceedings of the International Astronomical Union</source>
          <volume>6</volume>
          (
          <year>2010</year>
          )
          <fpage>153</fpage>
          -
          <lpage>155</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bonanno</surname>
          </string-name>
          , G. Capizzi,
          <article-title>Exploiting solar wind time series correlation with magnetospheric response by using an hybrid neurowavelet approach</article-title>
          ,
          <source>Proceedings of the International Astronomical Union</source>
          <volume>6</volume>
          (
          <year>2010</year>
          )
          <fpage>156</fpage>
          -
          <lpage>158</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Capizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Sciuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Susi</surname>
          </string-name>
          ,
          <article-title>A spiking neural network-based longterm prediction system for biogas production</article-title>
          ,
          <source>Neural Networks</source>
          <volume>129</volume>
          (
          <year>2020</year>
          )
          <fpage>271</fpage>
          -
          <lpage>279</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G.</given-names>
            <surname>Cardarilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Di</given-names>
            <surname>Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fazzolari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nannarelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Petricca</surname>
          </string-name>
          , M. Re,
          <article-title>Design space exploration based methodology for residue number system digital filters implementation</article-title>
          ,
          <source>IEEE Transactions on Emerging Topics in Computing</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          ,
          <article-title>Soft trees with neural components as image-processing technique for archeological excavations</article-title>
          ,
          <source>Personal and Ubiquitous Computing</source>
          <volume>24</volume>
          (
          <year>2020</year>
          )
          <fpage>363</fpage>
          -
          <lpage>375</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Husnain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mumtaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Coustaty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Luqman</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-M. Ogier</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Malik</surname>
          </string-name>
          ,
          <article-title>Urdu handwritten text recognition: A survey</article-title>
          ,
          <source>IET Image Processing</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N. D.</given-names>
            <surname>Cilia</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. De Stefano</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Fontanella</surname>
            ,
            <given-names>A. S.</given-names>
          </string-name>
          <article-title>di Freca, A ranking-based feature selection approach for handwritten character recognition</article-title>
          ,
          <source>Pattern Recognition Letters</source>
          <volume>121</volume>
          (
          <year>2019</year>
          )
          <fpage>77</fpage>
          -
          <lpage>86</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9] H.
          <article-title>-h.</article-title>
          <string-name>
            <surname>Zhao</surname>
          </string-name>
          , H. Liu,
          <article-title>Multiple classifiers fusion and cnn feature extraction for handwritten digits recognition, Granular Computing (</article-title>
          <year>2019</year>
          )
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rahman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S. A.</given-names>
            <surname>Rabby</surname>
          </string-name>
          ,
          <string-name>
            <surname>Sankhya:</surname>
          </string-name>
          <article-title>An unbiased benchmark for bangla handwritten digits recognition</article-title>
          ,
          <source>in: 2019 IEEE International Conference on Big Data (Big Data)</source>
          , IEEE,
          <year>2019</year>
          , pp.
          <fpage>4676</fpage>
          -
          <lpage>4683</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Venckauskas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karpavicius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Damaševičius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Marcinkevičius</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Kapočiu¯te-</article-title>
          <string-name>
            <surname>Dzikiené</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>Open class authorship attribution of lithuanian internet comments using oneclass classifier</article-title>
          ,
          <source>in: 2017 Federated Conference on Computer Science and Information Systems (FedCSIS)</source>
          , IEEE,
          <year>2017</year>
          , pp.
          <fpage>373</fpage>
          -
          <lpage>382</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mittal</surname>
          </string-name>
          ,
          <article-title>A novel approach for handwritten character recognition using k-nn classifier</article-title>
          ,
          <source>in: Soft Computing: Theories and Applications</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>887</fpage>
          -
          <lpage>894</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , E. Tramontana,
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Sciuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wozniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Damaevicius</surname>
          </string-name>
          , G. Borowik,
          <article-title>Authorship semantical identification using holomorphic chebyshev projectors</article-title>
          ,
          <source>in: 2015 Asia-Pacific Conference on Computer Aided System Engineering</source>
          , IEEE,
          <year>2015</year>
          , pp.
          <fpage>232</fpage>
          -
          <lpage>237</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pappalardo</surname>
          </string-name>
          ,
          <string-name>
            <surname>E. Tramontana,</surname>
          </string-name>
          <article-title>An agent-driven semantical identifier using radial basis neural networks and reinforcement learning</article-title>
          ,
          <source>arXiv preprint arXiv:1409.8484</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>T.</given-names>
            <surname>Jadhav</surname>
          </string-name>
          ,
          <article-title>Handwritten signature verification using local binary pattern features and knn</article-title>
          ,
          <source>International Research Journal of Engineering and Technology (IRJET) 6</source>
          (
          <year>2019</year>
          )
          <fpage>579</fpage>
          -
          <lpage>586</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Wróbel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Starczewski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>Handwriting recognition with extraction of letter fragments</article-title>
          ,
          <source>in: International Conference on Artificial Intelligence and Soft Computing</source>
          , Springer,
          <year>2017</year>
          , pp.
          <fpage>183</fpage>
          -
          <lpage>192</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.</given-names>
            <surname>Capizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Coco</surname>
          </string-name>
          , G. Sciuto,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>A new iterative fir filter design approach using a gaussian approximation</article-title>
          ,
          <source>IEEE Signal Processing Letters</source>
          <volume>25</volume>
          (
          <year>2018</year>
          )
          <fpage>1615</fpage>
          -
          <lpage>1619</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>