Sciweavers

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

201

Voted

ICDE
2002
IEEE

92views Database» more ICDE 2002»

Efficient Indexing Structures for Mining Frequent Patterns

16 years 4 months ago

Efficient Indexing Structures for Mining Frequent Patterns

Download www.comp.nus.edu.sg

Bin Lan, Beng Chin Ooi, Kian-Lee Tan

Real-time Traffic

Database | Efficient Indexing Structures | ICDE 2002 |

claim paper

Related Content

» Indexed Bit Map IBM for Mining Frequent Sequences

» FRACTURE mining Mining frequently and concurrently mutating structures from historical XML...

» ShrFPTree An Efficient Tree Structure for Mining ShareFrequent Patterns

» Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design

» Mining faulttolerant frequent patterns efficiently with powerful pruning

» Efficient frequent pattern mining over data streams

» Efficiently mining frequent trees in a forest

» FSMTree An Efficient Algorithm for Mining Frequent Temporal Patterns

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

Post Info
More Details (n/a)

Added	01 Nov 2009
Updated	01 Nov 2009
Type	Conference
Year	2002
Where	ICDE
Authors	Bin Lan, Beng Chin Ooi, Kian-Lee Tan

Comments (0)