Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the FP-Growth algorithm for mining frequent itemsets in transaction datasets. It explains the FP-Tree construction, frequent itemset extraction, divide and conquer strategy, conditional FP-Tree derivation, and performance comparison with Apriori. The instructor discusses the advantages of FP-Growth, such as dataset compression and efficiency, along with its limitations for high support thresholds and memory requirements.