{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:34:31Z","timestamp":1728174871682},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540313311"},{"type":"electronic","value":"9783540313519"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11615576_11","type":"book-chapter","created":{"date-parts":[[2006,2,7]],"date-time":"2006-02-07T02:46:48Z","timestamp":1139280408000},"page":"216-242","source":"Crossref","is-referenced-by-count":3,"title":["How to Quickly Find a Witness"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kifer","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Gehrke","sequence":"additional","affiliation":[]},{"given":"Cristian","family":"Bucila","sequence":"additional","affiliation":[]},{"given":"Walker","family":"White","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proc. SIGMOD 1993","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proc. SIGMOD 1993, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"11_CR2","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, ch.\u00a012, pp. 307\u2013328. AAAI\/MIT Press, Cambridge (1996)"},{"key":"11_CR3","first-page":"487","volume-title":"Proc. VLDB 1994","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. VLDB 1994, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"11_CR4","first-page":"11","volume-title":"ICDM","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Examiner: Optimized level-wise frequent pattern mining with monotone constraint. In: ICDM, pp. 11\u201318. IEEE Computer Society, Los Alamitos (2003)"},{"key":"11_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Exante: Anticipated data reduction in constrained pattern mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 59\u201370. Springer, Heidelberg (2003)"},{"key":"11_CR6","unstructured":"Boulicaut, J., Jeudy, B.: Using constraints during set mining: Should we prune or not (2000)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., Jeudy, B.: Mining free itemsets under constraints. In: International Database Engineering and Application Symposium, pp. 322\u2013329 (2001)","DOI":"10.1109\/IDEAS.2001.938100"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J.E., Kifer, D., White, W.: Dualminer: A dual-pruning algorithm for itemsets with constraints. In: Proc. SIGKDD 2002, Edmonton, Alberta, Canada (July 2002)","DOI":"10.1145\/775047.775054"},{"volume-title":"SIGMOD 1999","year":"1999","key":"11_CR9","unstructured":"Delis, A., Faloutsos, C., Ghandeharizadeh, S. (eds.): SIGMOD 1999, Philadephia, Pennsylvania, USA. ACM Press, New York (1999)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Mannila, H., Khardon, R., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Proc. PODS 1997, pp. 209\u2013216 (1997)","DOI":"10.1145\/263661.263684"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/568574.568582","volume":"4","author":"J. Hipp","year":"2002","unstructured":"Hipp, J., Guntzer, U.: Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations\u00a04(1), 50\u201355 (2002)","journal-title":"SIGKDD Explorations"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Ng, R.T., Han, J., Pang, A.: Optimization of constrained frequent set queries with 2-variable constraints. In: Delis, et al. (eds.) [9], pp. 157\u2013168","DOI":"10.1145\/304181.304196"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/568574.568581","volume":"4","author":"C.K.-S. Leung","year":"2002","unstructured":"Leung, C.K.-S., Lakshmanan, L.V., Ng, R.T.: Exploiting succinct constraints using fp-trees. SIGKDD Explorations\u00a04(1), 31\u201339 (2002)","journal-title":"SIGKDD Explorations"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V.S., Han, J., Mah, T.: Exploratory mining via constrained frequent set queries. In: Delis, et al. (eds.) [9], pp. 556\u2013558","DOI":"10.1145\/304182.304575"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/276304.276307","volume-title":"Proc. SIGMOD 1998","author":"R.T. Ng","year":"1998","unstructured":"Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained association rules. In: Haas, L.M., Tiwary, A. (eds.) Proc. SIGMOD 1998, pp. 13\u201324. ACM Press, New York (1998)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J.: Can we push more constraints into frequent pattern mining? In: ACM SIGKDD Conference, pp. 350\u2013354 (2000)","DOI":"10.1145\/347090.347166"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/568574.568580","volume":"4","author":"J. Pei","year":"2002","unstructured":"Pei, J., Han, J.: Constrained frequent pattern mining: A pattern-growth view. SIGKDD Explorations\u00a04(1), 31\u201339 (2002)","journal-title":"SIGKDD Explorations"},{"key":"11_CR18","first-page":"433","volume-title":"ICDE 2001","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: ICDE 2001, pp. 433\u2013442. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/568574.568583","volume":"4","author":"C.-S. Perng","year":"2002","unstructured":"Perng, C.-S., Wang, H., Ma, S., Hellerstein, J.L.: Discovery in multi-attribute data with user-defined constraints. SIGKDD Explorations\u00a04(1), 56\u201364 (2002)","journal-title":"SIGKDD Explorations"},{"key":"11_CR20","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proc. KDD 1997 (1995)"}],"container-title":["Lecture Notes in Computer Science","Constraint-Based Mining and Inductive Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11615576_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T15:38:59Z","timestamp":1555429139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11615576_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540313311","9783540313519"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11615576_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}