2013 | OriginalPaper | Buchkapitel
Association Rule Mining III: Frequent Pattern Trees
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This chapter introduces the
FP-growth
algorithm for extracting frequent itemsets from a database of transactions. First the database is processed to produce a data structure called a
FP-tree
, then the tree is processed recursively by constructing a sequence of reduced trees known as
conditional FP-trees
, from which the frequent itemsets are extracted. The algorithm has the very desirable feature of requiring only two scans through the database.