{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:12Z","timestamp":1740123192007,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10994-019-05827-w","type":"journal-article","created":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T05:32:06Z","timestamp":1567229526000},"page":"1147-1177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective approximation of parametrized closure systems over transactional data streams"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6392-5671","authenticated-orcid":false,"given":"Daniel","family":"Trabold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"issue":"2","key":"5827_CR1","first-page":"319","volume":"4","author":"D Angluin","year":"1987","unstructured":"Angluin, D. (1987). Queries and concept learning. Machine Learning, 4(2), 319\u2013342.","journal-title":"Machine Learning"},{"key":"5827_CR2","doi-asserted-by":"crossref","unstructured":"Bai, S.\u00a0P., & Kumar, G.\u00a0K.\u00a0R. (2016). A survey on closed frequent itemset mining on data streams. In Proceedings of the 2nd International Conference on Contemporary Computing and Informatics (IC3I) (pp. 542\u2013547).","DOI":"10.1109\/IC3I.2016.7918023"},{"issue":"3","key":"5827_CR3","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.tcs.2009.10.024","volume":"411","author":"M Boley","year":"2010","unstructured":"Boley, M., Horv\u00e1th, T., Poign\u00e9, A., & Wrobel, S. (2010). Listing closed sets of strongly accessible set systems with applications to data mining. Theoretical Computer Science, 411(3), 691\u2013700.","journal-title":"Theoretical Computer Science"},{"issue":"5\u20136","key":"5827_CR4","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/sam.10057","volume":"2","author":"M Boley","year":"2009","unstructured":"Boley, M., Horv\u00e1th, T., & Wrobel, S. (2009). Efficient discovery of interesting patterns based on strong closedness. Statistical Analysis and Data Mining, 2(5\u20136), 346\u2013360.","journal-title":"Statistical Analysis and Data Mining"},{"issue":"3","key":"5827_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1024605820527","volume":"39","author":"E Boros","year":"2003","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., & Makino, K. (2003). On maximal frequent and minimal infrequent sets in binary matrices. Annals of Mathematics and Artificial Intelligence, 39(3), 211\u2013221.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"5827_CR6","unstructured":"Chi, Y., Wang, H., Yu, P.\u00a0S., Muntz, R.\u00a0R. (2004). Moment: maintaining closed frequent itemsets over a stream sliding window. In Proceedings of 4th International Conference on Data Mining (ICDM) (pp. 59\u201366)."},{"key":"5827_CR7","unstructured":"Dua, D., & Graff, C. (2019). UCI Machine Learning Repository. Irvine, CA: University of California, School of Information and Computer Science. \n                  http:\/\/archive.ics.uci.edu\/ml\/index.php\n                  \n                ."},{"issue":"4","key":"5827_CR8","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/2523813","volume":"46","author":"J Gama","year":"2014","unstructured":"Gama, J., \u017dliobait\u0117, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014). A survey on concept drift adaptation. ACM Computing Surveys, 46(4), 44:1\u201344:37.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"5827_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00383449","volume":"8","author":"B Ganter","year":"1991","unstructured":"Ganter, B., & Reuter, K. (1991). Finding all closed sets: A general approach. Order, 8(3), 283\u2013290.","journal-title":"Order"},{"key":"5827_CR10","first-page":"223","volume-title":"A generic algorithm for generating closed sets of a binary relation","author":"A G\u00e9ly","year":"2005","unstructured":"G\u00e9ly, A. (2005). A generic algorithm for generating closed sets of a binary relation (pp. 223\u2013234). Berlin: Springer."},{"key":"5827_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, A., Bhatnagar, V., & Kumar, N. (2010). Mining closed itemsets in data stream using formal concept analysis. In Proceedings of 12th International Conference on Data Warehousing and Knowledge Discovery, DaWaK (pp. 285\u2013296).","DOI":"10.1007\/978-3-642-15105-7_23"},{"issue":"301","key":"5827_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301), 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"key":"5827_CR13","unstructured":"Iwanuma, K., Yamamoto, Y., & Fukuda, S. (2016). An on-line approximation algorithm for mining frequent closed itemsets based on incremental intersection. In Proceedings of the 19th International Conference on Extending Database Technology, (pp. 704\u2013705)."},{"key":"5827_CR14","doi-asserted-by":"crossref","unstructured":"Jiang, N., & Gruenwald, L. (2006). CFI-Stream: Mining closed frequent itemsets in data streams. In Proceedings of the 12th ACM SIGKDD, (pp. 592\u2013597).","DOI":"10.1145\/1150402.1150473"},{"key":"5827_CR15","doi-asserted-by":"crossref","unstructured":"Kifer, D., Ben-David, S., & Gehrke, J. (2004). Detecting change in data streams. In Proceedings of the 13th International Conference on Very Large Data Bases (VLDB), (pp. 180\u2013191).","DOI":"10.1016\/B978-012088469-8.50019-X"},{"key":"5827_CR16","volume-title":"The art of computer programming. Vol. 2: Seminumerical algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D. E. (1997). The art of computer programming. Vol. 2: Seminumerical algorithms. Reading: Addison-Wesley."},{"issue":"3","key":"5827_CR17","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10115-013-0656-4","volume":"40","author":"C-W Li","year":"2014","unstructured":"Li, C.-W., & Jea, K.-F. (2014). An approach of support approximation to discover frequent patterns from concept-drifting data streams based on concept learning. Knowledge and Information Systems, 40(3), 639\u2013671.","journal-title":"Knowledge and Information Systems"},{"issue":"6","key":"5827_CR18","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.camwa.2008.10.060","volume":"57","author":"X Liu","year":"2009","unstructured":"Liu, X., Guan, J., & Hu, P. (2009). Mining frequent closed itemsets from a landmark window over online data streams. Computers & Mathematics with Applications, 57(6), 927\u2013936.","journal-title":"Computers & Mathematics with Applications"},{"key":"5827_CR19","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.knosys.2018.07.011","volume":"161","author":"C Loglisci","year":"2018","unstructured":"Loglisci, C., Ceci, M., Impedovo, A., & Malerba, D. (2018). Mining microscopic and macroscopic changes in network data streams. Knowledge-Based Systems, 161, 294\u2013312.","journal-title":"Knowledge-Based Systems"},{"key":"5827_CR20","doi-asserted-by":"crossref","unstructured":"Manku, G.\u00a0S., & Motwani, R. (2002) Approximate frequency counts over data streams. In Proceedings of the 28th International Conference on Very Large Data Bases, (VLDB), (pp. 346\u2013357). VLDB Endowment.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"1","key":"5827_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1), 25\u201346.","journal-title":"Information Systems"},{"issue":"1","key":"5827_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1214\/aos\/1176342611","volume":"2","author":"RJ Serfling","year":"1974","unstructured":"Serfling, R. J. (1974). Probability inequalities for the sum in sampling without replacement. Annals Statistics, 2(1), 39\u201348.","journal-title":"Annals Statistics"},{"key":"5827_CR23","unstructured":"Trabold, D., & Horv\u00e1th, T. (2017). Mining strongly closed itemsets from data streams. In A. Yamamoto, T. Kida, T. Uno, and T. Kuboyama (Eds.), Discovery science. DS 2017. Lecture Notes in Computer Science (Vol. 10558, pp. 251\u2013266). Cham: Springer."},{"issue":"9","key":"5827_CR24","doi-asserted-by":"publisher","first-page":"11617","DOI":"10.1016\/j.eswa.2009.03.025","volume":"36","author":"PSM Tsai","year":"2009","unstructured":"Tsai, P. S. M. (2009). Mining frequent itemsets in data streams using the weighted sliding window model. Expert Systems with Applications, 36(9), 11617\u201311625.","journal-title":"Expert Systems with Applications"},{"key":"5827_CR25","doi-asserted-by":"crossref","unstructured":"van Leeuwen, M., Siebes, A. (2008). StreamKrimp: Detecting Change in Data Streams. In Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases 2008, (ECML PKDD), (pp. 672\u2013687).","DOI":"10.1007\/978-3-540-87479-9_62"},{"issue":"1","key":"5827_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J. S. (1985). Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1), 37\u201357.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"5827_CR27","doi-asserted-by":"crossref","unstructured":"Yen, S.\u00a0J., Wu, C.\u00a0W., Lee, Y.\u00a0S., Tseng, V.\u00a0S., Hsieh, C.\u00a0H. (2011). A fast algorithm for mining frequent closed itemsets over stream sliding window. In IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), (pp. 996\u20131002)","DOI":"10.1109\/FUZZY.2011.6007724"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05827-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05827-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05827-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,30]],"date-time":"2020-08-30T00:04:19Z","timestamp":1598745859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05827-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,30]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["5827"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05827-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2019,8,30]]},"assertion":[{"value":"17 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}