Sciweavers

Share
KAIS
2008

A new concise representation of frequent itemsets using generators and a positive border

8 years 6 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representations have been previously proposed to eliminate the redundancy. Generator based representations rely on a negative border to make the representation lossless. However, the number of itemsets on a negative border sometimes even exceeds the total number of frequent itemsets. In this paper, we propose to use a positive border together with frequent generators to form a lossless representation. A positive border is usually orders of magnitude smaller than its corresponding negative border. A set of frequent generators plus its positive border is always no larger than the corresponding complete set of frequent itemsets, thus it is a true concise representation. The generalized form of this representation is also proposed. We develop an efficient algorithm, called GrGrowth, to mine generators and positive borders a...
Guimei Liu, Jinyan Li, Limsoon Wong
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where KAIS
Authors Guimei Liu, Jinyan Li, Limsoon Wong
Comments (0)
books