Implementation of Boolean Matrix Approach for Mining Multidimensional Association Rule with Non-Repetitive Predicate
Nilam K.Nakod1, M.B.Vaidya2
1Nilam Nakod, Department of Computer, AVCOE, Sangamner (Maharashtra), India.
2M.B. Vaidya, Department of Computer, AVCOE, Sangamner (Maharashtra), India.
Manuscript received on 20 January 2014 | Revised Manuscript received on 25 January 2014 | Manuscript published on 30 January 2014 | PP: 118-121 | Volume-2 Issue-6, January 2014 | Retrieval Number: F0952012614/2014©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Implementation of An Algorithm of Mining multidimensional association rules with non repetitive predicate from Relational Database is given. The relational database that we considered here is for Computer Store.we mine the multidimensional Association rule from it.Boolean Matrix based approach has been employed to generate frequent item sets. It adopts Boolean relational calculus to discover frequent predicate sets. When using this algorithm First time, it scans the database once and will generate the association rules. Apriori property is used in algorithm to prune the item sets. It is not necessary to scan the database again; it uses Boolean logical operations to generate the association rules.
Keywords: Association rule, Multidimensional Association Rule with Non Repetitive Predicates, Boolean Relational Calculus, Relational Database.
Scope of the Article: Data Mining