{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T17:10:01Z","timestamp":1749575401095,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_33","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"397-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Scalable Constant-Memory Sampling Algorithm for Pattern Discovery in Large Databases"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Scheffer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"33_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, 1996."},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1002\/j.1538-7305.1929.tb01240.x","volume":"8","author":"H. Dodge","year":"1929","unstructured":"H. Dodge and H. Romig. A method of sampling inspection. The Bell System Technical Journal, 8:613\u2013631, 1929.","journal-title":"The Bell System Technical Journal"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"C. Domingo, R. Gavelda, and O. Watanabe. Adaptive sampling methods for scaling up knowledge discovery algorithms. Technical Report TR-C131, Dept. de LSI, Politecnica de Catalunya, 1999.","DOI":"10.1007\/3-540-46846-3_16"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Y. Freund. Self-bounding learning algorithms. In Proceedings of the International Workshop on Computational Learning Theory (COLT-98), 1998.","DOI":"10.1145\/279943.279993"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Russell Greiner. PALO: A probabilistic hill-climbing algorithm. Artificial Intelligence, 83(1\u20132), July 1996.","DOI":"10.1016\/0004-3702(95)00040-2"},{"issue":"1","key":"33_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","volume":"100","author":"D. Haussler","year":"1992","unstructured":"D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78\u2013150, 1992.","journal-title":"Information and Computation"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"D. Haussler, M. Kearns, S. Seung, and N. Tishby. Rigorous learning curve bounds from statistical mechanics. Machine Learning, 25, 1996.","DOI":"10.1007\/BF00114010"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"G. Hulten and P. Domingos. Mining high-speed data streams. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, 2000.","DOI":"10.1145\/347090.347107"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1002\/int.4550070707","volume":"7","author":"W. Kl\u00f6sgen","year":"1992","unstructured":"W. Kl\u00f6sgen. Problems in knowledge discovery in databases and their treatment in the statistics interpreter explora. Journal of Intelligent Systems, 7:649\u2013673, 1992.","journal-title":"Journal of Intelligent Systems"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"W. Kl\u00f6sgen. Explora: A multipattern and multistrategy discovery assistant. In Advances in Knowledge Discovery and Data Mining, pages 249\u2013271. AAAI, 1996.","DOI":"10.1007\/3-540-61286-6_186"},{"key":"33_CR11","unstructured":"J. Langford and D. McAllester. Computable shell decomposition bounds. In Proceedings of the International Conference on Computational Learning Theory, 2000."},{"key":"33_CR12","unstructured":"O. Maron and A. Moore. Hoeffding races: Accelerating model selection search for classification and function approximating. In Advances in Neural Information Processing Systems, pages 59\u201366, 1994."},{"key":"33_CR13","unstructured":"G. Piatetski-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229\u2013248, 1991."},{"key":"33_CR14","unstructured":"T. Scheffer and S. Wrobel. Incremental maximization of non-instance-averaging utility functions with applications to knowledge discovery problems. In Proceedings of the International Conference on Machine Learning, 2001."},{"key":"33_CR15","unstructured":"T. Scheffer and S. Wrobel. Finding the most interesting patterns in a database quickly by using sequential sampling. Journal of Machine Learning Research, In Print."},{"key":"33_CR16","unstructured":"H. Toivonen. Sampling large databases for association rules. In Proc. VLDB Conference, 1996."},{"key":"33_CR17","unstructured":"A. Wald. Sequential Analysis. Wiley, 1947."},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Stefan Wrobel. An algorithm for multi-relational discovery of subgroups. In Proc. First European Symposion on Principles of Data Mining and Knowledge Discovery (PKDD-97), pages 78\u201387, Berlin, 1997.","DOI":"10.1007\/3-540-63223-9_108"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:36:07Z","timestamp":1749573367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}