The first class consists of problems related to Boolean matrix
multiplication and matrix multiplication over various semirings.
The Boolean matrix is used to describe the transaction database.
If the transaction database contained m items and n transactions the Boolean matrix will have m + 1 row and n + 2 columns.
2) Usually there are a large number of transactions in the transaction database, so the Boolean matrix is very large.
The items are converted into a Boolean matrix (Tsay & Chiang 2005, Wur & Leu, 1999).
DCIP employs a Boolean matrix for event description, whereby irrelevant items are deleted to reduce the number of recursive scans.
This paper is organized in six sections: section 2 reviewed related works, section 3 proposed an automated Boolean matrix data representation using AVL-Tree, section 4 demonstrated the benefits of data representation, section 5 presented the algorithms, section 6 discussed the experimental results, and section 7 concluded the proposed representation scheme.
2010) proposed Association Rule Based on Boolean Matrix algorithm, which only scans the transaction database once, and discovers frequent item set.
In this study, there are two main phases involved: firstly, a new transactional data representation scheme in the Boolean matrix form is proposed to help us to generate N- frequentitemset, and secondly the improvement to get association rules for the proposed Apriori algorithm, because of its efficiency to detect the last frequent itemsets.
t] are respectively the Boolean matrix
(transition from the local DOF to the global ones) and its transposed one.
First, the items are converted into a Boolean matrix, as shown in Table 5.
2 03 Table 2: Outpatient Record Database ID DATE OF OUTPATIENT VISIT ICD9 C1 20060703 D429 C1 20070424 D386 C2 20080120 D274 C4 20070304 D492 Table 3: Integrated Database ID ITEMS C1 X121, D429, D386 C2 X302, X519, D274 Table 4: Original Database ID ITEMS 1 A B C 2 A C D E 3 C D E 4 A D E 5 A C E 6 A Table 5: Original Boolean matrix ID A B C D E TOTAL 1 1 1 1 0 0 3 2 1 0 1 1 1 4 3 0 0 1 1 1 3 4 1 0 0 1 1 3 5 1 0 1 0 1 3 6 1 0 0 0 0 1 [SP.