Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining Association Rules between Sets of Items in Large Databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216.
Agrawal, R., & Srikant, R. (1994). Fast Algorithms for Mining Association Rules. Proceedings of the 20th International Conference on Very Large Data Bases, 487–499.
Bayardo, R. J. (1998). Efficiently Mining Long Patterns from Databases. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, 85–93.
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997). Dynamic Itemset Counting and Implication Rules for Market Basket Data. Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, 255–264.
Dorgo, G., & Abonyi, J. (2018). Sequence Mining Based Alarm Suppression. IEEE Access, 6.
Han, J., Pei, J., & Tong, H. (2022). Data Mining: Concepts and Techniques (4. kiad.). Morgan Kaufmann.
Han, J., Pei, J., & Yin, Y. (2000). Mining Frequent Patterns without Candidate Generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 1–12.
Park, J. S., Chen, M.-S., & Yu, P. S. (1995). An Effective Hash-Based Algorithm for Mining Association Rules. Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 175–186.
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering Frequent Closed Itemsets for Association Rules. Database Theory – ICDT’99, Lecture Notes in Computer Science, 1540, 398–416.
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2001). PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. Proceedings of the 17th International Conference on Data Engineering, 215–224.
Piatetsky-Shapiro, G. (1991). Discovery, Analysis, and Presentation of Strong Rules. In G. Piatetsky-Shapiro & W. J. Frawley (Szerk.), Knowledge Discovery in Databases (o. 229–248). AAAI/MIT Press.
Raschka, S. (2018). MLxtend: Providing machine learning and data science utilities and extensions to Python’s scientific computing stack. Journal of Open Source Software, 3(24), 638.
Srikant, R., & Agrawal, R. (1995). Mining Generalized Association Rules. Proceedings of the 21st International Conference on Very Large Data Bases, 407–419.
Srikant, R., & Agrawal, R. (1996a). Mining Quantitative Association Rules in Large Relational Tables. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1–12.
Srikant, R., & Agrawal, R. (1996b). Mining Sequential Patterns: Generalizations and Performance Improvements. Advances in Database Technology – EDBT’96, Lecture Notes in Computer Science, 1057, 3–17.
Tan, P.-N., Kumar, V., & Srivastava, J. (2004). Selecting the right objective measure for association analysis. Information Systems, 29(4), 293–313.
Wang, J., Yang, F., Chen, T., & Shah, S. L. (2016). An Overview of Industrial Alarm Systems: Main Causes for Alarm Overloading, Research Status, and Open Problems. IEEE Transactions on Automation Science and Engineering, 13(2), 1045–1061.
Zaki, M. J. (2000). Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390.