Sciweavers

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

13

DIS
2007
Springer

favoriteEmaildiscussreport

97views Theoretical Computer Science» more DIS 2007»

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining

13 years 8 months ago

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining

Download research.nii.ac.jp

Takeaki Uno, Hiroki Arimura

Real-time Traffic

DIS 2007 | Theoretical Computer Science |

claim paper

Related Content

» Summarizing itemset patterns a profilebased approach

» Time and Space Efficient Discovery of Maximal Geometric Graphs

» Succinct summarization of transactional databases an overlapped hyperrectangle scheme

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	DIS
Authors	Takeaki Uno, Hiroki Arimura

Comments (0)