<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03659ntm a2200373 i 4500</leader>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">1</subfield>
    <subfield code="8">REF</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="c">REF</subfield>
    <subfield code="d">2019-11-28</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">FSKKP .H37 2019 r Thesis</subfield>
    <subfield code="p">T000000111</subfield>
    <subfield code="r">2020-09-30 00:00:00</subfield>
    <subfield code="w">2019-11-28</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">1</subfield>
    <subfield code="8">REF</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="c">REF</subfield>
    <subfield code="d">2019-11-28</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD12221</subfield>
    <subfield code="p">T000000112</subfield>
    <subfield code="r">2021-02-16 00:00:00</subfield>
    <subfield code="w">2019-11-28</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">91281</subfield>
    <subfield code="d">91287</subfield>
  </datafield>
  <controlfield tag="003">MY-KuUP</controlfield>
  <controlfield tag="005">20251125105435.0</controlfield>
  <controlfield tag="006">t||||fr|||| 000 0 </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">191128t20192019my a|||frm||| 000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0008333(Local)</subfield>
    <subfield code="q">hardback</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMP</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">UMP</subfield>
    <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">FSKKP .H37 2019 r Thesis</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Ali, Mohammed Hasan,</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="2" ind2="0">
    <subfield code="a">A fast learning network with improved particle swarm optimization for intrusion detection system/</subfield>
    <subfield code="c">Mohammed Hasan Ali</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMP,</subfield>
    <subfield code="c">2019</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="4">
    <subfield code="c">&#xA9; 2019</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xii, 131 pages :</subfield>
    <subfield code="b">illustrations ;</subfield>
    <subfield code="c">30 cm. +</subfield>
    <subfield code="e">1 CD-ROM</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">unmediated</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">volume</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">computer disc</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
    <subfield code="2">rda</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Faculty of Computer Systems and Software Engineering</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang &#x2013; 2019</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">In current days the intrusion detection systems (IDS) have several shortcomings such as high rates of false positive alerts, low detection rates of rare but dangerous  attacks,  and the  need  for  a  constant  human  intervention  and  tuning.  Daily,  there  are  reports  of incidents such as major ex-filtration of data for the purposes of stealing identities, credit card  numbers,  and  intellectual  properties,  as  well  as  to  take  control  of  network resources.  Machine  learning  approaches  have  been  widely  used  to  increase  the effectiveness of intrusion detection platforms. While some machine learning techniques are effective at detecting certain types of attacks, there are no known methods that can be  applied  universally  and  achieve  consistent  results  for  multiple  attack  types.  This situation  makes  the detection of cyber-based attacks on computer networks a relevant and challenging area of research. The Fast Learning Network (FLN)  is one  of  the  new machine learning algorithms  that  are  easy to  implement, computationally efficient,  and with  excellent  learning  performance  characteristics.  However,  the  internal  power parameters (weight and basis) of FLN are initialized at random, causing the algorithm to be unstable. In this work, a new cooperative multi-swarm scheme called multi-swarmoptimization (MRPSO)  which is  inspired by the human social behavior  was proposed for the interaction of several PSO groups while searching for the best parameters values of PSO. The focus of this research is on the development of a model that  can  optimize the  initial  parameters  of  FLN  based  on  MRPSO  to  obtain  an  optimal  set  of  initial parameters for FLN, thus,  creating an optimal FLN classifier named  as MRPSO-FLN which can improve the efficacy of network intrusion on data  sets  that contain instances of  multiple  classes  of  attacks.  These  methods  were  tested  on  NSL-KDD  intrusiondetection  datasets  and  the  results  indicate  that  the  proposed  approaches  used  in  the system  performed  well  in  large  dataset  processing.  In  these  experiments,  it  was demonstrated  that  the  FLN  optimization  method  achieved  0.9964  which  is  a  higher accuracy  than  most  of  the  existing  paradigms  for  classifying  network  intrusion detection data.</subfield>
  </datafield>
  <datafield tag="610" ind1="2" ind2="0">
    <subfield code="a">Faculty of Computer Systems and Software Engineering</subfield>
    <subfield code="x">Disertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Universities and colleges</subfield>
    <subfield code="x">Disertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Theses</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">THESIS</subfield>
  </datafield>
</record>
