User:Salavat.nabi/Frequent item set mining
 | This is not a Wikipedia article: It is one user's draft page that he or she is working on. It may be incomplete and/or unreliable. This page was last edited by Salavat.nabi (talk | contribs) 10 years ago. |
Frequent item set mining is an generation of frequent item sets.
For enumeration of all possible item sets can be used a lattice structure. In figure shown lattice structure which contains items I={a,b,c,d,e}. If say in general, data set that contains k items can potentially generate up to 2k-1 frequent itemsets, excluding the null set.[1].
-
Caption1 -
Caption2
References[change | change source]
- ↑ P-H. Tan, M. Steinbach, V. Kumar 2006 Introduction to Data Mining (Chapter 6) ISBN-10: 0321321367 • ISBN-13: 9780321321367