The task of mining the association rule has become one most widely used discovery pattern methods in Knowledge Discovery Databases (KDD). One such is to represent itemset memory. representation largely depend on type data structure that for storing them. Computing process im- pacts memory and time requirement itemset. With increase dimensionality datasets, large volume datasets will be difficul...

Testing for the existence of intersections is an important part of algorithms for interference detection, collision detection, and the like. We describe three techniques that can be used to implement an eecient intersection detection routine when entities are described constructively; that is, as set combinations of primitive entities. All three techniques are described in a domain where constr...

This paper is primarily concerned with the meet structure of the lattice of type Bn partitions of the set {±1, ±2, . . . , ±n}. The lattice of type Bn set partitions has been studied by Reiner [8]. It can be regarded as a representation of the intersection lattice of the type B Coxeter arrangements, see Björner and Wachs [3], Björner and Brenti [2] and Humphreys [6]. A set partition of type Bn ...