Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/40950
Title: Positive borders or negative borders: How to make lossless generator based representations concise
Authors: Liu, G. 
Li, J.
Wong, L. 
Hsu, W. 
Issue Date: 2006
Source: Liu, G.,Li, J.,Wong, L.,Hsu, W. (2006). Positive borders or negative borders: How to make lossless generator based representations concise. Proceedings of the Sixth SIAM International Conference on Data Mining 2006 : 469-473. ScholarBank@NUS Repository.
Abstract: A complete set of frequent itemsets can get undesirably large due to redundancy. Several representations have been proposed to eliminate the redundancy. Existing generator based representations rely on a negative border to make the representation lossless. However, negative borders of generators are often very large. 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 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 as well as their generalizations.
Source Title: Proceedings of the Sixth SIAM International Conference on Data Mining
URI: http://scholarbank.nus.edu.sg/handle/10635/40950
ISBN: 089871611X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

43
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.