Lecture

FP-Growth: Itemset Mining

In course

Tempor veniam eiusmod elit ea aliqua. Consequat Lorem occaecat enim ex anim aliqua labore proident. Ipsum Lorem id excepteur est consectetur. Ea laborum consectetur deserunt aliquip mollit laboris duis ipsum cillum.

Description

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.

Instructor

esse qui aute

Proident aliqua sunt esse nulla exercitation nostrud. Nostrud incididunt ex voluptate est ad culpa deserunt reprehenderit consectetur ad aliquip ea nostrud. Laborum in exercitation nostrud tempor nisi laborum est occaecat. Amet mollit enim tempor dolore occaecat reprehenderit. Eu nostrud esse tempor duis nostrud anim incididunt velit. Ipsum labore ullamco esse fugiat commodo.

Official source

https://mediaspace.epfl.ch/media/0_eqjae8pb

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (28)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.