{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:33Z","timestamp":1750306413514,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":18,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1145\/2790755.2790771","type":"proceedings-article","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T14:35:23Z","timestamp":1438007723000},"page":"56-61","source":"Crossref","is-referenced-by-count":16,"title":["UP-Hist Tree"],"prefix":"10.1145","author":[{"given":"Siddharth","family":"Dawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikram","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2790755.2790771-1","unstructured":"R. Agrawal, R. Srikant, et al. Fast algorithms for mining association rules. In 20th VLDB, volume 1215, pages 487--499, 1994."},{"key":"key-10.1145\/2790755.2790771-2","doi-asserted-by":"crossref","unstructured":"C. F. Ahmed, S. K. Tanbeer, B.-S. Jeong, and Y.-K. Lee. Efficient tree structures for high utility pattern mining in incremental databases. IEEE TKDE, 21(12):1708--1721, 2009.","DOI":"10.1109\/TKDE.2009.46"},{"key":"key-10.1145\/2790755.2790771-3","unstructured":"R. Chan, Q. Yang, and Y.-D. Shen. Mining high utility itemsets. In IEEE ICDM, pages 19--26, 2003."},{"key":"key-10.1145\/2790755.2790771-4","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, C.-W. Wu, S. Zida, and V. S. Tseng. Fhm: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In Foundations of intelligent systems, pages 83--92. Springer, 2014.","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"key-10.1145\/2790755.2790771-5","unstructured":"B. Goethals and M. Zaki. the fimi repository, 2012."},{"key":"key-10.1145\/2790755.2790771-6","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM SIGMOD Record, volume 29, pages 1--12, 2000.","DOI":"10.1145\/335191.335372"},{"key":"key-10.1145\/2790755.2790771-7","doi-asserted-by":"crossref","unstructured":"C. K.-S. Leung, Q. I. Khan, Z. Li, and T. Hoque. Cantree: A canonical-order tree for incremental frequent-pattern mining. Knowledge and Information Systems, 11(3):287--311, 2007.","DOI":"10.1007\/s10115-006-0032-8"},{"key":"key-10.1145\/2790755.2790771-8","doi-asserted-by":"crossref","unstructured":"H.-F. Li, H.-Y. Huang, Y.-C. Chen, Y.-J. Liu, and S.-Y. Lee. Fast and memory efficient mining of high utility itemsets in data streams. In IEEE ICDM, pages 881--886, 2008.","DOI":"10.1109\/ICDM.2008.107"},{"key":"key-10.1145\/2790755.2790771-9","doi-asserted-by":"crossref","unstructured":"M. Liu and J. Qu. Mining high utility itemsets without candidate generation. In Proceedings of the 21st ACM international conference on Information and knowledge management, pages 55--64. ACM, 2012.","DOI":"10.1145\/2396761.2396773"},{"key":"key-10.1145\/2790755.2790771-10","doi-asserted-by":"crossref","unstructured":"Y. Liu, W.-k. Liao, and A. Choudhary. A fast high utility itemsets mining algorithm. In International workshop on Utility-based data mining, pages 90--99. ACM, 2005.","DOI":"10.1145\/1089827.1089839"},{"key":"key-10.1145\/2790755.2790771-11","doi-asserted-by":"crossref","unstructured":"Y. Liu, W.-k. Liao, and A. Choudhary. A two-phase algorithm for fast discovery of high utility itemsets. In Advances in Knowledge Discovery and Data Mining, pages 689--695. Springer, 2005.","DOI":"10.1007\/11430919_79"},{"key":"key-10.1145\/2790755.2790771-12","doi-asserted-by":"crossref","unstructured":"T. Lu, Y. Liu, and L. Wang. An algorithm of top-k high utility itemsets mining over data stream. Journal of Software, 9(9):2342--2347, 2014.","DOI":"10.4304\/jsw.9.9.2342-2347"},{"key":"key-10.1145\/2790755.2790771-13","doi-asserted-by":"crossref","unstructured":"B.-E. Shie, H.-F. Hsiao, V. S. Tseng, and S. Y. Philip. Mining high utility mobile sequential patterns in mobile commerce environments. In DASFAA, pages 224--238, 2011.","DOI":"10.1007\/978-3-642-20149-3_18"},{"key":"key-10.1145\/2790755.2790771-14","doi-asserted-by":"crossref","unstructured":"B.-E. Shie, V. S. Tseng, and P. S. Yu. Online mining of temporal maximal utility itemsets from data streams. In ACM Symposium on Applied Computing, pages 1622--1626. ACM, 2010.","DOI":"10.1145\/1774088.1774436"},{"key":"key-10.1145\/2790755.2790771-15","doi-asserted-by":"crossref","unstructured":"V. S. Tseng, B.-E. Shie, C.-W. Wu, and P. S. Yu. Efficient algorithms for mining high utility itemsets from transactional databases. IEEE TKDE, 25(8):1772--1786, 2013.","DOI":"10.1109\/TKDE.2012.59"},{"key":"key-10.1145\/2790755.2790771-16","doi-asserted-by":"crossref","unstructured":"V. S. Tseng, C.-W. Wu, B.-E. Shie, and P. S. Yu. Up-growth: An efficient algorithm for high utility itemset mining. In 16th ACM SIGKDD, pages 253--262, 2010.","DOI":"10.1145\/1835804.1835839"},{"key":"key-10.1145\/2790755.2790771-17","doi-asserted-by":"crossref","unstructured":"C. W. Wu, B.-E. Shie, V. S. Tseng, and P. S. Yu. Mining top-k high utility itemsets. In 18th ACM SIGKDD, pages 78--86. ACM, 2012.","DOI":"10.1145\/2339530.2339546"},{"key":"key-10.1145\/2790755.2790771-18","doi-asserted-by":"crossref","unstructured":"J. Yin, Z. Zheng, L. Cao, Y. Song, and W. Wei. Efficiently mining top-k high utility sequential patterns. In IEEE ICDM, pages 1259--1264. IEEE, 2013.","DOI":"10.1109\/ICDM.2013.148"}],"event":{"number":"19","sponsor":["BytePress","Concordia University","Keio University"],"acronym":"IDEAS '15","name":"the 19th International Database Engineering & Applications Symposium","start":{"date-parts":[[2015,7,13]]},"location":"Yokohama, Japan","end":{"date-parts":[[2015,7,15]]}},"container-title":["Proceedings of the 19th International Database Engineering & Applications Symposium on - IDEAS '15"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790755.2790771","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2790771&ftid=1608487&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:46Z","timestamp":1750223266000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2790755.2790771"}},"subtitle":["An Efficient Data Structure for Mining High Utility Patterns from Transaction Databases"],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1145\/2790755.2790771","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}