{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T05:19:16Z","timestamp":1769231956764,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,28]],"date-time":"2016-01-28T00:00:00Z","timestamp":1453939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61133005, 61432005, 61370095, 61472124, 61202109, 61472126"],"award-info":[{"award-number":["61133005, 61432005, 61370095, 61472124, 61202109, 61472126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Science & Technology Cooperation Program of China","award":["2015DFA11240"],"award-info":[{"award-number":["2015DFA11240"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10489-015-0748-9","type":"journal-article","created":{"date-parts":[[2016,1,28]],"date-time":"2016-01-28T02:19:46Z","timestamp":1453947586000},"page":"96-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["An efficient algorithm for mining top-rank-k frequent patterns"],"prefix":"10.1007","volume":"45","author":[{"given":"Thu-Lan","family":"Dam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang-Huy","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,28]]},"reference":[{"issue":"2","key":"748_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD RECORD 22(2):207\u2013216","journal-title":"SIGMOD RECORD"},{"key":"748_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. VLDB:487\u2013499"},{"issue":"11","key":"748_CR3","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flannick J, Gehrke J, Yiu TM (2005) MAFIA: A maximal frequent itemset algorithm. IEEE Transactions on Knowledge and Data Engineering 17(11):1490\u20131504","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"748_CR4","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1002\/int.21580","volume":"28","author":"Z Deng","year":"2013","unstructured":"Deng Z (2013) Mining top-rank-k erasable itemsets by PID_lists. International Journal of Intelligent Systems 28(4):366\u2013379","journal-title":"International Journal of Intelligent Systems"},{"issue":"6","key":"748_CR5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1080\/18756891.2010.9727736","volume":"3","author":"Z Deng","year":"2010","unstructured":"Deng Z, Wang Z (2010) A new fast vertical method for mining frequent patterns. International Journal of Computational Intelligence Systems 3(6):733\u2013744","journal-title":"International Journal of Computational Intelligence Systems"},{"issue":"4","key":"748_CR6","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 Systems with Applications 41(4):1763\u20131768","journal-title":"Expert Systems with Applications"},{"key":"748_CR7","doi-asserted-by":"crossref","unstructured":"Deng ZH, Fang GD (2007) Mining top-rank-k frequent patterns","DOI":"10.1109\/ICMLC.2007.4370261"},{"issue":"10","key":"748_CR8","doi-asserted-by":"crossref","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng ZH, Lv SL (2014) Fast mining frequent itemsets using Nodesets. Expert Systems with Applications 41(10):4505\u20134512","journal-title":"Expert Systems with Applications"},{"issue":"13","key":"748_CR9","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? Parent Equivalence pruning. Expert Systems with Applications 42(13):5424\u20135432","journal-title":"Expert Systems with Applications"},{"issue":"9","key":"748_CR10","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"ZH Deng","year":"2012","unstructured":"Deng ZH, Wang ZH, Jiang JJ (2012) A new algorithm for fast mining frequent itemsets using N-lists. Science China Information Sciences 55(9):2008\u20132030","journal-title":"Science China Information Sciences"},{"key":"748_CR11","doi-asserted-by":"crossref","unstructured":"Fang GD, Deng ZH (2008) VTK: Vertical Mining of Top-Rank-K Frequent Patterns. Fifth International Conference on Fuzzy Systems and Knowledge Discovery, Vol 2. Proceedings","DOI":"10.1109\/FSKD.2008.472"},{"key":"748_CR12","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gueniche T, Barhate P (2015) Efficient incremental high utility itemset mining","DOI":"10.1145\/2851613.2851884"},{"key":"748_CR13","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng V (2014) FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"748_CR14","first-page":"857","volume-title":"FOSHU: Faster On-shelf High Utility Itemset Mining \u2013 with or Without Negative Unit Profit","author":"P Fournier-Viger","year":"2015","unstructured":"Fournier-Viger P, Zida S (2015) FOSHU: Faster On-shelf High Utility Itemset Mining \u2013 with or Without Negative Unit Profit. ACM, New York, NY, USA, pp 857\u2013864"},{"issue":"2","key":"748_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"JW Han","year":"2000","unstructured":"Han JW, Pei J, Yin YW (2000) Mining frequent patterns without candidate generation. SIGMOD RECORD 29(2):1\u201312","journal-title":"SIGMOD RECORD"},{"issue":"1","key":"748_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"JW Han","year":"2004","unstructured":"Han JW, Pei J, Yin YW (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery 8(1):53\u201387","journal-title":"Data Mining and Knowledge Discovery"},{"key":"748_CR17","unstructured":"Han JW, Wang JY, Lu Y, Tzvetkov P (2002) Mining top-k frequent closed patterns without minimum support. In: IEEE International Conference on Data Mining, Proceedings (2002)"},{"issue":"1","key":"748_CR18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10115-013-0660-8","volume":"41","author":"A Koufakou","year":"2013","unstructured":"Koufakou A (2013) Mining non-derivable hypercliques. Knowledge and Information Systems 41(1):77\u201399","journal-title":"Knowledge and Information Systems"},{"issue":"19","key":"748_CR19","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 Systems with Applications 42(19):6648\u20136657","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"748_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10489-014-0644-8","volume":"43","author":"G Nguyen","year":"2015","unstructured":"Nguyen G, Le T, Vo B, Le B (2015) EIFDD: An efficient approach for erasable itemset mining of very dense datasets. Applied Intelligence 43(1):85\u201394","journal-title":"Applied Intelligence"},{"issue":"1","key":"748_CR21","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.eswa.2014.07.045","volume":"42","author":"HTL Quyen","year":"2015","unstructured":"Quyen HTL, Tuong L, Vo B, Bac L (2015) An efficient and effective algorithm for mining top-rank- k frequent patterns. Expert Systems with Applications 42(1):156\u2013164","journal-title":"Expert Systems with Applications"},{"issue":"0","key":"748_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowledge-Based Systems 76(0):109\u2013126","journal-title":"Knowledge-Based Systems"},{"issue":"6","key":"748_CR23","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W Song","year":"2008","unstructured":"Song W, Yang BR, Xu ZY (2008) Index-BitTableFI: An improved algorithm for mining frequent itemsets. Knowledge-Based Systems 21(6):507\u2013513","journal-title":"Knowledge-Based Systems"},{"issue":"2-3","key":"748_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.knosys.2004.04.010","volume":"18","author":"YJ Tsay","year":"2005","unstructured":"Tsay YJ, Chiang JY (2005) CBAR: an efficient method for mining association rules. Knowledge-Based Systems 18(2-3):99\u2013105","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"748_CR25","first-page":"726","volume":"27","author":"V Tseng","year":"2015","unstructured":"Tseng V, Wu CW, Fournier-Viger P, Yu P (2015) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. Knowledge and Data Engineering. IEEE Transactions on 27(3):726\u2013739","journal-title":"IEEE Transactions on"},{"key":"748_CR26","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ins.2014.04.044","volume":"280","author":"R Vimieiro","year":"2014","unstructured":"Vimieiro R, Moscato P (2014) Disclosed: An efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data. Information Sciences 280:171\u2013187","journal-title":"Information Sciences"},{"key":"748_CR27","unstructured":"Vo B, Le T, Coenen F, Hong TP (2014) Mining frequent itemsets using the N-list and subsume concepts. International Journal of Machine Learning and Cybernetics:1\u201313"},{"issue":"5","key":"748_CR28","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"JY Wang","year":"2005","unstructured":"Wang JY, Han JW, Lu Y, Tzvetkov P (2005) TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering 17(5):652\u2013664","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"748_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H Xiong","year":"2006","unstructured":"Xiong H, Tan PN, Kumar V (2006) Hyperclique pattern discovery. Data Mining and Knowledge Discovery 13(2):219\u2013242","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"2","key":"748_CR30","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10489-014-0601-6","volume":"42","author":"U Yun","year":"2015","unstructured":"Yun U, Ryang H (2015) Incremental high utility pattern mining with static and dynamic databases. Applied Intelligence 42(2):323\u2013352","journal-title":"Applied Intelligence"},{"key":"748_CR31","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using Diffsets","DOI":"10.1145\/956750.956788"},{"key":"748_CR32","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining:283\u20136"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0748-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-015-0748-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0748-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T22:27:21Z","timestamp":1567549641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-015-0748-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,28]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1007\/s10489-015-0748-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,28]]}}}