{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:55:47Z","timestamp":1750308947509,"version":"3.41.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:00:00Z","timestamp":1496188800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Dalat"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vietnam J Comput Sci"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s40595-017-0096-2","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T06:04:57Z","timestamp":1496210697000},"page":"261-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficiently mining association rules based on maximum single constraints"],"prefix":"10.1007","volume":"4","author":[{"given":"Anh","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tin","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"96_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487\u2013499 (1994)"},{"key":"96_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, N.: Mining association rules between sets of items in large datasets. In: Proceedings of the 1993 ACM SIGMOID, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"96_CR3","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, AAAI Press, pp. 307\u2013328 (1996)"},{"key":"96_CR4","doi-asserted-by":"crossref","unstructured":"Anh, T., Hai, D., Tin, T., Bac, L.: Efficient algorithms for mining frequent itemsets with constraint. In: Proceedings of the 3rd International Conference on Knowledge and Systems Engineering, pp. 19\u201325 (2011)","DOI":"10.1109\/KSE.2011.12"},{"key":"96_CR5","doi-asserted-by":"crossref","unstructured":"Anh, T., Hai, D., Tin, T., Bac, L.: Mining frequent itemsets with dualistic constraints. In: PRICAI 2012, LNAI, vol. 7458, pp. 807\u2013813. Springer (2012)","DOI":"10.1007\/978-3-642-32695-0_77"},{"key":"96_CR6","unstructured":"Anh, T., Tin, T., Bac, L., Hai, D.: Mining Association Rules Restricted on Constraint. In Proceedings of the IEEE-RIVF International Conference on Computing and Communication Technologies 2012, pp. 51\u201356 (2012)"},{"key":"96_CR7","doi-asserted-by":"crossref","unstructured":"Anh T., Tin T., Bac L.: Structures of association rule set. In: LNAI, vol. 7197, Part II, pp. 361\u2013370. Springer (2012)","DOI":"10.1007\/978-3-642-28490-8_38"},{"key":"96_CR8","doi-asserted-by":"crossref","unstructured":"Anh T., Tin T., Bac L.: An approach for mining concurrently closed itemsets and generators. In: Advanced Computational Methods for Knowledge Engineering, SCI, vol. 479, pp. 355\u2013366. Springer (2013)","DOI":"10.1007\/978-3-319-00293-4_27"},{"key":"96_CR9","first-page":"351","volume":"245","author":"T Anh","year":"2013","unstructured":"Anh, T., Tin, T., Bac, L.: An approach for mining association rules intersected with constraint itemsets. Adv. Intell. Syst. Comput. 245, 351\u2013363 (2013b)","journal-title":"Adv. Intell. Syst. Comput."},{"key":"96_CR10","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. Jr.: Efficiently mining long patterns from databases. In: Proceedings of the ACM-SIGMOD 1998 International Conference on Management of Data, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"key":"96_CR11","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: Proceedings of 2001 ICDE, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"96_CR12","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. In: Data Mining and Knowledge Discovery, vol. 4, no. (2\/3), pp. 217\u2013240. Kluwer Academic Pub. (2000)","DOI":"10.1023\/A:1009895914772"},{"key":"96_CR13","unstructured":"Cong, G., Liu, B.: Speed-up iterative frequent itemset mining with constraint changes. In: Proceedings of ICDM 2002, pp. 107\u2013114 (2002)"},{"key":"96_CR14","doi-asserted-by":"crossref","unstructured":"Cristofor, L., Simovici, D.: Generating an informative cover for association rules. In: Proceedings of the IEEE International Conference on Data Mining 2002, pp. 597\u2013600 (2002)","DOI":"10.1109\/ICDM.2002.1184007"},{"key":"96_CR15","doi-asserted-by":"crossref","unstructured":"Das, A., Ng, W.-K., Woon, Y.-K.: Rapid association rule mining. In: Proceedings of 10th International conference on Information and knowledge management, pp. 474\u2013481. ACM Press (2001)","DOI":"10.1145\/502585.502665"},{"key":"96_CR16","volume-title":"Formal concept analysis: mathematical foundations","author":"B Ganter","year":"1997","unstructured":"Ganter, B., Wille, R., Franzke, C.: Formal concept analysis: mathematical foundations. Springer, New York (1997)"},{"key":"96_CR17","unstructured":"Grahne, G., Zhu, J.: High performance mining of maximal frequent itemsets. In: Proceedings of SIAM 2003 Workshop on High Performance Data Mining: Pervasive and Data Stream Mining (2003)"},{"key":"96_CR18","doi-asserted-by":"crossref","unstructured":"Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations. In: Report on FIMI 2003, ACM SIGKDD Explorations Newsletter, vol. 6, no. 1, pp. 109\u2013117 (2004)","DOI":"10.1145\/1007730.1007744"},{"issue":"3","key":"96_CR19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda, K., Zaki, M.J.: Genmax: an effcient algorithm for mining maximal frequent itemsets. Data Min. Knowl. Discov. 11(3), 223\u2013242 (2005)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"96_CR20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"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\u201387 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"96_CR21","first-page":"148","volume":"27","author":"D Hai","year":"2013","unstructured":"Hai, D., Tin, T., Bay, V.: An efficient method for mining frequent itemsets with double constraints. Int. J. Eng. Appl. Artif. Intell. 27, 148\u2013154 (2013)","journal-title":"Int. J. Eng. Appl. Artif. Intell."},{"issue":"2","key":"96_CR22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s40595-014-0032-7","volume":"2","author":"D Hai","year":"2015","unstructured":"Hai, D., Tin, T.: An efficient method for mining association rules based on minimum single constraints. Vietnam J. Comput. Sci. 2(2), 67\u201383 (2015)","journal-title":"Vietnam J. Comput. Sci."},{"key":"96_CR23","unstructured":"Ho, B.: An approach to concept formation based on formal concept analysis. IEICE Trans. Inf. Syst. E78\u2013D(5), 553\u2013579 (1995)"},{"key":"96_CR24","doi-asserted-by":"crossref","unstructured":"Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding interesting rules from large sets of discovered association rules. In: Proceeding of the 3rd CIKM Conference, pp. 401\u2013407 (1994)","DOI":"10.1145\/191246.191314"},{"key":"96_CR25","doi-asserted-by":"crossref","unstructured":"Li, G., Hamilton, H.J.: Basic association rules. In: Proceedings of the 4th SIAM International Conference on Data Mining, pp. 166\u2013177 (2004)","DOI":"10.1137\/1.9781611972740.16"},{"issue":"1","key":"96_CR26","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jss.2005.03.005","volume":"79","author":"AJ Lee","year":"2006","unstructured":"Lee, A.J., Lin, W.C., Wang, C.S.: Mining association rule with multi-dimensional constraints. J. Syst. Softw. 79(1), 79\u201392 (2006)","journal-title":"J. Syst. Softw."},{"key":"96_CR27","unstructured":"Mannila, H., Toivonen, H., Verkamo, I.A.: Efficient algorithms for discovering association rules. In: Workshop on Knowledge Discovery in Databases 1994, pp. 181\u2013192 (1994)"},{"key":"96_CR28","doi-asserted-by":"crossref","unstructured":"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\u201324 (1998)","DOI":"10.1145\/276304.276307"},{"key":"96_CR29","volume-title":"Data mining and knowledge discovery Handbook","author":"M Oded","year":"2010","unstructured":"Oded, M., Lior, R.: Data mining and knowledge discovery Handbook. Springer, New York (2010)"},{"key":"96_CR30","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash based algorithm for mining association rules. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"issue":"1","key":"96_CR31","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattice. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"issue":"1","key":"96_CR32","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N Pasquier","year":"2005","unstructured":"Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. Intell. Inf. Syst. 24(1), 29\u201360 (2005)","journal-title":"J. Intell. Inf. Syst."},{"issue":"3","key":"96_CR33","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/B:DAMI.0000023674.74932.4c","volume":"8","author":"J Pei","year":"2004","unstructured":"Pei, J., Han, J., Lakshmanan, V.S.: Pushing convertible constraints in frequent itemset mining. Data Min. Knowl. Discov. 8(3), 227\u2013252 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"96_CR34","doi-asserted-by":"crossref","unstructured":"Szathmary, L., Valtchev, P., Napoli, A.: Efficient vertical mining of frequent closed itemsets and generators. In: Proceedigns of IDA 2009, pp. 393\u2013404 (2009)","DOI":"10.1007\/978-3-642-03915-7_34"},{"key":"96_CR35","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceedings of KDD 1997, pp. 67\u201373 (1997)"},{"key":"96_CR36","doi-asserted-by":"crossref","unstructured":"Tin, T., Anh, T.: Structure of set of association rules based on concept lattice. In: Advances in Intelligent Information and Database Systems, SCI, vol. 283, pp. 217\u2013227. Springer (2010)","DOI":"10.1007\/978-3-642-12090-9_19"},{"key":"96_CR37","unstructured":"Tin, T., Anh, T., Thong, T.: Structure of association rule set based on min-min basic rules. In: Proceedings of the International Conference on Computing and Communication Technologies 2010, pp. 83\u201388 (2010)"},{"issue":"6\u20139","key":"96_CR38","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0898-1221(92)90120-7","volume":"23","author":"R Wille","year":"1992","unstructured":"Wille, R.: Concept lattices and conceptual knowledge systems. Comput. Math. Appl. 23(6\u20139), 493\u2013515 (1992)","journal-title":"Comput. Math. Appl."},{"key":"96_CR39","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"96_CR40","doi-asserted-by":"crossref","unstructured":"Zaki, M. J., Gouda, K.: Fast vertical mining using diffsets. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge discovery and Data Mining, pp. 326\u2013335. ACM (2003)","DOI":"10.1145\/956750.956788"},{"issue":"3","key":"96_CR41","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Min. Knowl. Discov. 9(3), 223\u2013248 (2004)","journal-title":"Data Min. Knowl. Discov."},{"issue":"4","key":"96_CR42","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17(4), 462\u2013478 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Vietnam Journal of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40595-017-0096-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40595-017-0096-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40595-017-0096-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:37:14Z","timestamp":1750282634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40595-017-0096-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,31]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["96"],"URL":"https:\/\/doi.org\/10.1007\/s40595-017-0096-2","relation":{},"ISSN":["2196-8888","2196-8896"],"issn-type":[{"type":"print","value":"2196-8888"},{"type":"electronic","value":"2196-8896"}],"subject":[],"published":{"date-parts":[[2017,5,31]]}}}