{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:19Z","timestamp":1759335799525,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T00:00:00Z","timestamp":1502755200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"DOI":"10.1007\/s10489-017-1047-4","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T20:28:32Z","timestamp":1502742512000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["ETARM: an efficient top-k association rule mining algorithm"],"prefix":"10.1007","author":[{"given":"Linh T. T.","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-6462","authenticated-orcid":false,"given":"Loan T. T.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Selamat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,15]]},"reference":[{"key":"1047_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielminski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings ACM international conference on management of data. ACM Press, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"1047_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases, pp 487\u2013499"},{"issue":"5","key":"1047_CR3","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","volume":"17","author":"KT Chuang","year":"2008","unstructured":"Chuang KT, Huang JL, Chen MS (2008) Mining top-k frequent patterns in the presence of the memory constraint. VLDB J 17(5):1321\u20131344","journal-title":"VLDB J"},{"key":"1047_CR4","doi-asserted-by":"crossref","unstructured":"Deng Z, Fang G (2007) Mining top-rank-k frequent patterns. In: ICMLC\u201907, pp 851\u2013856","DOI":"10.1109\/ICMLC.2007.4370261"},{"issue":"4","key":"1047_CR5","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1016\/j.eswa.2013.08.075","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng ZH (2014) Fast mining top-rank-k frequent patterns by using node-lists. Expert Syst Appl 41(4):1763\u20131768","journal-title":"Expert Syst Appl"},{"issue":"13","key":"1047_CR6","doi-asserted-by":"crossref","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"ZH Deng","year":"2015","unstructured":"Deng ZH, Lv SL (2015) PrePost +: an efficient N-lists-based algorithm for mining frequent itemsets via children\u2013parent equivalence pruning. Expert Syst Appl 42(13):5424\u20135432","journal-title":"Expert Syst Appl"},{"key":"1047_CR7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"ZH Deng","year":"2016","unstructured":"Deng ZH (2016) DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"key":"1047_CR8","doi-asserted-by":"crossref","unstructured":"Fang G, Deng ZH (2008) VTK: vertical mining of top-rank-k frequent patterns. In: FSKD\u201908, pp 620\u2013624","DOI":"10.1109\/FSKD.2008.472"},{"key":"1047_CR9","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C-W, Tseng VS (2012) Mining top-k association rules. In: Proceedings of the 25th Canadian conference on artificial intelligence AI (2012). Springer, LNAI 7310, pp 61\u2013 73","DOI":"10.1007\/978-3-642-30353-1_6"},{"key":"1047_CR10","unstructured":"Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database. In: ICDE\u201999, pp 106\u2013115"},{"key":"1047_CR11","unstructured":"Han J, Pei H, Yin Y (2004) Mining frequent patterns without candidate generation. In: Proceedings ACM international conference on management of data (SIGMOD\u201900, Dallas, TX), vol 8(1). ACM Press, pp 53\u201387"},{"key":"1047_CR12","unstructured":"Han J, Wang J, Lu Y, Tzvetkov P (2002) Mining top-k frequent closed patterns without minimum support. In: ICDM\u201902, pp 211\u2013218"},{"issue":"1","key":"1047_CR13","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.eswa.2014.07.045","volume":"42","author":"Q Huynh-Thi-Le","year":"2015","unstructured":"Huynh-Thi-Le Q, Le T, Vo B, Le B (2015) An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst Appl 42(1):156\u2013164","journal-title":"Expert Syst Appl"},{"issue":"19","key":"1047_CR14","doi-asserted-by":"crossref","first-page":"6648","DOI":"10.1016\/j.eswa.2015.04.048","volume":"42","author":"T Le","year":"2015","unstructured":"Le T, Vo B (2015) An N-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42 (19):6648\u20136657","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1047_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1047_CR16","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.3233\/JIFS-169128","volume":"32","author":"LTT Nguyen","year":"2017","unstructured":"Nguyen LTT, Trinh T, Nguyen NT, Vo B (2017) A method for mining top-rank-k frequent closed itemsets. J Intell Fuzzy Syst 32(2):1297\u20131305","journal-title":"J Intell Fuzzy Syst"},{"issue":"1","key":"1047_CR17","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 (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1):25\u201346","journal-title":"Inf Syst"},{"key":"1047_CR18","unstructured":"Pietracaprina A, Vandin F (2004) Efficient incremental mining of top-k frequent closed itemsets. In: Tenth international conference discovery science. Springer, Berlin, pp 275\u2013280"},{"issue":"1","key":"1047_CR19","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s10489-013-0506-9","volume":"41","author":"G Pyun","year":"2014","unstructured":"Pyun G, Yun U (2014) Mining top-k frequent patterns with combination reducing techniques. Appl Intell 41(1):76\u201398","journal-title":"Appl Intell"},{"key":"1047_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.knosys.2013.10.013","volume":"55","author":"G Pyun","year":"2014","unstructured":"Pyun G, Yun U, Ryu KH (2014) Efficient frequent pattern mining base on linear prefix tree. Knowl-Based Syst 55:125\u2013139","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"1047_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10115-014-0732-4","volume":"43","author":"J Sahoo","year":"2015","unstructured":"Sahoo J, Das AK, Goswami A (2015) An effective association rule mining scheme using a new generic basis. Knowl Inf Syst 43(1):127\u2013156","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"1047_CR22","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10115-015-0907-7","volume":"48","author":"J Ashraf","year":"2016","unstructured":"Saif-Ur-Rehman, Ashraf J, Salam AHA (2016) Top-k miner: top-k identical frequent itemsets discovery without user support threshold. Knowl Inf Syst 48(3):741\u2013762","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"1047_CR23","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/s10115-004-0175-4","volume":"7","author":"P Tzvetkov","year":"2005","unstructured":"Tzvetkov P, Yan X, Han J (2005) TSP: mining top-k closed sequential patterns. Knowl Inf Syst 7 (4):438\u2013457","journal-title":"Knowl Inf Syst"},{"key":"1047_CR24","doi-asserted-by":"crossref","unstructured":"Vo B, Le B (2009) Mining traditional association rules using frequent itemsets lattice. In: International conference on computers & industrial engineering. IEEE Press, pp 1401\u20131406","DOI":"10.1109\/ICCIE.2009.5223866"},{"issue":"9","key":"1047_CR25","doi-asserted-by":"crossref","first-page":"11630","DOI":"10.1016\/j.eswa.2011.03.042","volume":"38","author":"B Vo","year":"2011","unstructured":"Vo B, Le B (2011) Interestingness measures for association rules: combination between lattice and hash tables. Expert Syst Appl 38(9):11630\u201311640","journal-title":"Expert Syst Appl"},{"issue":"8","key":"1047_CR26","doi-asserted-by":"crossref","first-page":"7196","DOI":"10.1016\/j.eswa.2012.01.062","volume":"39","author":"B Vo","year":"2012","unstructured":"Vo B, Hong TP, Le B (2012) DBV-miner: a dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst Appl 39(8):7196\u20137206","journal-title":"Expert Syst Appl"},{"key":"1047_CR27","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.knosys.2013.02.003","volume":"45","author":"B Vo","year":"2013","unstructured":"Vo B, Hong TP, Le B (2013) A lattice-based approach for mining most generalization association rules. Knowl-Based Syst 45:20\u201330","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"1047_CR28","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10618-005-0255-4","volume":"10","author":"GI Webb","year":"2005","unstructured":"Webb G I, Zhang S (2005) K-optimal rule discovery. Data Min Knowl Disc 10(1):39\u201379","journal-title":"Data Min Knowl Disc"},{"issue":"3","key":"1047_CR29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/widm.28","volume":"1","author":"GI Webb","year":"2011","unstructured":"Webb G I (2011) Filtered top-k association discovery. WIREs Data Min Knowl Discovery 1(3):183\u2013192","journal-title":"WIREs Data Min Knowl Discovery"},{"key":"1047_CR30","doi-asserted-by":"crossref","unstructured":"You Y, Zhang J, Yang Z, Liu G (2010) Mining top-k fault tolerant association rules by redundant pattern disambiguation in data streams. In: International conference intelligent computing and cognitive informatics. IEEE Press, pp 470\u2013473","DOI":"10.1109\/ICICCI.2010.91"},{"issue":"3","key":"1047_CR31","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki MJ (2004) Mining non-redundant association rules. Data Min Knowl Disc 9(3):223\u2013248","journal-title":"Data Min Knowl Disc"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1047-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-1047-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1047-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T20:29:02Z","timestamp":1502742542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-1047-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,15]]},"references-count":31,"alternative-id":["1047"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-1047-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2017,8,15]]}}}