Synonyms
AFI
Definition
Consider an n × m binary matrix D. Each row of D corresponds to a transaction t and each column of D corresponds to an item i. The (t, i)-element of D, denoted D(t, i), is 1 if transaction t contains item i, and 0 otherwise. Let T0 = {t1, t2,…,tn} and I0 = {i1, i2,…,im} be the set of transactions and items associated with D, respectively.
Let D be as above, and let εr, εc ∈ [0, 1]. An itemset I ⊆ I0 is an approximate frequent itemset AFI(εr, εc), if there exists a set of transactions T ⊆ T0 with | T | ≥ minsup | T0 | such that the following two conditions hold:
- 1.
\( \forall i\in T,\frac{1}{\mid I\mid}\sum_{j\in I}D\left(i,j\right)\ge \left(1-{\upepsilon}_r\right); \)
- 2.
\( \forall j\in I,\frac{1}{\mid T\mid}\sum_{i\in T}D\left(i,j\right)\ge \left(1-{\upepsilon}_c\right); \)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1993. p. 207–16.
Creighton C, Hanash S. Mining gene expression databases for association rules. Bioinformatics. 2003;19(1):79–86.
Yang C, Fayyad U, Bradley PS. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2001. p. 194–203.
Liu J, Paulsen S, Wang W, Nobel A, Prins J. Mining approximate frequent itemset from noisy data. In: Proceedings of the 5th IEEE International Conference on Data Mining; 2005. p. 721–4.
Seppanen JK, Mannila H. Dense itemsets. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery, and Data Mining; 2004. p. 683–8.
Liu J, Paulsen S, Sun X, Wang W, Nobel A, Prins J. Mining Approximate frequent itemset in the presence of noise: algorithm and analysis. In: Proceedings of the SIAM International Conference on Data Mining; 2006. p. 405–11.
Pei J, Tung AK, Han J. Fault-tolerant frequent pattern mining: problems and challenges. In: Proceedings of the Workshop on Research Issues in Data Mining and Knowledge Discovery; 2001.
UCI machine learning repository. http://www.ics.uci.edu/mlearn/MLSummary.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Liu, J. (2018). Approximation of Frequent Itemsets. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_22
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_22
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering