Lecture

Association Rules Mining

In course

Pariatur magna cillum labore officia labore duis esse non exercitation minim est officia dolor. Qui aliquip amet aliquip veniam labore quis pariatur. Esse aute pariatur ut nisi aute ut dolor non commodo.

Description

This lecture covers the concepts and algorithms for association rules mining, focusing on the Apriori algorithm and the FP-growth algorithm. It explains the process of finding frequent itemsets, building FP-trees, and extracting association rules. The lecture also discusses alternative measures of interest and strategies to improve mining efficiency for large datasets.

Instructor

officia deserunt ipsum nulla

Ut culpa dolore voluptate Lorem aliqua aliquip laborum minim ullamco est nostrud ipsum do. Dolore amet sunt sint non esse magna. Duis tempor qui elit ut in nulla.

Official source

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

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.

Ontological neighbourhood

Information engineering

Data science: Topics in data science

Related lectures (37)

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.