Editing Association rule learning (section)

==History==
The concept of association rules was popularized particularly due to the 1993 article of Agrawal et al.,<ref name="mining" /> which has acquired more than 23,790 citations according to Google Scholar, as of April 2021, and is thus one of the most cited papers in the Data Mining field. However, what is now called "association rules" is introduced already in the 1966 paper<ref name="guha_oldest">{{cite journal |doi=10.1007/BF02345483 |title=The GUHA method of automatic hypotheses determination |journal=Computing |volume=1 |issue=4 |pages=293–308 |year=1966 |last1=Hájek |first1=P. |last2=Havel |first2=I. |last3=Chytil |first3=M. |s2cid=10511114 }}</ref> on GUHA, a general data mining method developed by [[Petr Hájek]] et al.<ref name="pospaper">{{cite book |doi=10.1007/978-3-540-44497-8_7 |chapter=The GUHA Method, Data Preprocessing and Mining |title=Database Support for Data Mining Applications |volume=2682 |pages=135–153 |series=Lecture Notes in Computer Science |year=2004 |last1=Hájek |first1=Petr |last2=Rauch |first2=Jan |last3=Coufal |first3=David |last4=Feglar |first4=Tomáš |isbn=978-3-540-22479-2 }}</ref>

An early (circa 1989) use of minimum support and confidence to find all association rules is the Feature Based Modeling framework, which found all rules with <math>\mathrm{supp}(X)</math> and <math>\mathrm{conf}(X \Rightarrow Y)</math> greater than user defined constraints.<ref>{{cite journal|last1=Webb|first1=Geoffrey|title=A Machine Learning Approach to Student Modelling|journal=Proceedings of the Third Australian Joint Conference on Artificial Intelligence (AI 89)|date=1989|pages=195–205}}</ref>