<?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>04076ntm a2200373 a 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="d">2023-04-10</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">FKOM .F37 2022 r Thesis</subfield>
    <subfield code="p">T000002171</subfield>
    <subfield code="r">2023-04-10 00:00:00</subfield>
    <subfield code="w">2023-04-10</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">0</subfield>
    <subfield code="8">REF</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2023-04-13</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD13252</subfield>
    <subfield code="p">T000002172</subfield>
    <subfield code="r">2023-04-13 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2023-04-13</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">99348</subfield>
    <subfield code="d">99354</subfield>
  </datafield>
  <controlfield tag="003">MY-KuUP</controlfield>
  <controlfield tag="005">20251125110727.0</controlfield>
  <controlfield tag="006">a||||fr|||| 000 0 </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">230410t20222022my a|||fr|||| 000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0009590 (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">FKOM .F37 2022 r Thesis</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Nur Farahaina Binti Idris,</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd /</subfield>
    <subfield code="c">Nur Farahaina Binti Idris</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMP,</subfield>
    <subfield code="c">2022</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="4">
    <subfield code="c">2022</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xi, 145 pages :</subfield>
    <subfield code="b">illustrations (some color) ;</subfield>
    <subfield code="c">30 cm. +</subfield>
    <subfield code="e">1 CD-ROM</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="2">rdacontent</subfield>
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="2">rdacontent</subfield>
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="2">rdamedia</subfield>
    <subfield code="a">unmediated</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="2">rdamedia</subfield>
    <subfield code="a">computer</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="2">rdacarrier</subfield>
    <subfield code="a">volume</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="2">rdacarrier</subfield>
    <subfield code="a">computer disc</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="2">rda</subfield>
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Faculty of Computing</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Thesis (Master of Science) -- Universiti Malaysia Pahang &#x2013; 2022</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">Classification is a data mining technique used to classify varied data types according to a specific criterion. One of the most powerful machine learning methods to handle classification problems is the decision tree. There are various decision tree algorithms, but the most commonly used are Iterative Dichotomiser 3 (ID3), CART, and C4.5. ID3 has the most advantages among the three algorithms, especially in processing time, as it builds the fastest tree with short depth. However, despite the decision tree&#x2019;s commonness in handling classification problems, it suffers problems like high variance and overfitting, leading to poor generalisation. The combination of fuzzy and ID3 algorithm manages the data more efficiently as it combines both the advantages of fuzzy and decision tree. For the proposed technique of the FID3-DBD algorithm, the continuous and discrete (integer) attributes would be defined in the linguistic values of the fuzzy sets, and the FUZZYDBD method is being used to set up the fuzzy sets&#x2019; parameters. Replacement with the linguistic labels of fuzzy sets with the highest compatibility of input values has also been done before the tree induction occurs. The proposed technique solves the limitation of the classic ID3 algorithm that cannot classify the continuous-valued attributes and, at the same time, increase the classification accuracy. The bagging method was then applied to the FID3-DBD algorithm to overcome overfitting problems and high variance in decision trees. Four breast cancer datasets were used to evaluate the classification accuracy: Wisconsin Breast Cancer (Original) dataset, WDBC (Diagnostic) dataset, Breast Cancer Coimbra dataset, and Mammographic Mass dataset. All those datasets were acquired from the UCI machine learning repository. This study aims to solve the limitation of the classic ID3 algorithm that is unable to classify continuous data well and overcome the high variance and overfitting issues. This research methodology consists of four fundamental steps: literature review, data collection, experiment implementation, and report writing. The FID3-DBD algorithm acquired the classification accuracy of 94.362% for the Wisconsin Breast Cancer (Original) dataset, 94.358% for the WDBC (Diagnostic) dataset, 81.119% for the Mammographic Mass dataset and 64.224% for the Coimbra dataset. The BFID3-DBD algorithm obtained the classification accuracy of 96.003% for the Wisconsin Breast Cancer (Original) dataset, 95.273% for the WDBC (Diagnostic) dataset, 81.590% for the Mammographic Mass dataset and 68.966% for the Coimbra dataset. The study verified that the FID3-DBD algorithm could classify the continuous data, and the BFID3-DBD algorithm overcame the overfitting issue, reduced high variance, and increased test data classification accuracy.</subfield>
  </datafield>
  <datafield tag="610" ind1="2" ind2="0">
    <subfield code="a">Faculty of Computing</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Universities and colleges</subfield>
    <subfield code="x">Dissertations</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>
