{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:31:27Z","timestamp":1755797487998},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013065"},{"type":"electronic","value":"9783642013072"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01307-2_76","type":"book-chapter","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T09:47:58Z","timestamp":1240048078000},"page":"749-756","source":"Crossref","is-referenced-by-count":13,"title":["An Efficient Candidate Pruning Technique for High Utility Pattern Mining"],"prefix":"10.1007","author":[{"given":"Chowdhury Farhan","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Syed Khairuzzaman","family":"Tanbeer","sequence":"additional","affiliation":[]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"76_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: 20th Int. Conf. on Very Large Data Bases (VLDB), pp. 487\u2013499 (1994)"},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: A Foundational Approach to Mining Itemset Utilities from Databases. In: Third SIAM Int. Conf. on Data Mining, pp. 482\u2013486 (2004)","DOI":"10.1137\/1.9781611972740.51"},{"key":"76_CR3","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H. Yao","year":"2006","unstructured":"Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data & Knowledge Engineering\u00a059, 603\u2013626 (2006)","journal-title":"Data & Knowledge Engineering"},{"key":"76_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Liu","year":"2005","unstructured":"Liu, Y., Liao, W.-K., Choudhary, A.: A Two Phase algorithm for fast discovery of High Utility of Itemsets. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS(LNAI), vol.\u00a03518, pp. 689\u2013695. Springer, Heidelberg (2005)"},{"key":"76_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Erwin, A., Gopalan, R.P., Achuthan, N.R.: CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach. In: 7th IEEE Int. Conf. on Computer and Information Technology (CIT 2007), pp. 71\u201376 (2007)","DOI":"10.1109\/CIT.2007.120"},{"key":"76_CR7","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"Y.-C. Li","year":"2008","unstructured":"Li, Y.-C., Yeh, J.-S., Chang, C.-C.: Isolated items discarding strategy for discovering high utility itemsets. Data & Knowledge Engineering\u00a064, 198\u2013217 (2008)","journal-title":"Data & Knowledge Engineering"},{"key":"76_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/978-3-540-68125-0_108","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S.K. Tanbeer","year":"2008","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: CP-tree: A tree structure for single pass frequent pattern mining. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS(LNAI), vol.\u00a05012, pp. 1022\u20131027. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01307-2_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T15:57:09Z","timestamp":1551974229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01307-2_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013065","9783642013072"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01307-2_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}