{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:30:54Z","timestamp":1775010654897,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"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_3","type":"book-chapter","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T14:17:28Z","timestamp":1418825848000},"page":"30-43","source":"Crossref","is-referenced-by-count":45,"title":["Novel Concise Representations of High Utility Itemsets Using Generator Patterns"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","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":"3_CR2","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":"3_CR3","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":"3_CR4","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":"3_CR5","doi-asserted-by":"crossref","unstructured":"Gao, C., Wang, J., He, Y., Zhou, L.: Efficient mining of frequent sequence generators. In: Proc. 17th Intern. Conf. World Wide Web, pp. 1051\u20131052 (2008)","DOI":"10.1145\/1367497.1367651"},{"key":"3_CR6","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":"3_CR7","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.-k., Choudhary, A.K.: 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":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-34707-8_40","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"T.-T. Pham","year":"2012","unstructured":"Pham, T.-T., Luo, J., Hong, T.-P., Vo, B.: MSGPs: A novel algorithm for mining sequential generator patterns. In: Nguyen, N.-T., Hoang, K., Je\u0327drzejowicz, P. (eds.) ICCCI 2012, Part II. LNCS, vol.\u00a07654, pp. 393\u2013401. Springer, Heidelberg (2012)"},{"issue":"17","key":"3_CR9","doi-asserted-by":"publisher","first-page":"12947","DOI":"10.1016\/j.eswa.2012.05.035","volume":"39","author":"B.-E. Shie","year":"2012","unstructured":"Shie, B.-E., Yu, P.S., Tseng, V.S.: Efficient algorithms for mining maximal high utility itemsets from data streams with different models. Expert Syst. Appl.\u00a039(17), 12947\u201312960 (2012)","journal-title":"Expert Syst. Appl."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-06608-0_3","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A. Soulet","year":"2014","unstructured":"Soulet, A., Rioult, F.: Efficiently depth-first minimal pattern mining. 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. 28\u201339. Springer, Heidelberg (2014)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-03915-7_34","volume-title":"Advances in Intelligent Data Analysis VIII","author":"L. Szathmary","year":"2009","unstructured":"Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Efficient vertical mining of frequent closures and generators. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol.\u00a05772, pp. 393\u2013404. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10472-013-9372-8","volume":"70","author":"L. Szathmary","year":"2014","unstructured":"Szathmary, L., et al.: A fast compound algorithm for mining generators, closed patterns, and computing links between equivalence classes. Ann. Math. Artif. Intell.\u00a070(1-2), 81\u2013105 (2014)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"8","key":"3_CR13","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":"3_CR14","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"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:35:59Z","timestamp":1559093759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14717-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319147161","9783319147178"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14717-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}