Sciweavers

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

44

Voted

TKDE
2002

favoriteEmaildiscussreport

67views more TKDE 2002»

Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set

14 years 10 months ago

Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set

Download www.cs.tau.ac.il

Dao-I Lin, Zvi M. Kedem

Real-time Traffic

TKDE 2002 |

claim paper

Related Content

» ShrFPTree An Efficient Tree Structure for Mining ShareFrequent Patterns

» Discovering Frequent Agreement Subtrees from Phylogenetic Data

» CTITL Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Grow...

» Discovering Frequent Episodes in Sequences of Complex Events

» An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream

» Frequent termbased text clustering

» Efficient Discovery of Frequent Correlated Subgraph Pairs

» Discovery of maximum length frequent itemsets

» A Treebased Approach for Efficiently Mining Approximate Frequent Itemsets

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TKDE
Authors	Dao-I Lin, Zvi M. Kedem

Comments (0)