Data Mining

How does the FP-Growth algorithm achieve compact representation of transactional data? Explain the data structure used by the algorithm, including the initial order in which items within transactions are required to be sorted. Does frequent itemset generation follow a prefix-based or suffix-based traversal of the data structure? Does the traversal occur top-down or bottom-up