tailieunhanh - Lecture Data mining and analysis: Fundamental concepts and algorithms: Chapter 9 - Mohammed J. Zaki, Wagner Meira

Chapter 9 - Summarizing itemsets. The search space for frequent itemsets is usually very large and it grows exponentially with the number of items. In particular, a low minimum support value may result in an intractable number of frequent itemsets. An alternative approach, studied in this chapter, is to determine condensed representations of the frequent itemsets that summarize their essential characteristics. |

TỪ KHÓA LIÊN QUAN