The problem of discovering of frequent market baskets and association rules has been considered widely in literatures of data mining. In this study, by using the algebraic representation of market basket model, we propose a concept of logical constraints of items in an effort to detect the logical relationships hidden among them. Via the relationships of the propositional logics and logical constraints of items we propose also the concept of the complexity of customers. As a result we show that every set of customers can be characterized by a logical constraint and can be divided into different blocks that are characterized by quite simple logical constraints. Inthenatural way thecomplexityof acustomer set is defined as the number of the blocks it contains
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.