%0 Book Section %1 lakhal2005efficient %A Lakhal, Lotfi %A Stumme, Gerd %B Formal Concept Analysis %D 2005 %E Ganter, Bernhard %E Stumme, Gerd %E Wille, Rudolf %I Springer Berlin Heidelberg %K %P 180-195 %R 10.1007/11528784_10 %T Efficient Mining of Association Rules Based on Formal Concept Analysis %U http://dx.doi.org/10.1007/11528784_10 %V 3626 %X Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to %@ 978-3-540-27891-7

@incollection{lakhal2005efficient, abstract = {Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to }, added-at = {2023-12-14T16:15:11.000+0100}, author = {Lakhal, Lotfi and Stumme, Gerd}, biburl = {https://www.bibsonomy.org/bibtex/2fbb41ddbb0a52d1ecca438655e652f09/admin}, booktitle = {Formal Concept Analysis}, doi = {10.1007/11528784_10}, editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf}, interhash = {f5777a0f9dccfcf4f9968119d77297fc}, intrahash = {fbb41ddbb0a52d1ecca438655e652f09}, isbn = {978-3-540-27891-7}, keywords = {}, language = {English}, pages = {180-195}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-14T16:15:11.000+0100}, title = {Efficient Mining of Association Rules Based on Formal Concept Analysis}, url = {http://dx.doi.org/10.1007/11528784_10}, volume = 3626, year = 2005 }