Skip to content

Conversation

@yeonsssu26
Copy link

original code is written on python 2.x
so, I upgrade it to python 3.x

assumption holds true, this tree produces a compact representation of the actual
transactions and is used to generate itemsets much faster than *Apriori* can.
## concept
Association Rule (연관규칙)을 적용하기 위해서는 각 item들이 각itemset에서 어떤 빈도로 나타났고, 어떤 item과 함께 나왔는지 세는 것이 필수이다. 하지만 데이터셋이 큰 경우, 이를 모든 후보 itemset들에 대해서 하나하나 검사하는 것은 굉장히 비효율적이다. 이러한 문제를 해결하기 위해 제시된 것이 FP-growth algorithm이다.
Copy link

@daavve daavve Oct 13, 2022

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Recommend we either retain old English explanation or add a section in English translated from the Korean above.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants