Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
FPTree-09

FPTree-09

Ratings: (0)|Views: 103 |Likes:
Published by Mohana Krishna

More info:

Published by: Mohana Krishna on Feb 01, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

11/14/2011

pdf

text

original

 
Mining Frequent Patternswithout Candidate Generation
Presented by
Song Wang.
March 18
th
, 2009 Data Mining ClassSlides Modified From Mohammed and Zhenyus Version
 Jiawei Han, Jian Pei and Yiwen YinSchool of Computer ScienceSimon Fraser University
 
2
O
utline
Frequent Pattern Mining: Problem statement and anexample
Review of Apriori-like Approaches
FP-Growth:
 ±
O
verview
 ±
FP-tree:
structure,constructionandadvantages
 ±
FP-growth:
FP-tree
conditional pattern bases
conditional FP-tree
frequent patterns
E
xperiments
Discussion:
 ±
Improvement of FP-growth
Conclusion Remarks
 
Mining Frequent Patterns without Candidate Generation (SIGMOD2000)
O
utline of the Presentation
 
3
Frequent Pattern Mining: An
E
xample
Given a transaction database DB and a minimum support threshold , findall frequent patterns (item sets) with support no less than .
Frequent Pattern Mining Problem: Review
 
Mining Frequent Patterns without Candidate Generation (SIGMOD2000)
TIDItems bough
100{
 f, a, c, d, g, i, m, p
}200{
a, b, c, f, l, m, o
}300{
b, f, h, j, o
}400{
b, c, k, s, p
}500{
a, f, c, e, l, p, m, n
}DB:Minimum support:
 =
3
I
nput:Output
:
all frequent patterns, i.e.,
 f, a, «, fa, fac, fam, fm,am«
 
 
Problem Statement: How to
efficiently
fi
nd all
f
requent patterns?

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->