{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:52:31Z","timestamp":1742914351101,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781489976857"},{"type":"electronic","value":"9781489976871"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-1-4899-7687-1_164","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T12:35:13Z","timestamp":1492086913000},"page":"274-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraint-Based Mining"],"prefix":"10.1007","author":[{"given":"Siegfried","family":"Nijssen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"164_CR3445","unstructured":"Bayardo RJ Jr, Agrawal R, Gunopulos D (1999) Constraint-based rule mining in large, dense databases. In: Proceedings of the 15th international conference on data engineering (ICDE), Sydney, pp\u00a0188\u2013197"},{"issue":"3","key":"164_CR3446","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C Bucila","year":"2003","unstructured":"Bucila C, Gehrke J, Kifer D, White WM (2003) DualMiner: a dual-pruning algorithm for itemsets with constraints. Data Min Knowl Discov 7(3):241\u2013272","journal-title":"Data Min Knowl Discov"},{"key":"164_CR3447","first-page":"123","volume-title":"Proceedings of the second IEEE international conference on data mining (ICDM)","author":"L De Raedt","year":"2002","unstructured":"De Raedt L, Jaeger M, Lee SD, Mannila H (2002) A theory of inductive query answering (extended abstract). In: Proceedings of the second IEEE international conference on data mining (ICDM). IEEE Press, Los Alamitos, pp\u00a0123\u2013130"},{"key":"164_CR3448","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T Imielinski","year":"1996","unstructured":"Imielinski T, Mannila H (1996) A database perspective on knowledge discovery. Commun ACM 39:58\u201364","journal-title":"Commun ACM"},{"key":"164_CR3449","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/773153.773180","volume-title":"Proceedings of the twenty-second ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems","author":"D Kifer","year":"2003","unstructured":"Kifer D, Gehrke J, Bucila C, White WM (2003) How to quickly find a witness. In: Proceedings of the twenty-second ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. ACM Press, San Diego, pp\u00a0272\u2013283"},{"issue":"3","key":"164_CR3450","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Min Knowl Discov 1(3):241\u2013258","journal-title":"Data Min Knowl Discov"},{"key":"164_CR3451","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/335168.335226","volume-title":"Proceedings of the nineteenth ACM SIGACT-SIGMOD-SIGART symposium on database systems (PODS)","author":"S Morishita","year":"2000","unstructured":"Morishita S, Sese J (2000) Traversing itemset lattices with statistical metric pruning. In: Proceedings of the nineteenth ACM SIGACT-SIGMOD-SIGART symposium on database systems (PODS). ACM Press, San Diego, pp\u00a0226\u2013236"},{"issue":"1","key":"164_CR3452","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/568574.568580","volume":"4","author":"J Pei","year":"2002","unstructured":"Pei J, Han J (2002) Constrained frequent pattern mining: a pattern-growth view. SIGKDD Explor 4(1):31\u201339","journal-title":"SIGKDD Explor"},{"key":"164_CR3453","doi-asserted-by":"crossref","unstructured":"Zhu F, Yan X, Han J, Yu PS (2007) gPrune: a constraint pushing framework for graph pattern mining. In: Proceedings of the sixth Pacific-Asia conference on knowledge discovery and data mining (PAKDD). Lecture notes in computer science, vol\u00a04426. Springer, Berlin, pp\u00a0388\u2013400","DOI":"10.1007\/978-3-540-71701-0_38"}],"container-title":["Encyclopedia of Machine Learning and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4899-7687-1_164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T23:11:29Z","timestamp":1591053089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4899-7687-1_164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9781489976857","9781489976871"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4899-7687-1_164","relation":{},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}