{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:32:05Z","timestamp":1725805925644},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319118116"},{"type":"electronic","value":"9783319118123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11812-3_19","type":"book-chapter","created":{"date-parts":[[2014,9,27]],"date-time":"2014-09-27T03:03:16Z","timestamp":1411786996000},"page":"216-227","source":"Crossref","is-referenced-by-count":2,"title":["Providing Concise Database Covers Instantly by Recursive Tile Sampling"],"prefix":"10.1007","author":[{"given":"Sandy","family":"Moens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Boley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Uci machine learning repository, http:\/\/archive.ics.uci.edu\/ml\/"},{"key":"19_CR2","unstructured":"Frequent itemset mining dataset repository (2004), http:\/\/fimi.ua.ac.be\/data"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Al Hasan, M., Zaki, M.J.: Output space sampling for graph patterns. In: Proc. VLDB Endow, pp. 730\u2013741 (2009)","DOI":"10.14778\/1687627.1687710"},{"key":"19_CR4","unstructured":"Blumenstock, A., Hipp, J., Kempe, S., Lanquillon, C., Wirth, R.: Interactivity closes the gap. In: Proc. of the KDD Workshop on Data Min. for Business Applications, Philadelphia, USA (2006)"},{"key":"19_CR5","unstructured":"Boley, M.: The Efficient Discovery of Interesting Closed Pattern Collections. PhD thesis (2011)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Boley, M., Lucchese, C., Paurat, D., G\u00e4rtner, T.: Direct local pattern sampling by efficient two\u2013step random procedures. In: Proc. ACM SIGKDD (2011)","DOI":"10.1145\/2020408.2020500"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Boley, M., Mampaey, M., Kang, B., Tokmakov, P., Wrobel, S.: One click mining: Interactive local pattern discovery through implicit preference and performance learning. In: IDEA 2013 Workshop in Proc. ACM SIGKDD, pp. 27\u201335. ACM (2013)","DOI":"10.1145\/2501511.2501517"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Boley, M., Moens, S., G\u00e4rtner, T.: Linear space direct pattern sampling using coupling from the past. In: Proc. ACM SIGKDD, pp. 69\u201377. ACM (2012)","DOI":"10.1145\/2339530.2339545"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Dzyuba, V., van Leeuwen, M.: Interactive discovery of interesting subgroup sets., pp. 150\u2013161 (2013)","DOI":"10.1007\/978-3-642-41398-8_14"},{"key":"19_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-30214-8_22","volume-title":"Discovery Science","author":"F. Geerts","year":"2004","unstructured":"Geerts, F., Goethals, B., Mielik\u00e4inen, T.: Tiling databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 278\u2013289. Springer, Heidelberg (2004)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Goethals, B., Moens, S., Vreeken, J.: Mime: a framework for interactive visual pattern mining. In: Proc. ACM SIGKDD, pp. 757\u2013760. ACM (2011)","DOI":"10.1145\/2020408.2020529"},{"key":"19_CR12","unstructured":"Lavra\u010d, N., Kav\u0161ek, B., Flach, P., Todorovski, L.: Subgroup discovery with cn2-sd. J. Mach. Learn. Res, 153\u2013188 (2004)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE Trans. on Knowl. and Data Eng., 1348\u20131362 (2008)","DOI":"10.1109\/TKDE.2008.53"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Moens, S., Goethals, B.: Randomly sampling maximal itemsets. In: IDEA 2013 Workshop in Proc. ACM SIGKDD (2013)","DOI":"10.1145\/2501511.2501523"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Neal, R.M.: Slice sampling. In: Ann. Statist., pp. 705\u2013767 (2003)","DOI":"10.1214\/aos\/1056562461"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained association rules. ACM SIGMOD Record, 13\u201324 (1998)","DOI":"10.1145\/276305.276307"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-662-43968-5_9","volume-title":"Interactive Knowledge Discovery and Data Mining in Biomedical Informatics","author":"M. Leeuwen van","year":"2014","unstructured":"van Leeuwen, M.: Interactive data exploration using pattern mining. In: Holzinger, A., Jurisica, I. (eds.) Interactive Knowledge Discovery and Data Mining. LNCS, vol.\u00a08401, pp. 169\u2013182. Springer, Heidelberg (2014)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: Mining itemsets that compress. Data Min. Knowl. Discov., 169\u2013214 (2011)","DOI":"10.1007\/s10618-010-0202-x"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/978-3-642-33486-3_52","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"R. \u0160krabal","year":"2012","unstructured":"\u0160krabal, R., \u0160im\u016fnek, M., Voj\u00ed\u0159, S., Hazucha, A., Marek, T., Chud\u00e1n, D., Kliegr, T.: Association rule mining following the web search paradigm. In: Flach, P.A., De Bie, T., Cristianini, N. (eds.) ECML PKDD 2012, Part II. LNCS, vol.\u00a07524, pp. 808\u2013811. Springer, Heidelberg (2012)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Jin, R., Fuhry, D., Dragan, F.F.: Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov, 215\u2013251 (2011)","DOI":"10.1007\/s10618-010-0203-9"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: Parallel algorithms for discovery of association rules. Data Min. Knowl. Discov., 343\u2013373 (1997)","DOI":"10.1023\/A:1009773317876"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11812-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T13:50:49Z","timestamp":1565877049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11812-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319118116","9783319118123"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11812-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}