<?xml version="1.0" encoding="UTF-8"?>
<item xmlns="http://omeka.org/schemas/omeka-xml/v5" itemId="26091" public="1" featured="0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://omeka.org/schemas/omeka-xml/v5 http://omeka.org/schemas/omeka-xml/v5/omeka-xml-5-0.xsd" uri="https://archives.christuniversity.in/items/show/26091?output=omeka-xml" accessDate="2026-06-18T06:41:36+00:00">
  <collection collectionId="7">
    <elementSetContainer>
      <elementSet elementSetId="1">
        <name>Dublin Core</name>
        <description>The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/.</description>
        <elementContainer>
          <element elementId="50">
            <name>Title</name>
            <description>A name given to the resource</description>
            <elementTextContainer>
              <elementText elementTextId="3139">
                <text>Faculty Publications</text>
              </elementText>
            </elementTextContainer>
          </element>
        </elementContainer>
      </elementSet>
    </elementSetContainer>
  </collection>
  <itemType itemTypeId="28">
    <name>Conference Paper</name>
    <description>Faculty Publications- Conference Papers</description>
  </itemType>
  <elementSetContainer>
    <elementSet elementSetId="1">
      <name>Dublin Core</name>
      <description>The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/.</description>
      <elementContainer>
        <element elementId="39">
          <name>Creator</name>
          <description>An entity primarily responsible for making the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259287">
              <text>Kalpana, P.; Sumathi, P.; Jose, Teena; Deepa, S.; Gondkar, Raju Ramakrishna; Zeema, Loveline J.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="50">
          <name>Title</name>
          <description>A name given to the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259288">
              <text>Matrix-Based Apriori Methods for Frequent Pattern Mining: An In-Depth Survey</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="40">
          <name>Date</name>
          <description>A point or period of time associated with an event in the lifecycle of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259289">
              <text>01-01-2025</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="48">
          <name>Source</name>
          <description>A related resource from which the described resource is derived</description>
          <elementTextContainer>
            <elementText elementTextId="259290">
              <text>3rd International Conference on Recent Advances in Information Technology for Sustainable Development, ICRAIS 2025 - Proceedings;pp.73-78</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="43">
          <name>Identifier</name>
          <description>An unambiguous reference to the resource within a given context</description>
          <elementTextContainer>
            <elementText elementTextId="259291">
              <text>&lt;a href="https://doi.org/10.1109/ICRAIS66073.2025.11234713" target="_blank" rel="noreferrer noopener"&gt;https://doi.org/10.1109/ICRAIS66073.2025.11234713&lt;/a&gt; &lt;br /&gt;&lt;br /&gt;&lt;a href="https://www.scopus.com/pages/publications/105029752804?origin=resultslist" target="_blank" rel="noreferrer noopener"&gt;https://www.scopus.com/pages/publications/105029752804?origin=resultslist&lt;/a&gt;</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="38">
          <name>Coverage</name>
          <description>The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant</description>
          <elementTextContainer>
            <elementText elementTextId="259292">
              <text>Kalpana P., Dept. of Computer Science, CHRIST University, Karnataka, Bangalore, India; Sumathi P., Dept. of Computer Science, Vysya College, Tamil Nadu, Salem, India; Jose T., Dept. of Computer Science, CHRIST University, Karnataka, Bangalore, India; Deepa S., Dept. of Computer Science, CHRIST University, Karnataka, Bangalore, India; Gondkar R.R., Dept. of Computer Science, CHRIST University, Karnataka, Bangalore, India; Zeema L.J., Dept. of Computer Science, CHRIST University, Karnataka, Bangalore, India</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="41">
          <name>Description</name>
          <description>An account of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259293">
              <text>Data Mining identifies intriguing, useful, and previously unknown patterns and correlations between data stored in databases or warehouses. Frequent Pattern Mining (FPM) is one of the vital methods in the prospering arena of data mining (DM), and it describes the relationship between the items in the datasets. In the last two decades, many studies were carried out in FPM using the Apriori algorithm. The Apriori algorithm requires many database scans and produces numerous candidate itemsets, increasing I/O cost and decreasing computational efficiency. To address these issues, researchers contributed many improved versions of Apriori and proved that those algorithms scan the database only once and identify the frequent itemsets quickly, especially when the itemsets are higher, and provide higher efficiency and feasibility. This research article summarizes matrix-based Apriori algorithms in the literature used for identifying frequent itemsets. 2025 IEEE.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="49">
          <name>Subject</name>
          <description>The topic of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259294">
              <text>Apriori; Data Mining; Frequent Pattern Mining; Matrix-based Apriori</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="45">
          <name>Publisher</name>
          <description>An entity responsible for making the resource available</description>
          <elementTextContainer>
            <elementText elementTextId="259295">
              <text>Institute of Electrical and Electronics Engineers Inc.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="46">
          <name>Relation</name>
          <description>A related resource</description>
          <elementTextContainer>
            <elementText elementTextId="259296">
              <text>ISBN: 979-833150143-3;</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="44">
          <name>Language</name>
          <description>A language of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259297">
              <text>English</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="51">
          <name>Type</name>
          <description>The nature or genre of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259298">
              <text>Conference paper</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="47">
          <name>Rights</name>
          <description>Information about rights held in and over the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259299">
              <text>Restricted Access; Hardcopy may be available in the library</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="42">
          <name>Format</name>
          <description>The file format, physical medium, or dimensions of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="259300">
              <text>online</text>
            </elementText>
          </elementTextContainer>
        </element>
      </elementContainer>
    </elementSet>
  </elementSetContainer>
</item>
