Please use this identifier to cite or link to this item:
Title: Finding minimum representative pattern sets
Authors: Liu, G. 
Zhang, H.
Wong, L. 
Keywords: frequent pattern summarization
representative patterns
Issue Date: 2012
Citation: Liu, G., Zhang, H., Wong, L. (2012). Finding minimum representative pattern sets. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining : 51-59. ScholarBank@NUS Repository.
Abstract: Frequent pattern mining often produces an enormous number of frequent patterns, which imposes a great challenge on understanding and further analysis of the generated patterns. This calls for finding a small number of representative patterns to best approximate all other patterns. An ideal approach should 1) produce a minimum number of representative patterns; 2) restore the support of all patterns with error guarantee; and 3) have good efficiency. Few existing approaches can satisfy all the three requirements. In this paper, we develop two algorithms, MinRPset and FlexRPset, for finding minimum representative pattern sets. Both algorithms provide error guarantee. MinRPset produces the smallest solution that we can possibly have in practice under the given problem setting, and it takes a reasonable amount of time to finish. FlexRPset is developed based on MinRPset. It provides one extra parameter K to allow users to make a trade-off between result size and efficiency. Our experiment results show that MinRPset and FlexRPset produce fewer representative patterns than RPlocal - -an efficient algorithm that is developed for solving the same problem. FlexRPset can be slightly faster than RPlocal when K is small. © 2012 ACM.
Source Title: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
ISBN: 9781450314626
DOI: 10.1145/2339530.2339543
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
2012_finding_minimum_representative_pattern_sets-postprint.pdf223.66 kBAdobe PDF




checked on May 16, 2019

Page view(s)

checked on May 12, 2019


checked on May 12, 2019

Google ScholarTM



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