Abstract
This paper proposes an algorithm for mining frequent closed itemsets from multidimensional databases. The algorithm, which does not require transforming a database into a transaction database, is based on the intersections of object identifications for fast computing the supports of itemsets. Experimental results show that the algorithm is faster than dCHARM when transformation of multidimensional databases into transaction databases is included.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have