DocumentCode :
2162360
Title :
An algorithm for hining conditional hybrid dimensional association rules using Boolean hatrix
Author :
Khare, Neelu ; Adlakha, Neeru ; Pardasani, K.R.
Author_Institution :
Dept. of Comput. Applic., Maulana Azad Nat. Inst. of Technol., Bhopal, India
Volume :
2
fYear :
2010
fDate :
26-28 Feb. 2010
Firstpage :
644
Lastpage :
648
Abstract :
In this paper, we present an algorithm of mining hybrid dimension association rules which satisfies the definite condition on the basis of multidimensional transaction database. Boolean hatrix based approach has been employed to generate frequent itemsets in multidimensional transaction databases. 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. We illustrate the implementation of algorithm with the help of a simple example.
Keywords :
Boolean algebra; data mining; matrix algebra; relational algebra; Apriori property; Boolean logical operation; Boolean matrix; Boolean relational calculus; conditional hybrid dimensional association rules; multidimensional transaction database; Association rules; Calculus; Computer applications; Data mining; Itemsets; Iterative methods; Mathematics; Multidimensional systems; Relational databases; Transaction databases; Boolean matrix; hybriy yimensional association rule; multiyimensional transaction yatabase; relational calculus;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-5585-0
Electronic_ISBN :
978-1-4244-5586-7
Type :
conf
DOI :
10.1109/ICCAE.2010.5451707
Filename :
5451707
Link To Document :
بازگشت