{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:42:43Z","timestamp":1777696963382,"version":"3.51.4"},"reference-count":30,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2016,6,15]]},"DOI":"10.3233\/ida-160838","type":"journal-article","created":{"date-parts":[[2016,6,22]],"date-time":"2016-06-22T15:25:56Z","timestamp":1466609156000},"page":"915-931","source":"Crossref","is-referenced-by-count":5,"title":["Binary partition for itemsets expansion in mining high utility itemsets"],"prefix":"10.1177","volume":"20","author":[{"given":"Wei","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-160838_ref1","unstructured":"Agrawal R. and Srikant R., Fast algorithms for mining association rules, The 20th International Conference on Very Large Data Bases (1994), 487-499."},{"key":"10.3233\/IDA-160838_ref2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/IDA-2008-12402","article-title":"Index-CloseMiner: An improved algorithm for mining frequent closed itemset","volume":"12","author":"Song","year":"2008","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-160838_ref3","doi-asserted-by":"crossref","unstructured":"Nijssen S., Guns T. and De Raedt L., Correlated itemset mining in ROC space: a constraint programming approach, The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2009), 647-656.","DOI":"10.1145\/1557019.1557092"},{"key":"10.3233\/IDA-160838_ref4","first-page":"6047","article-title":"Discovering sequential patterns with various time constraints","volume":"9","author":"Song","year":"2013","journal-title":"Journal of Computational Information Systems"},{"key":"10.3233\/IDA-160838_ref5","doi-asserted-by":"crossref","first-page":"761","DOI":"10.3233\/IDA-140668","article-title":"Understanding episode mining techniques: Benchmarking on diverse, realistic, artificial data","volume":"18","author":"Zimmermann","year":"2014","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-160838_ref6","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.knosys.2014.08.015","article-title":"RIB: A robust itemset-based Bayesian approach to classification","volume":"71","author":"Baralis","year":"2014","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-160838_ref7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.ipm.2009.09.009","article-title":"Mining fuzzy frequent itemsets for hierarchical document clustering","volume":"46","author":"Chen","year":"2010","journal-title":"Information Processing and Management"},{"key":"10.3233\/IDA-160838_ref8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/ICDM.2003.1250893","article-title":"Mining high utility itemsets","author":"Chan","year":"2003","journal-title":"The 3rd IEEE International Conference on Data Mining"},{"key":"10.3233\/IDA-160838_ref9","first-page":"482","article-title":"A foundational approach to mining itemset utilities from databases","author":"Yao","year":"2004","journal-title":"The 4th SIAM International Conference on Data Mining"},{"key":"10.3233\/IDA-160838_ref10","doi-asserted-by":"crossref","unstructured":"Liu Y., Liao W.-K. and Choudhary A.N., A two-phase algorithm for fast discovery of high utility itemsets, The 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (2005), 689-695.","DOI":"10.1007\/11430919_79"},{"key":"10.3233\/IDA-160838_ref11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","article-title":"Isolated items discarding strategy for discovering high utility itemsets","volume":"64","author":"Li","year":"2008","journal-title":"Data and Knowledge Engineering"},{"key":"10.3233\/IDA-160838_ref12","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","article-title":"Efficient algorithms for mining high utility itemsets from transactional databases","volume":"25","author":"Tseng","year":"2013","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-160838_ref13","doi-asserted-by":"crossref","first-page":"585","DOI":"10.3233\/IDA-130595","article-title":"UT-Tree: Efficient mining of high utility itemsets from data streams","volume":"17","author":"Feng","year":"2013","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-160838_ref14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-160838_ref15","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","article-title":"Mining itemset utilities from transaction databases","volume":"59","author":"Yao","year":"2006","journal-title":"Data and Knowledge Engineering"},{"key":"10.3233\/IDA-160838_ref16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","article-title":"An efficient projection-based indexing approach for mining high utility itemsets","volume":"38","author":"Lan","year":"2014","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-160838_ref17","doi-asserted-by":"crossref","unstructured":"Song W., Liu Y. and Li J.H., Vertical mining for high utility itemsets, The 2012 IEEE International Conference on Granular Computing (2012), 512-517.","DOI":"10.1109\/GrC.2012.6468563"},{"key":"10.3233\/IDA-160838_ref18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2012.05.015","article-title":"High utility pattern mining using the maximal itemset property and lexicographic tree structures","volume":"215","author":"Lin","year":"2012","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-160838_ref19","doi-asserted-by":"crossref","unstructured":"Erwin A., Gopalan R.P. and Achuthan N.R., CTU-Mine: An efficient high utility itemset mining algorithm using the pattern growth approach, The 7th IEEE International Conference on Computer and Information Technology (2007), 71-76.","DOI":"10.1109\/CIT.2007.120"},{"key":"10.3233\/IDA-160838_ref20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","article-title":"HUC-Prune: An efficient candidate pruning technique to mine high utility patterns","volume":"34","author":"Ahmed","year":"2011","journal-title":"Applied Intelligence"},{"key":"10.3233\/IDA-160838_ref21","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.3233\/IDA-140683","article-title":"Discovering high utility itemsets with multiple minimum supports","volume":"18","author":"Ryang","year":"2014","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-160838_ref22","doi-asserted-by":"crossref","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","article-title":"Pruning strategies for mining high utility itemsets","volume":"42","author":"Krishnamoorthy","year":"2015","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-160838_ref23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","article-title":"FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning","author":"Fournier-Viger","year":"2014","journal-title":"The 21st International Symposium on Foundations of Intelligent Systems"},{"key":"10.3233\/IDA-160838_ref24","doi-asserted-by":"crossref","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","article-title":"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates","volume":"41","author":"Yun","year":"2014","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-160838_ref25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","article-title":"Mining high utility itemsets by dynamically pruning the tree structure","volume":"40","author":"Song","year":"2014","journal-title":"Applied Intelligence"},{"key":"10.3233\/IDA-160838_ref26","unstructured":"IBM data generator, http:\/\/www.cs.loyola.edu\/\u223ccgiannel\/assoc_gen.html."},{"key":"10.3233\/IDA-160838_ref27","unstructured":"Frequent Itemset mining implementations repository, http:\/\/fimi.ua.ac.be."},{"key":"10.3233\/IDA-160838_ref28","doi-asserted-by":"crossref","unstructured":"Chen J.L. and Xiao K.L., BISC: A bitmap itemset support counting approach for efficient frequent itemset mining, ACM Transactions on Knowledge Discovery From Data 4 (2010).","DOI":"10.1145\/1839490.1839493"},{"key":"10.3233\/IDA-160838_ref29","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.knosys.2010.07.007","article-title":"Approximate weighted frequent pattern mining with\/without noisy environments","volume":"24","author":"Yun","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-160838_ref30","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/s10618-012-0284-8","article-title":"Closed and noise-tolerant patterns in n-ary relations","volume":"26","author":"Cerf","journal-title":"Data Mining and Knowledge Discovery"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-160838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:21:26Z","timestamp":1777454486000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-160838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":30,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/ida-160838","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,15]]}}}