All set of items whose support is greater than the user-specified minimum support are called as_____________

Related Questions

• Certain itemsets in the dashed circle whose support count reach support value during an iteration move into the______________
• If a set is a frequent set and no superset of this set is a frequent set, then it is called____________
• The value that says that transactions in D that support X also support Y is called__________.
• Any subset of a frequent set is a frequent set. This is_________
• Any superset of an infrequent set is an infrequent set. This is ___________
• If an itemset is not a frequent set and no superset of this is a frequent set, then it is
• The_______algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets
• __________ is a subject-oriented, integrated, time-variant, nonvolatile collection of data in support of management decisions.
• If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. Then the support of bread and jam is_________.
• The step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, from being considered for counting support.