{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T23:52:01Z","timestamp":1773359521648,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10489-020-02172-7","type":"journal-article","created":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T08:02:27Z","timestamp":1618128147000},"page":"7002-7023","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient algorithms for deriving complete frequent itemsets from frequent closed itemsets"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5656-015X","authenticated-orcid":false,"given":"Cheng-Wei","family":"Wu","sequence":"first","affiliation":[]},{"given":"JianTao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yun-Wei","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Chien-Yu","family":"Chuang","sequence":"additional","affiliation":[]},{"given":"Yu-Chee","family":"Tseng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,11]]},"reference":[{"key":"2172_CR1","unstructured":"Agrawal R, Srikant R, et al. (1994) Fast algorithms for mining association rules. In: Proc. 20th int. conf. very large data bases, VLDB, vol 1215. Citeseer, pp 487\u2013499"},{"key":"2172_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.eswa.2018.03.041","volume":"105","author":"N Aryabarzan","year":"2018","unstructured":"Aryabarzan N, Minaei-Bidgoli B, Teshnehlab M (2018) negfin: An efficient algorithm for fast mining frequent itemsets. Expert Systems with Applications 105:129\u2013143","journal-title":"Expert Systems with Applications"},{"key":"2172_CR3","doi-asserted-by":"crossref","unstructured":"Boulicaut JF, Bykowski A, Rigotti C (2000) Approximation of frequency queries by means of free-sets. In: European conference on principles of data mining and knowledge discovery. Springer, pp 75\u201385","DOI":"10.1007\/3-540-45372-5_8"},{"key":"2172_CR4","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: European conference on principles of data mining and knowledge discovery. Springer, pp 74\u201386","DOI":"10.1007\/3-540-45681-3_7"},{"key":"2172_CR5","doi-asserted-by":"publisher","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":"2172_CR6","unstructured":"El-Hajj M, Zaiane OR (2003) Cofi-tree mining: a new approach to pattern growth with reduced candidacy generation. In: Workshop on frequent itemset mining implementations (FIMI\u201903) in conjunction with IEEE-ICDM"},{"issue":"1","key":"2172_CR7","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu CW, Tseng VS, et al. (2014) Spmf: A java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"issue":"3","key":"2172_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda K, Zaki MJ (2005) Genmax: An efficient algorithm for mining maximal frequent itemsets. Data Min Knowl Disc 11(3):223\u2013242","journal-title":"Data Min Knowl Disc"},{"issue":"4","key":"2172_CR9","first-page":"409","volume":"4","author":"S Gupta","year":"2014","unstructured":"Gupta S, Mamtora R (2014) A survey on association rule mining in market basket analysis. Int J Inf Comput Technol 4(4):409\u2013414","journal-title":"Int J Inf Comput Technol"},{"issue":"2","key":"2172_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM sigmod record 29(2):1\u201312","journal-title":"ACM sigmod record"},{"key":"2172_CR11","doi-asserted-by":"crossref","unstructured":"Huang J, Lai YP, Lo C, Wu CW (2019) An efficient algorithm for deriving frequent itemsets from lossless condensed representation. In: International conference on industrial, engineering and other applications of applied intelligent systems. Springer, pp 216\u2013229","DOI":"10.1007\/978-3-030-22999-3_20"},{"issue":"1","key":"2172_CR12","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s10489-015-0750-2","volume":"45","author":"D Kim","year":"2016","unstructured":"Kim D, Yun U (2016) Efficient mining of high utility pattern with considering of rarity and length. Appl Intell 45(1):152\u2013173","journal-title":"Appl Intell"},{"issue":"1","key":"2172_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s10489-016-0890-z","volume":"47","author":"D Kim","year":"2017","unstructured":"Kim D, Yun U (2017) Efficient algorithm for mining high average-utility itemsets in incremental transaction databases. Appl Intell 47(1):114\u2013131","journal-title":"Appl Intell"},{"key":"2172_CR14","doi-asserted-by":"crossref","unstructured":"Le T, Vo B (2015) An n-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42(19):6648\u20136657","DOI":"10.1016\/j.eswa.2015.04.048"},{"key":"2172_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.future.2016.09.007","volume":"68","author":"G Lee","year":"2017","unstructured":"Lee G, Yun U (2017) A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives. Futur Gener Comput Syst 68:89\u2013110","journal-title":"Futur Gener Comput Syst"},{"issue":"06","key":"2172_CR16","doi-asserted-by":"publisher","first-page":"1650012","DOI":"10.1142\/S0218001416500129","volume":"30","author":"G Lee","year":"2016","unstructured":"Lee G, Yun U, Ryang H, Kim D (2016) Approximate maximal frequent pattern mining with weight conditions and error tolerance. Int J Pattern Recogn Artif Intell 30(06):1650012","journal-title":"Int J Pattern Recogn Artif Intell"},{"key":"2172_CR17","doi-asserted-by":"crossref","unstructured":"Liu J, Shang J, Wang C, Ren X, Han J (2015) Mining quality phrases from massive text corpora. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 1729\u20131744","DOI":"10.1145\/2723372.2751523"},{"issue":"1","key":"2172_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2005","unstructured":"Lucchese C, Orlando S, Perego R (2005) 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":"2172_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/568271.223813","volume":"24","author":"JS Park","year":"1995","unstructured":"Park JS, Chen MS, Yu PS (1995) An effective hash-based algorithm for mining association rules. Acm sigmod record 24(2):175\u2013186","journal-title":"Acm sigmod record"},{"key":"2172_CR20","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: International conference on database theory. Springer, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"2172_CR21","doi-asserted-by":"publisher","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":"2172_CR22","unstructured":"Pei J, Han J, Lu H, Nishio S, Tang S, Yang D (2001) H-mine: Hyper-structure mining of frequent patterns in large databases. In: Proceedings 2001 IEEE international conference on data mining. IEEE, pp 441\u2013448"},{"key":"2172_CR23","doi-asserted-by":"crossref","unstructured":"Prabha S, Shanmugapriya S, Duraiswamy K (2013) A survey on closed frequent pattern mining. Int J Comput Appl 63(14)","DOI":"10.5120\/10538-5532"},{"issue":"2","key":"2172_CR24","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10115-016-0989-x","volume":"51","author":"H Ryang","year":"2017","unstructured":"Ryang H, Yun U (2017) Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl Inf Syst 51(2):627\u2013659","journal-title":"Knowl Inf Syst"},{"issue":"03","key":"2172_CR25","doi-asserted-by":"publisher","first-page":"150","DOI":"10.4236\/jsea.2009.23022","volume":"2","author":"S Ting","year":"2009","unstructured":"Ting S, Shum C, Kwok SK, Tsang AH, Lee WB, et al. (2009) Data mining in biomedicine: Current applications and further directions for research. J Softw Eng Appl 2(03):150","journal-title":"J Softw Eng Appl"},{"key":"2172_CR26","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) Closet+ searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 236\u2013245","DOI":"10.1145\/956750.956779"},{"issue":"9","key":"2172_CR27","doi-asserted-by":"publisher","first-page":"7239","DOI":"10.1109\/TIE.2017.2682782","volume":"64","author":"U Yun","year":"2017","unstructured":"Yun U, Lee G, Yoon E (2017) Efficient high utility pattern mining for establishing manufacturing plans with sliding window control. IEEE Trans Ind Electron 64(9):7239\u20137249","journal-title":"IEEE Trans Ind Electron"},{"key":"2172_CR28","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.03.016","volume":"124","author":"U Yun","year":"2017","unstructured":"Yun U, Ryang H, Lee G, Fujita H (2017) An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl-Based Syst 124:188\u2013206","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"2172_CR29","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12 (3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2172_CR30","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao CJ (2002) Charm: An efficient algorithm for closed itemset mining. In: Proceedings of the 2002 SIAM international conference on data mining. SIAM, pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"},{"issue":"04","key":"2172_CR31","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1142\/S0219622008003150","volume":"7","author":"Q Zhang","year":"2008","unstructured":"Zhang Q, Segall RS (2008) Web mining: A survey of current research, techniques, and software. Int J Inf Technol Decision Making 7(04):683\u2013720","journal-title":"Int J Inf Technol Decision Making"},{"key":"2172_CR32","unstructured":"Source code of the implemented dfi-growth algorithm released in spmf. http:\/\/www.philippe-fournier-viger.com\/spmf\/DFI-Growth.php"},{"key":"2172_CR33","unstructured":"Source code of the implemented dfi-list algorithm released in spmf. http:\/\/www.philippe-fournier-viger.com\/spmf\/DFI-List.php"},{"key":"2172_CR34","unstructured":"Source code of the implemented levelwise algorithm released in spmf. http:\/\/www.philippe-fournier-viger.com\/spmf\/LevelWise.php"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02172-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-02172-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02172-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T04:11:21Z","timestamp":1649823081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-02172-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,11]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["2172"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-02172-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,11]]},"assertion":[{"value":"22 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}