{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:19:10Z","timestamp":1725902350190},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319619101"},{"type":"electronic","value":"9783319619118"}],"license":[{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-61911-8_11","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T03:52:40Z","timestamp":1498535560000},"page":"117-128","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Algorithm for Mining Top-k Association Rules"],"prefix":"10.1007","author":[{"given":"Linh T. T.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loan T. T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielminski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings ACM International Conference on Management of Data, pp. 207\u2013216. ACM Press (1993)","key":"11_CR1","DOI":"10.1145\/170035.170072"},{"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":"11_CR2"},{"doi-asserted-by":"crossref","unstructured":"Deng, Z., Fang, G.: Mining top-rank-k frequent patterns. In: ICMLC 2007, pp. 851\u2013856 (2007)","key":"11_CR3","DOI":"10.1109\/ICMLC.2007.4370261"},{"issue":"4","key":"11_CR4","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1016\/j.eswa.2013.08.075","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng, Z.H.: Fast mining top-rank-k frequent patterns by using node-lists. Expert Syst. Appl. 41(4), 1763\u20131768 (2014)","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Fang, G., Deng, Z.H.: VTK: vertical mining of top-rank-k frequent patterns. In: FSKD 2008, pp. 620\u2013624 (2008)","key":"11_CR5","DOI":"10.1109\/FSKD.2008.472"},{"doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Wu, C.-W., Tseng, V.S.: Mining top-k association rules. In: Proceedings of the 25th Canadian Conference on Artificial Intelligence (AI 2012). LNAI, vol. 7310, pp. 61\u201373. Springer, Heidelberg (2012)","key":"11_CR6","DOI":"10.1007\/978-3-642-30353-1_6"},{"issue":"1","key":"11_CR7","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, H., Yin, Y.: Mining frequent patterns without candidate generation. Data Min. Knowl. Disc. 8(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Disc."},{"issue":"1","key":"11_CR8","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.: An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst. Appl. 42(1), 156\u2013164 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"19","key":"11_CR9","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.: An N-list-based algorithm for mining frequent closed patterns. Expert Syst. Appl. 42(19), 6648\u20136657 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"11_CR10","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.3233\/JIFS-169128","volume":"32","author":"LTT Nguyen","year":"2017","unstructured":"Nguyen, L.T.T., Trinh, T., Nguyen, N.T., Vo, B.: A method for mining top-rank-k frequent closed itemsets. J. Intell. Fuzzy Syst. 32(2), 1297\u20131305 (2017)","journal-title":"J. Intell. Fuzzy Syst."},{"issue":"1","key":"11_CR11","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 lattices. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Pietracaprina, A., Vandin, F.: Efficient incremental mining of top-k frequent closed itemsets. In: Tenth International Conference Discovery Science, pp. 275\u2013280. Springer, Heidelberg (2004)","key":"11_CR12","DOI":"10.1007\/978-3-540-75488-6_29"},{"issue":"1","key":"11_CR13","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, A.K., Goswami, A.: An effective association rule mining scheme using a new generic basis. Knowl. Inf. Syst. 43(1), 127\u2013156 (2015)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"11_CR14","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10115-015-0907-7","volume":"48","author":"J Saif-Ur-Rehman","year":"2016","unstructured":"Saif-Ur-Rehman, J., Ashraf, J., Habib, A., Salam, A.: Top-k miner: top-k identical frequent itemsets discovery without user support threshold. Knowl. Inf. Syst. 48(3), 741\u2013762 (2016)","journal-title":"Knowl. Inf. Syst."},{"issue":"4","key":"11_CR15","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.: TSP: mining top-k closed sequential patterns. Knowl. Inf. Syst. 7(4), 438\u2013457 (2005)","journal-title":"Knowl. Inf. Syst."},{"issue":"8","key":"11_CR16","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, T.P., Le, B.: DBV-miner: a dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst. Appl. 39(8), 7196\u20137206 (2012)","journal-title":"Expert Syst. Appl."},{"key":"11_CR17","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, T.P., Le, B.: A lattice-based approach for mining most generalization association rules. Knowl.-Based Syst. 45, 20\u201330 (2013)","journal-title":"Knowl.-Based Syst."},{"doi-asserted-by":"crossref","unstructured":"Vo, B., Le, B.: Mining traditional association rules using frequent itemsets lattice. In: International Conference on Computers and Industrial Engineering, pp. 1401\u20131406. IEEE Press (2009)","key":"11_CR18","DOI":"10.1109\/ICCIE.2009.5223866"},{"issue":"9","key":"11_CR19","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.: Interestingness measures for association rules: combination between lattice and hash tables. Expert Syst. Appl. 38(9), 11630\u201311640 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"11_CR20","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.: K-optimal rule discovery. Data Min. Knowl. Disc. 10(1), 39\u201379 (2005)","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"11_CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/widm.28","volume":"1","author":"GI Webb","year":"2011","unstructured":"Webb, G.I.: Filtered top-k association discovery. WIREs Data Mining Knowl. Discov. 1(3), 183\u2013192 (2011)","journal-title":"WIREs Data Mining Knowl. Discov."},{"doi-asserted-by":"crossref","unstructured":"You, Y., Zhang, J., Yang, Z., Liu, G.: Mining top-k fault tolerant association rules by redundant pattern disambiguation in data streams. In: International Conference Intelligent Computing and Cognitive Informatics, pp. 470\u2013473. IEEE Press (2010)","key":"11_CR22","DOI":"10.1109\/ICICCI.2010.91"},{"issue":"3","key":"11_CR23","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. Disc. 9(3), 223\u2013248 (2004)","journal-title":"Data Min. Knowl. Disc."}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61911-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:22:49Z","timestamp":1569547369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61911-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,28]]},"ISBN":["9783319619101","9783319619118"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61911-8_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,6,28]]}}}