{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:09Z","timestamp":1740122709411,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["17K00301"],"award-info":[{"award-number":["17K00301"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Here, we present a novel algorithm for frequent itemset mining in streaming data (FIM-SD). For the past decade, various FIM-SD methods in one-pass approximation settings that allow to approximate the support of each itemset have been proposed. They can be categorized into two approximation types: <jats:italic>parameter-constrained<\/jats:italic> (PC) mining and <jats:italic>resource-constrained<\/jats:italic> (RC) mining. PC methods control the maximum error that can be included in the approximate support based on a pre-defined parameter. In contrast, RC methods limit the maximum memory consumption based on resource constraints. However, the existing PC methods can exponentially increase the memory consumption, while the existing RC methods can rapidly increase the maximum error. In this study, we address this problem by introducing a hybrid approach of PC-RC approximations, called <jats:italic>PARASOL<\/jats:italic>. For any streaming data, PARASOL ensures to provide a condensed representation, called a <jats:italic>\u0394-covered set<\/jats:italic>, which is regarded as an extension of the closedness compression; when \u0394 =\u20090, the solution corresponds to the ordinary closed itemsets. PARASOL searches for such approximate closed itemsets that can restore the frequent itemsets and their supports while the maximum error is bounded by an integer, \u0394. Then, we empirically demonstrate that the proposed algorithm significantly outperforms the state-of-the-art PC and RC methods for FIM-SD.<\/jats:p>","DOI":"10.1007\/s10844-019-00590-9","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T10:09:45Z","timestamp":1576577385000},"page":"119-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PARASOL: a hybrid approximation approach for scalable frequent itemset mining in streaming data"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7426-9809","authenticated-orcid":false,"given":"Yoshitaka","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuo","family":"Tabei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Iwanuma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"key":"590_CR1","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Yang, X., Cadenas, R.N., Saez, P.C., Montano, A.P. (2011). Finding closed item sets by intersecting transactions. In Proc. of the 14th int. conf. on extending database technology (EDBT) (pp. 367\u2013376).","DOI":"10.1145\/1951365.1951410"},{"key":"590_CR2","doi-asserted-by":"crossref","unstructured":"Boley, M., Horv\u00e1th, T., Wrobel, S. (2009). Efficient discovery of interesting patterns based on strong closedness. In Proc. of SIAM int. conf. on data mining (SDM) (pp. 1002\u20131013).","DOI":"10.1137\/1.9781611972795.86"},{"key":"590_CR3","doi-asserted-by":"crossref","unstructured":"Boley, M., G\u00e4rtner, T., Grosskreux, H. (2010). Formal concept sampling for counting and threshold-free local pattern mining. In Proc. of SIAM int. conf. on data mining (SDM) (pp. 177\u2013188).","DOI":"10.1137\/1.9781611972801.16"},{"key":"590_CR4","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.R. (2004). Moment: maintaining closed frequent itemsets over a stream sliding window. In Proc. of the 4th IEEE int. conf. on data mining (ICDM) (pp. 59\u201366)."},{"key":"590_CR5","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.comcom.2004.10.014","volume":"28","author":"Y-K Chang","year":"2005","unstructured":"Chang, Y.-K. (2005). Simple and fast IP lookups using binomial spanning tree. Journal of Computer Communications, 28, 529\u2013539.","journal-title":"Journal of Computer Communications"},{"key":"590_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W. (2006). \u03b4-tolerance closed frequent itemsets. In ICDM (pp. 139\u2013148).","DOI":"10.1109\/ICDM.2006.1"},{"key":"590_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10844-007-0042-3","volume":"31","author":"J Cheng","year":"2008","unstructured":"Cheng, J., Ke, Y., Ng, W. (2008). Maintaining frequent closed itemsets over a sliding window. Journal of Intelligence and Information Systems, 31, 191\u2013215.","journal-title":"Journal of Intelligence and Information Systems"},{"key":"590_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X. (2007). Frequent pattern mining: current status and future directions. Journal of Data Mining and Knowledge Discovery, 15, 55\u201386.","journal-title":"Journal of Data Mining and Knowledge Discovery"},{"key":"590_CR9","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1038\/nature07634","volume":"457","author":"J Ginsberg","year":"2009","unstructured":"Ginsberg, J., Mohebbi, M., Patel, R. (2009). Detecting influenza epidemics using search engine query data. Nature, 457, 1012\u20131014.","journal-title":"Nature"},{"key":"590_CR10","doi-asserted-by":"crossref","unstructured":"Hu, Q., & Imielinski, T. (2017). ALPINE: progressive itemset mining with definite guarantees. In Proc. of the 2017 SIAM int. conf. on data mining (pp. 63\u201371).","DOI":"10.1137\/1.9781611974973.8"},{"key":"590_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, N., & Gruenwald, L. (2006). CFI-Stream: mining closed frequent itemsets in data streams. In Proc. of the 12th ACM SIGKDD (pp. 592\u2013597).","DOI":"10.1145\/1150402.1150473"},{"key":"590_CR12","unstructured":"Jin, R., & Agrawal, G. (2005). An algorithm for in-core frequent itemset mining on streaming data. In ICDM (pp. 210\u2013217)."},{"issue":"9","key":"590_CR13","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1109\/12.29465","volume":"38","author":"SL Johnsson","year":"1989","unstructured":"Johnsson, S.L., & Ho, C.-T. (1989). Optimal broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers, 38(9), 1249\u20131268.","journal-title":"IEEE Transactions on Computers"},{"key":"590_CR14","doi-asserted-by":"crossref","unstructured":"Keogh, E.J., Chu, S., Hart, D., Pazzani, M.J. (2001). An online algorithm for segmenting time series. In ICDM (pp. 289\u2013296).","DOI":"10.1109\/ICDM.2001.989531"},{"issue":"1","key":"590_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp, R.M., & Shenker, S. (2003). A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems, 28(1), 51\u201355.","journal-title":"ACM Transactions on Database Systems"},{"key":"590_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"H-F Li","year":"2008","unstructured":"Li, H.-F., Shan, M.-K., Lee, S.-Y. (2008). DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Journal of Knowledge and Information Systems, 17, 79\u201397.","journal-title":"Journal of Knowledge and Information Systems"},{"key":"590_CR17","doi-asserted-by":"crossref","unstructured":"Lee, V.E., Jin, R., Agrawal, G. (2014). Frequent pattern mining in data streams. Book chapter of frequent pattern mining (pp. 199\u2013223).","DOI":"10.1007\/978-3-319-07821-2_9"},{"key":"590_CR18","doi-asserted-by":"crossref","unstructured":"Liu, G., Zhang, H., Wong, L. (2012). Finding minimum representative pattern sets. In Proc. of the 18th ACM SIGKDD (pp. 51\u201359).","DOI":"10.1145\/2339530.2339543"},{"key":"590_CR19","unstructured":"Manku, G.S., & Motwani, R. (2002). Approximate frequent counts over data streams. In VLDB (pp. 346\u2013357)."},{"issue":"7","key":"590_CR20","first-page":"2726","volume":"3","author":"A Mala","year":"2011","unstructured":"Mala, A., & Dhanaseelan, F.R. (2011). Data stream mining algorithms: a review of issues and existing approaches. International Journal of Computer and Electrical Engineering, 3(7), 2726\u20132732.","journal-title":"International Journal of Computer and Electrical Engineering"},{"key":"590_CR21","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E. (2005). Efficient computation of frequent and top-k elements in data streams. In Proc. of the 10th int. conf. on database theory (ICDT) (pp. 398\u2013412)."},{"key":"590_CR22","doi-asserted-by":"crossref","unstructured":"Du, M., & Li, F. (2016). Spell: streaming parsing of system event logs. In Proc. of the 16th int. conf. on data mining (pp. 859\u2013864).","DOI":"10.1109\/ICDM.2016.0103"},{"key":"590_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.3233\/AIC-140615","volume":"28","author":"M Quadrana","year":"2015","unstructured":"Quadrana, M., Bifet, A., Gavald\u00e0, R. (2015). An efficient closed frequent itemset miner for the MOA stream mining system. Journal of AI Communications, 28, 143\u2013158.","journal-title":"Journal of AI Communications"},{"key":"590_CR24","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ins.2014.03.074","volume":"278","author":"SJ Shin","year":"2014","unstructured":"Shin, S.J., Lee, D.S., Lee, W.S. (2014). CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams. Journal of Information Sciences, 278, 559\u2013576.","journal-title":"Journal of Information Sciences"},{"key":"590_CR25","doi-asserted-by":"crossref","unstructured":"Song, G., Yang, D, Cui, B., Zheng, B., Liu, Y., Xie, K. (2007). CLAIM: an efficient method for related frequent closed itemsets mining over stream data. DASFAA2007, LNCS4443, 664\u2013675.","DOI":"10.1007\/978-3-540-71703-4_56"},{"key":"590_CR26","unstructured":"Xin, D., Han, J., Yan, X., Cheng, H. (2005). Mining compressed frequent-pattern sets. In VLDB (pp. 709\u2013720)."},{"key":"590_CR27","doi-asserted-by":"crossref","unstructured":"Yamamoto, Y., Iwanuma, K., Fukuda, S. (2014). Resource-oriented approximation for frequent itemset mining from bursty data streams. In Proc. of the Int. Conf. on Management of Data (SIGMOD) (pp. 165\u2013179).","DOI":"10.1145\/2588555.2612171"},{"key":"590_CR28","doi-asserted-by":"crossref","unstructured":"Yamamoto, K., Ikebe, M., Asai, T., Motomura, M. (2016). FPGA-based stream processing for frequent itemset mining with incremental multiple hashes. Circuits and Systems, 3299\u20133309.","DOI":"10.4236\/cs.2016.710281"},{"key":"590_CR29","doi-asserted-by":"crossref","unstructured":"Yen, S.-J., Wu, C.-W., Lee, Y.-S., Tseng, V.S., Hsieh, C.-H. (2011). A fast algorithm for mining frequent closed itemsets over stream sliding window. In Proc. of the 2011 IEEE int. conf. on fuzzy systems (pp. 996\u20131002).","DOI":"10.1109\/FUZZY.2011.6007724"},{"key":"590_CR30","unstructured":"Hoffman, M.J., Blei, D.M., Bach, F.R. (2010). Online learning for latent dirichlet allocation. In NIPS (pp. 856\u2013864)."},{"key":"590_CR31","doi-asserted-by":"crossref","unstructured":"Iwata, T., Yamada, T., Sakurai, Y., Ueda, N. (2010). Online multiscale dynamic topic models. In KDD (pp. 663\u2013672).","DOI":"10.1145\/1835804.1835889"},{"key":"590_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Sundaresan, N., Shen, Z., Yu, P.S. (2013). Anatomy of a web-scale resale market: a data mining approach. In WWW (pp. 1533\u20131544).","DOI":"10.1145\/2488388.2488522"},{"key":"590_CR33","unstructured":"Zhu, Y., & Shasha, D. (2002). Statistical monitoring of thousands of data streams in real time. In VLDB (pp. 358\u2013369)."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-019-00590-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-019-00590-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-019-00590-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,16]],"date-time":"2020-12-16T00:33:34Z","timestamp":1608078814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-019-00590-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["590"],"URL":"https:\/\/doi.org\/10.1007\/s10844-019-00590-9","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"type":"print","value":"0925-9902"},{"type":"electronic","value":"1573-7675"}],"subject":[],"published":{"date-parts":[[2019,12,17]]},"assertion":[{"value":"13 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}