{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:32Z","timestamp":1740122612789,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"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":[[2021,7]]},"DOI":"10.1007\/s10489-020-02063-x","type":"journal-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T07:03:03Z","timestamp":1609830183000},"page":"4649-4663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["High-utility and diverse itemset mining"],"prefix":"10.1007","volume":"51","author":[{"given":"Amit","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddharth","family":"Dawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raman","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shamkant","family":"Navathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0769-6381","authenticated-orcid":false,"given":"Vikram","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"2063_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: 20th international conference on very large databases, pp 487\u2013499"},{"issue":"12","key":"2063_CR2","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B, Lee Y (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721. https:\/\/doi.org\/10.1109\/TKDE.2009.46","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2063_CR3","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 Syst Appl 105:129\u2013143. https:\/\/doi.org\/10.1016\/j.eswa.2018.03.041","journal-title":"Expert Syst Appl"},{"key":"2063_CR4","doi-asserted-by":"publisher","unstructured":"Dawar S, Goyal V (2015) UP-Hist tree: An efficient data structure for mining high utility patterns from transaction databases. In: Proceedings of the 19th international database engineering & applications symposium. ACM, New York, pp 56\u201361, DOI https:\/\/doi.org\/10.1145\/2790755.2790771, (to appear in print)","DOI":"10.1145\/2790755.2790771"},{"issue":"3","key":"2063_CR5","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Goyal V, Bera D (2017) A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl Intell 47(3):809\u2013827. https:\/\/doi.org\/10.1007\/s10489-017-0932-1","journal-title":"Appl Intell"},{"issue":"10","key":"2063_CR6","doi-asserted-by":"publisher","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 Syst Appl 41 (10):4505\u20134512. https:\/\/doi.org\/10.1016\/j.eswa.2014.01.025","journal-title":"Expert Syst Appl"},{"issue":"13","key":"2063_CR7","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.eswa.2015.03.004","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2063_CR8","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 (2014) SPMF: a java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"key":"2063_CR9","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, Lin JCW, Truong-Chi T, Nkambou R (2019) A survey of high utility itemset mining. In: High-utility pattern mining. Springer, New York, pp 1\u201345, DOI https:\/\/doi.org\/10.1007\/978-3-030-04921-8_1, (to appear in print)","DOI":"10.1007\/978-3-030-04921-8_1"},{"key":"2063_CR10","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Foundations of intelligent systems. Springer International Publishing, New York, pp 83\u201392, DOI https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9, (to appear in print)","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"2063_CR11","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Lin JCW, Fujita H, Koh YS (2019) Mining local and peak high utility itemsets. Inform Sci 481:344\u2013367. https:\/\/doi.org\/10.1016\/j.ins.2018.12.070","journal-title":"Inform Sci"},{"key":"2063_CR12","doi-asserted-by":"publisher","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, SIGMOD \u201900. ACM, New York, pp 1\u201312, DOI https:\/\/doi.org\/10.1145\/342009.335372, (to appear in print)","DOI":"10.1145\/342009.335372"},{"issue":"5","key":"2063_CR13","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"28","author":"J Liu","year":"2016","unstructured":"Liu J, Wang K, Fung BCM (2016) Mining high utility patterns in one phase without generating candidates. IEEE Trans Knowl Data Eng 28(5):1245\u20131257. https:\/\/doi.org\/10.1109\/TKDE.2015.2510012","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2063_CR14","doi-asserted-by":"publisher","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on information and knowledge management. ACM, New York, pp 55\u201364, DOI https:\/\/doi.org\/10.1145\/2396761.2396773 , (to appear in print)","DOI":"10.1145\/2396761.2396773"},{"key":"2063_CR15","doi-asserted-by":"publisher","unstructured":"Liu Y, Liao Wk, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of the 1st international workshop on utility-based data mining. ACM, New York, pp 90\u201399, DOI https:\/\/doi.org\/10.1145\/1089827.1089839, (to appear in print)","DOI":"10.1145\/1089827.1089839"},{"key":"2063_CR16","doi-asserted-by":"publisher","unstructured":"Liu Y, Liao Wk, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Advances in knowledge discovery and data mining. Springer, New York, pp 689\u2013695, DOI https:\/\/doi.org\/10.1007\/11430919_79, (to appear in print)","DOI":"10.1007\/11430919_79"},{"issue":"1","key":"2063_CR17","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1186\/1471-2105-14-230","volume":"14","author":"YC Liu","year":"2013","unstructured":"Liu YC, Cheng CP, Tseng VS (2013) Mining differential top-k co-expression patterns from time course comparative gene expression datasets. BMC Bioinforma 14(1):230. https:\/\/doi.org\/10.1186\/1471-2105-14-230","journal-title":"BMC Bioinforma"},{"key":"2063_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LT Nguyen","year":"2019","unstructured":"Nguyen LT, Nguyen P, Nguyen TD, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowl-Based Syst 175:130\u2013144. https:\/\/doi.org\/10.1016\/j.knosys.2019.03.022","journal-title":"Knowl-Based Syst"},{"key":"2063_CR19","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399. https:\/\/doi.org\/10.1016\/j.ins.2019.05.006","journal-title":"Inf Sci"},{"key":"2063_CR20","unstructured":"Srivastava S, Kiran RU, Reddy PK (2011) Discovering diverse-frequent patterns in transactional databases. In: Proceedings of the 17th international conference on management of data. Computer Society of India, Mumbai, pp 14:1\u201314:10"},{"key":"2063_CR21","doi-asserted-by":"publisher","unstructured":"Swamy MK, Reddy PK (2015) Improving diversity performance of association rule based recommender systems. In: Database and expert systems applications. Springer, New York, pp 499\u2013508, DOI https:\/\/doi.org\/10.1007\/978-3-319-22849-5_34, (to appear in print)","DOI":"10.1007\/978-3-319-22849-5_34"},{"key":"2063_CR22","doi-asserted-by":"publisher","unstructured":"Swamy MK, Reddy PK, Bhalla S (2017) Association rule based approach to improve diversity of query recommendations. In: International conference on database and expert systems applications. Springer, New York, pp 340\u2013350, DOI https:\/\/doi.org\/10.1007\/978-3-319-64471-4_27, (to appear in print)","DOI":"10.1007\/978-3-319-64471-4_27"},{"key":"2063_CR23","doi-asserted-by":"publisher","unstructured":"Swamy MK, Reddy PK, Srivastava S (2014) Extracting diverse patterns with unbalanced concept hierarchy. In: Pacific-asia conference on knowledge discovery and data mining. Springer, New York, pp 15\u201327, DOI https:\/\/doi.org\/10.1007\/978-3-319-06608-0_2, (to appear in print)","DOI":"10.1007\/978-3-319-06608-0_2"},{"issue":"8","key":"2063_CR24","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie B, Wu C, Yu PS (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786. https:\/\/doi.org\/10.1109\/TKDE.2012.59","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2063_CR25","doi-asserted-by":"publisher","first-page":"90465","DOI":"10.1109\/ACCESS.2020.2994059","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LV, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Nguyen LTT, Hong T (2020) Mining correlated high utility itemsets in one phase. IEEE Access 8:90465\u201390477. https:\/\/doi.org\/10.1109\/ACCESS.2020.2994059","journal-title":"IEEE Access"},{"key":"2063_CR26","doi-asserted-by":"publisher","unstructured":"Wu D, Luo D, Jensen CS, Huang JZ (2019) Efficiently mining maximal diverse frequent itemsets. In: International conference on database systems for advanced applications. Springer, New York, pp 191\u2013207, DOI https:\/\/doi.org\/10.1007\/978-3-030-18579-4_12, (to appear in print)","DOI":"10.1007\/978-3-030-18579-4_12"},{"issue":"3","key":"2063_CR27","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. https:\/\/doi.org\/10.1109\/69.846291","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"2063_CR28","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JCW, Wu CW, Tseng VS (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625. https:\/\/doi.org\/10.1007\/s10115-016-0986-0","journal-title":"Knowl Inf Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02063-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-02063-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02063-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T08:45:58Z","timestamp":1624005958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-02063-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["2063"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-02063-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"4 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interests"}}]}}