<?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-29T07:18:22Z</responseDate>
  <request metadataPrefix="oai_dc" identifier="oai:meral.edu.mm:recid/2908" verb="GetRecord">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/2908</identifier>
        <datestamp>2021-12-13T00:57:28Z</datestamp>
        <setSpec>1582963342780:1596102355557</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>Quantitative Association Rule Mining Using Information-Theoretic Approach</dc:title>
          <dc:creator>Dim En Nyaung</dc:creator>
          <dc:description>Quantitative Association Rule (QAR) mining has been recognized an influential research problem due to the popularity of quantitative databases and the usefulness of association rules in real life. Unlike Boolean Association Rules (BARs), which only consider boolean attributes, QARs consist of quantitative attributes which contain much richer information than the boolean attributes. To develop a data mining system for huge database composed of numerical and categorical attributes, there exists necessary process to decide valid quantization of the numerical attributes. One of the main problems is to obtain interesting rules from continuous numeric attributes. In this paper, the Mutual Information between the attributes in a quantitative database is described and normalization on the Mutual Information to make it applicable in the context of QAR mining is devised. It deals with the problem of discretizing continuous data in order to discover a number of high confident association rules, which cover a high percentage of examples in the data set. Then a Mutual Information graph (MI graph), whose edges are attribute pairs that have normalized Mutual Information no less than a predefined information threshold is constructed. The cliques in the MI graph represent a majority of the frequent itemsets.</dc:description>
          <dc:date>2012-12-01</dc:date>
          <dc:identifier>http://hdl.handle.net/20.500.12678/0000002908</dc:identifier>
          <dc:identifier>https://meral.edu.mm/records/2908</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
