Association rule computation using lexicographic order combination

Article type: Research Article

Authors: Roychowdhury, Shounak

Affiliations: 2op744, 500 Oracle Parkway, Oracle Corporation, Redwood Shores, CA 94404, USA. E-mail: [email protected]

Abstract: Association rules in data mining are used in order to discover latent information hidden in databases. The class of apriori algorithms provide a simple way to compute association rules. Despite the simplicity of the algorithm its computational complexity is quite high. Specifically, the computational performance degrades due to intense computational requirements during the phase of frequent itemset generation. In this paper we have proposed a novel procedure to extract frequent itemsets. The itemset is modeled as a cell of a hypercube, and this cell is represented as a lexicographical order combination. The procedure described in this paper reduces the number of database passes to a single pass to extract frequent itemsets. Thus, the procedure is computationally attractive.

DOI: 10.3233/ICA-2003-10408

Journal: Integrated Computer-Aided Engineering, vol. 10, no. 4, pp. 387-397, 2003