2009 CPSummaryaConciseRepresentation

• (Poernomo et al., 2009) ⇒ Ardian Kristanto Poernomo, and Vivekanand Gopalkrishnan. (2009). “CP-summary: A Concise Representation for Browsing Frequent Itemsets.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557096

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%22CP-summary%3A+a+concise+representation+for+browsing+frequent+itemsets%22+2009
• http://portal.acm.org/citation.cfm?doid=1557019.1557096&preflayout=flat#citedby

Quotes

Abstract

This paper tackles the problem of summarizing frequent itemsets. We observe that previous notions of summaries cannot be directly used for analyzing frequent itemsets. In order to be used for analysis, one requirement is that the analysts should be able to browse all frequent itemsets by only having the summary.

For this purpose, we propose to build the summary based upon a novel formulation, conditional profile (or c-profile). Several features of our proposed summary are: (1) each profile in the summary can be analyzed independently, (2) it provides error guarantee (ε-adequate), and (3) it produces no false positives or false negatives.

Having the formulation, the next challenge is to produce the most concise summary which satisfies the requirement. In this paper, we also designed an algorithm which is both effective and efficient for this task. The quality of our approach is justified by extensive experiments.

The implementations for the algorithms are available from http://www.cais.ntu.edu.sg/~vivek/pubs/cprofile09.

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2009 CPSummaryaConciseRepresentation	Ardian Kristanto Poernomo Vivekanand Gopalkrishnan			CP-summary: A Concise Representation for Browsing Frequent Itemsets		KDD-2009 Proceedings		10.1145/1557019.1557096		2009