Lecture

Association Rules: Mining and Analysis

Description

This lecture covers the concept of association rules in data mining, focusing on measures like confidence and lift, as well as techniques such as transaction reduction, sampling, and partitioning for efficient rule mining. The instructor explains the FP-growth algorithm and the construction of FP-trees, emphasizing the divide and conquer strategy for frequent itemset extraction. The lecture also delves into the derivation of conditional FP-trees and the performance comparison between FP-growth and Apriori algorithms.

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.

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.