Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
16
click to vote
KDD
2009
ACM
favorite
Email
discuss
report
192
views
Data Mining
»
more
KDD 2009
»
CP-summary: a concise representation for browsing frequent itemsets
14 years 1 months ago
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
more »
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)
Researcher Info
Data Mining Study Group
Computer Vision