<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-04-10T17:03:33Z</responseDate>
  <request metadataPrefix="oai_dc" identifier="oai:meral.edu.mm:recid/6256" verb="GetRecord">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/6256</identifier>
        <datestamp>2021-12-13T00:27:28Z</datestamp>
        <setSpec>1582963342780:1605779935331</setSpec>
        <setSpec>user-uit</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Cloud Based Big Data Application of FP-Growth Algorithm and K-Means Clustering Algorithm Based on MapReduce Hadoop</dc:title>
          <dc:creator>Than Htike Aung</dc:creator>
          <dc:creator>Nang Saing Moon Kham</dc:creator>
          <dc:description>In current time large volumes of data are being produced by various modern applications at an ever increasing rate. These applications range from wireless sensors networks to social networks. The automatic analysis of such huge data volume is a challenging task since a large amount of interesting knowledge can be extracted. Association rule mining is an exploratory data analysis method able to discover interesting and hidden correlations among data. Since this data mining process is characterized by computationally intensive tasks, efficient distributed approaches are needed to increase its scalability. This paper proposes a cloud-based service, named parallel FP-growth, to efficiently mine association rules on a distributed computing model. It consists of a series of distributed MapReduce jobs run in the cloud. Each job performs a different step in the association rule mining process, followed by cloud-based parallel k-means clustering algorithm to produce similar groups These outputs are verify and filter by three conditional levels which results is useful rules.
As a case study, the proposed approach has been applied to the educational data scenario.</dc:description>
          <dc:date>2017-02-02</dc:date>
          <dc:identifier>http://hdl.handle.net/20.500.12678/0000006256</dc:identifier>
          <dc:identifier>https://meral.edu.mm/records/6256</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
