Sciweavers

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

29

ICDE
2000
IEEE

favoriteEmaildiscussreport

90views Database» more ICDE 2000»

Finding Interesting Associations without Support Pruning

14 years 5 months ago

Finding Interesting Associations without Support Pruning

Download ifsc.ualr.edu

Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristid

Real-time Traffic

Database | ICDE 2000 | Support Pruning |

claim paper

Related Content

» FARMER Finding Interesting Rule Groups in Microarray Datasets

» Automated support specification for efficient mining of interesting association rules

» An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Cou...

» Dynamic MissCounting Algorithms Finding Implication and Similarity Rules with Confidence P...

» Mining the Most Interesting Web Access Associations

» COE A General Approach for Efficient GenomeWide TwoLocus Epistasis Test in Disease Associa...

» Fastanova an efficient algorithm for genomewide association study

» OPAMAn Efficient One Pass Association Mining Technique without Candidate Generation

» Finding Associations and Computing Similarity via Biased Pair Sampling

Post Info
More Details (n/a)

Added	01 Nov 2009
Updated	01 Nov 2009
Type	Conference
Year	2000
Where	ICDE
Authors	Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang

Comments (0)