Abstract
Frequent patterns can be used to characterize a given set of examples: they are the most typical feature combinations in the data. Frequent patterns are often used as components in larger data mining or machine learning tasks. The discovery of frequent itemsets was actually first introduced as an intermediate step in association rule mining. The concept of frequent patterns is more general, however, and covers more complex patterns and data, such as frequent sequences, trees, graphs, and first-order logic.
This is a preview of subscription content, log in via an institution to check access.
References
Agrawal R, Imielinski T (1993) Swami A: mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data, Washington, DC. ACM, New York, pp 207–216
Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo (1996) AI: fast discovery of association rules. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (eds) Advances in knowledge discovery and data mining. AVAAI Press, Menlo Park, pp 307–328
Bayardo RJ Jr (1998) Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, Seatle, Washington, DC. ACM, New York, pp 85–93
Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Proceedings of the 6th European conference on principles of data mining and knowledge discovery, Helsinki. Lecture Notes in Computer Science, vol 2431. Springer, London, pp 74–85
Ceglar A, Roddick JF (2006) Association mining. ACM Comput Surv 38(2):5
Dehaspe L, Toivonen H (1999) Discovery of frequent datalog patterns. Data Min Knowl Discov 3(1):7–36
Gunopulos D, Khardon R, Mannila H, Saluja S, Toivonen H, Sharma RS (2003) Discovering all most specific sentences. ACM Trans Database Syst 28(2):140–174
Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53–87
Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Min Knowl Discov 1(3):241–258
Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of 7th international conference on database theory, Jerusalem. Lecture notes in computer science, vol 1540. Springer, London, pp 398–416
Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372–390
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Toivonen, H. (2023). Frequent Pattern. In: Phung, D., Webb, G.I., Sammut, C. (eds) Encyclopedia of Machine Learning and Data Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7502-7_106-1
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7502-7_106-1
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4899-7502-7
Online ISBN: 978-1-4899-7502-7
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering