Research Article

Equipment Quality Information Mining Method Based on Improved Apriori Algorithm

Algorithm 2

The process of the matrix-based strong association rule extracting algorithm.
Input: numerical matrix L
Step1 import the names of the items in the data set and store them in the matrix label in the form of characters
Step2 set the minimum confidence threshold min_conf
Step3 calls function fopen to open text document
Step4 determine the number of non-zero elements in the last row of matrix L and store it in a, then let n be the number of columns of L
Step5 scan matrix L. Divide the itemsets according to the number of items contained, and count the number of each itemset, then store them in matrix edge
Step6 make to complete the blocking
Step7 make
Step8 make
Step9 let aff be the number of rows of B
Step10 make
Step11 find the element equal to 1 in the j-th row of B, and store the subscript in matrix d. Calculate the ratio of the value of to the total number of transactions to obtain the support sup
Step12 make
Step13 make , , and create an empty matrix str2
Step14 make ,
Step15 assign the value of d to the formal parameter ind, the value of str2 to the formal parameter stry, the value of index to the formal parameter index, then call function conf_ calculate
Step16, if , turn to step12; Otherwise turn to step16
Step17, if , turn to step10; Otherwise turn to step17
Step18, if , turn to step8; Otherwise turn to step19
Step19 call the function fclose to save and close the document
Output: text document recording strong association rules