<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Data clustering using min-min roughness and its application to cluster patients suspected diabetics</title>
  </titleInfo>
  <name type="personal">
    <namePart>Mohd Ridzuan Baharin</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">theses</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">my</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Kuantan, Pahang</placeTerm>
    </place>
    <publisher>UMP</publisher>
    <dateIssued>2012</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>102 p. : ill. (some col.) ; 30 cm. + 1 CD-ROM</extent>
  </physicalDescription>
  <abstract>In the context of information technology nowadays, there are many data exists. All of this data are scrambled over inside the computer and with the presence of internet, even more data exist. The problem with this is, when we want the needed data only, there are too many to look for and they are all scrambled over the internet databases. Therefore, there are techniques that are proposed that will provide a way to automatically mine the data and obtain only meaningful data from the huge data over the internet. The area discussed in this research is Knowledge Discovery in Databases (KDD) and the technique used is Minimum-Minimum Roughness (MMR). The dataset used will be the dataset of diabetic patients. By using this MMR technique, I intended to cluster the diabetic dataset n which each cluster will contain the data most related to each other.</abstract>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">Mohd Ridzuan Baharin</note>
  <note>Project paper (Bachelor of Computer Science (Software Engineering)) -- Universiti Malaysia Pahang - 2012</note>
  <note>Includes bibliographical references</note>
  <subject authority="lcsh">
    <topic>Cluster analysis</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Cluster analysis</topic>
    <topic>Data processing</topic>
  </subject>
  <identifier type="isbn">THE0002016(Local)</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">UMP</recordContentSource>
    <recordCreationDate encoding="marc">121211</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251114204524.0</recordChangeDate>
    <recordIdentifier source="KUKTEM">vtls000067645</recordIdentifier>
  </recordInfo>
</mods>
