{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:38:33Z","timestamp":1770064713465,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319147161","type":"print"},{"value":"9783319147178","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14717-8_2","type":"book-chapter","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T09:17:28Z","timestamp":1418807848000},"page":"16-29","source":"Crossref","is-referenced-by-count":25,"title":["FHN: Efficient Mining of High-Utility Itemsets with Negative Unit Profits"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.amc.2009.05.066","volume":"215","author":"C.-J. Chu","year":"2009","unstructured":"Chu, C.-J., Tseng, V.S., Liang, T.: An efficient algorithm for mining high utility itemsets with negative item values in large databases. Applied Math. Comput.\u00a0215, 767\u2013778 (2009)","journal-title":"Applied Math. Comput."},{"key":"2_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. Int. Conf. Very Large Databases, pp. 487\u2013499 (1994)"},{"issue":"12","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"C.F. Ahmed","year":"2009","unstructured":"Ahmed, C.F., Tanbeer, S.K., Jeong, B.-S., Lee, Y.-K.: Efficient Tree Structures for High-utility Pattern Mining in Incremental Databases. IEEE Trans. Knowl. Data Eng.\u00a021(12), 1708\u20131721 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"Foundations of Intelligent Systems","author":"P. Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: Faster High-Utility Itemset Mining using Estimated Utility Co-occurrence Pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Ra\u015b, Z.W. (eds.) ISMIS 2014. LNCS, vol.\u00a08502, pp. 83\u201392. Springer, Heidelberg (2014)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-06608-0_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P. Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., Campos, M., Thomas, R.: Fast vertical mining of sequential patterns using co-occurrence information. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014, Part I. LNCS, vol.\u00a08443, pp. 40\u201352. Springer, Heidelberg (2014)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-06483-3_8","volume-title":"Advances in Artificial Intelligence","author":"P. Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Gomariz, A., Tseng, V.S.: VMSP: Efficient Vertical Mining of Maximal Sequential Patterns. In: Sokolova, M., van Beek, P. (eds.) Canadian AI. LNCS, vol.\u00a08436, pp. 83\u201394. Springer, Heidelberg (2014)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-319-14717-8_3","volume-title":"ADMA 2014","author":"P. Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Tseng, V.S.: Novel Concise Representations of High Utility Itemsets using Generator Patterns. In: Luo, X., Yu, J.X., Li, Z. (eds.) ADMA 2014. LNCS, vol.\u00a08933, pp. 30\u201343. Springer, Heidelberg (2014)"},{"issue":"1","key":"2_CR8","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(1), 198\u2013217 (2008)","journal-title":"Data & Knowledge Engineering"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining High Utility Itemsets without Candidate Generation. In: Proceedings of CIKM 2012, pp. 55\u201364 (2012)","DOI":"10.1109\/ICDM.2012.20"},{"key":"2_CR10","series-title":"Lecture Notes in Artificial Intelligence","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., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 689\u2013695. Springer, Heidelberg (2005)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-31087-4_63","volume-title":"Advanced Research in Applied Artificial Intelligence","author":"B.-E. Shie","year":"2012","unstructured":"Shie, B.-E., Cheng, J.-H., Chuang, K.-T., Tseng, V.S.: A One-Phase Method for Mining High Utility Mobile Sequential Patterns in Mobile Commerce Environments. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds.) IEA\/AIE 2012. LNCS, vol.\u00a07345, pp. 616\u2013626. Springer, Heidelberg (2012)"},{"issue":"8","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"V.S. Tseng","year":"2013","unstructured":"Tseng, V.S., Shie, B.-E., Wu, C.-W., Yu, P.S.: Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases. IEEE Trans. Knowl. Data Eng.\u00a025(8), 1772\u20131786 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Wu, C.-W., Fournier-Viger, P., Yu., P.S., Tseng, V.S.: Efficient Mining of a Concise and Lossless Representation of High Utility Itemsets. In: Proceedings of ICDM 2011, pp.\u00a0824\u2013833 (2011)","DOI":"10.1109\/ICDM.2011.60"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Wu, C.-W., Lin, Y.-F., Yu, P.S., Tseng, V.S.: Mining High Utility Episodes in Complex Event Sequences. In: Proceedings of ACM SIG KDD 2013, pp. 536\u2013544 (2013)","DOI":"10.1145\/2487575.2487654"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Yin, J., Zheng, Z., Cao, L.: USpan: An Efficient Algorithm for Mining High Utility Sequential Patterns. In: Proceedings of ACM SIG KDD 2012, pp. 660\u2013668 (2012)","DOI":"10.1145\/2339530.2339636"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Yin, J., Zheng, Z., Cao, L., Song, Y., Wei, W.: Efficiently Mining Top-K High Utility Sequential Patterns. In: Proceedings of ICDM 2013, pp.\u00a01259\u20131264 (2013)","DOI":"10.1109\/ICDM.2013.148"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14717-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:36:27Z","timestamp":1559079387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14717-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319147161","9783319147178"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14717-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}