Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

KDD
2009
ACM

favoriteEmaildiscussreport

192views Data Mining» more KDD 2009»

CP-summary: a concise representation for browsing frequent itemsets

13 years 9 months ago

CP-summary: a concise representation for browsing frequent itemsets

Download www-ai.cs.uni-dortmund.de

Ardian Kristanto Poernomo, Vivekanand Gopalkrishna

Real-time Traffic

KDD 2009 |

claim paper

Related Content

» Frequent regular itemset mining

» Cartesian contour a concise representation for a collection of frequent sets

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

» A Thorough Experimental Study of Datasets for Frequent Itemsets

» A new classification of datasets for frequent itemsets

» Summarizing itemset patterns using probabilistic models

» Data Mining for Navigation Generating System with Unorganized Web Resources

Post Info
More Details (n/a)

Added	26 Jul 2010
Updated	26 Jul 2010
Type	Conference
Year	2009
Where	KDD
Authors	Ardian Kristanto Poernomo, Vivekanand Gopalkrishnan

Comments (0)