<?xml version="1.0" encoding="utf-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<ArticleSet>
  <Article>
    <Journal>
      <PublisherName>IJIRCSTJournal</PublisherName>
      <JournalTitle>International Journal of Innovative Research in Computer Science and Technology</JournalTitle>
      <PISSN>I</PISSN>
      <EISSN>S</EISSN>
      <Volume-Issue>Volume 2 Issue 4</Volume-Issue>
      <PartNumber/>
      <IssueTopic>Computer Science &amp; Engineering</IssueTopic>
      <IssueLanguage>English</IssueLanguage>
      <Season>July - August 2014</Season>
      <SpecialIssue>N</SpecialIssue>
      <SupplementaryIssue>N</SupplementaryIssue>
      <IssueOA>Y</IssueOA>
      <PubDate>
        <Year>2019</Year>
        <Month>11</Month>
        <Day>17</Day>
      </PubDate>
      <ArticleType>Computer Sciences</ArticleType>
      <ArticleTitle>A Perspective on Boolean Matrix for Mining Hybrid Dimensional Association Rules</ArticleTitle>
      <SubTitle/>
      <ArticleLanguage>English</ArticleLanguage>
      <ArticleOA>Y</ArticleOA>
      <FirstPage>56</FirstPage>
      <LastPage>60</LastPage>
      <AuthorList>
        <Author>
          <FirstName>Chaitanya B. Pednekar</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>Y</CorrespondingAuthor>
          <ORCID/>
                      <FirstName>R.C.Suryawanshi</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>N</CorrespondingAuthor>
          <ORCID/>
           
        </Author>
      </AuthorList>
      <DOI></DOI>
      <Abstract>The discovery of association rules in data mining is an important issue, the core of which is the frequent pattern mining, Apriori algorithm is traditional for the association rule mining, but it should repetitively scan the database and can produce number of candidates. We present an algorithm of mining hybrid dimension association rules which satisfies the definite condition on the basis of multidimensional transaction database. Boolean Matrix based approach has been employed to generate frequent item sets in multidimensional transaction databases. When using this algorithm first time, it scans the database once and will produce the association rules. Apriori property is used in algorithm to prune the item sets. It is not needed to scan the database again; it uses Boolean logical operations to generate the association rules. It is going to store data in the form of bits, so it needs less memory space.</Abstract>
      <AbstractLanguage>English</AbstractLanguage>
      <Keywords>Hybrid dimensional association rule, Frequent itemsets, Boolean matrix, multidimensional transaction database.</Keywords>
      <URLs>
        <Abstract>https://ijircst.org/abstract.php?article_id=89</Abstract>
      </URLs>      
    </Journal>
  </Article>
</ArticleSet>