An efficient method for mining association rules based on minimum single constraints

Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press, Menlo Park (1996)

Anh, T., Hai, D., Tin, T., Bac, L.: Efficient algorithms for mining frequent itemsets with constraint. In: Proceedings of the Third International Conference on Knowledge and Systems Engineering, pp. 19–25 (2011)

Anh, T., Hai, D., Tin, T., Bac, L.: Mining frequent itemsets with dualistic constraints. In: Proceedings of PRICAI 2012, LNAI, vol. 7458 , pp. 807–813. Springer, Berlin (2012)

Anh, T., Tin, T., Bac, L.: Structures of association rule set. Lecture Notes in Artificial Intelligence, vol. 7197, pp. 361–370. Springer, Berlin (2012)

Anh, T., Tin, T., Bac, L.: An approach for mining concurrently closed itemsets and generators. Advanced computational methods for knowledge engineering, SCI, vol. 479, pp. 355–366. Springer, Berlin (2013)

Anon: http://www.cs.rpi.edu/~zaki/wwwnew/pmwiki.php/Software/Software#patutils (2010). Accessed 2010

Bayardo Jr, R.J.: Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 85–93. ACM, New York (1998)

Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Examiner: optimized level-wise frequent pattern mining with monotone constraints. In: Proceedings of IEEE ICDM’03, pp. 11–18 (2003)

Bonchi, F., Goethals, B.: FP-Bonsai: The Art of Growing and Pruning Small FP-Trees (2004)

Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Proceedings of IEEE ICDM’04 (2004)

Boulicaut, J.F., Bykowski, A.: Frequent closures as a concise representation for binary Data Mining. In: Proceedings of PAKDD’00, vol. 1805, pp. 62–73. Springer, Berlin (2000)

Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Discov 7, 5–22 (2003)

Burdick, D., Calimlim, M, Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of IEEE ICDE’01, pp. 443–452 (2001)

Elena, B., Luca, C., Tania, C., Paolo, G.: Generalized association rule mining with constraints. Inf. Sci. Int J. 68–84 (2012)

FIMDR, Frequent Itemset Mining Dataset Repository: http://fimi.cs.helsinki.fi/data/ (2009). Accessed 2009

Hai, D., Tin, T., Bac, L.: An efficient algorithm for mining frequent itemsets with single constraint. In: Advanced Computational Methods for Knowledge Engineering, SCI, vol. 479, pp. 367–378. Springer, Berlin (2013)

Hai, D., Tin, T., Bay, V.: An efficient method for mining frequent itemsets with double constraints. Int. J. Eng. Appl. Artif. Intell. (EAAI) 27, 148–154 (2014)

Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD’00, pp. 1–12 (2000)

Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov 8(1), 53–87 (2004)

Jeudy, B., Boulicaut, J.F.: Optimization of association rule mining queries. Intell. Data Anal. 6(4), 341–357 (2002)

Lee, A.J., Lin, W.C., Wang, C.S.: Mining association rule with multi-dimensional constraints. J. Syst. Softw. 79, 79–92 (2006)

Lin, D.I., Kedem, Z.M.: Pincer search: an efficient algorithm for discovering the maximum frequent sets. IEEE Trans Knowl. Data Eng. 14, 553–566 (2002)

Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov. 1, 241–258 (1997)

Mohamed, S.G., Amine, F.: Mining multi-level frequent itemsets under constraints. Int. J. Database Theory Appl. 3, 15–34 (2010)

Nguyen, R.T., Lakshmanan, V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained association rules. In: Proceedings of the 1998 ACM-SIG-MOD International Conference on the Management of Data, pp. 13–24 (1998)

Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattice. Inf. Syst. 24(1), 25–46 (1999)

Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. Intell. Inf. Syst. 24, 29–60 (2005)

Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: Proceedings of IEEE ICDE’01, pp. 433–442 (2001)

Russel, P., Sangeetha, K.: FGC: An efficient constraint based frequent set miner. In: Proceedings of IEEE, pp. 424–431 (2007)

Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceedings of KDD’97, pp. 67–73 (1997)

Szathmary, L., Valtchev, P., Napoli, A.: Efficient vertical mining of frequent closed itemsets and generators. IDA 2009, 393–404 (2009)

Uday Kiran, R., Krishna Reddy, P.: Towards Efficient Mining of Periodic-Frequent Patterns in Transactional Databases. Database Expert Syst. Appl. 6262, 194–208 (2010)

Varsha, M., Anju, S.: Efficient approach for extracting frequent pattern and association rules with periodic constraints. Int. J. Comput. Sci. Eng. Inf. Technol. Res. 3, 65–78 (2013)

Wille, R.: Concept lattices and conceptual knowledge systems. In: Computers and Mathematics with Applications, pp. 493–515 (1992)

Woon, Y.-K., W.-K. Ng, et al.: A support-ordered trie for fast frequent itemset discovery. IEEE Trans. Knowl. Data Eng. 16(7), 875–879 (2004)

Zaki, M.J.: Mining non-redundant association rules. Data Min. Knowl. Discov. 9(3), 223–248 (2004)

Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17, 462–478 (2005)