On the Designing of Popular Packages

By the package design problem we are given a set of queries (referred to as a query log) with each being a bit string indicating the favourite activities or items of customers and required to design a package of activities (or items) to satisfy as many customers as possible. It is a typical problem of data mining. In this paper, we address this problem and propose two algorithms to find most popular packages based on the signature techniques. One is for finding single packages while the second is devoted to the design of multiple packages, by which a binary tree for a query log is constructed in a way as a signature tree for a signature file. Extensive experiments have also been conducted, which show that our method for this problem is promising.