{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:55:24Z","timestamp":1725756924093},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415494"},{"type":"electronic","value":"9783642415500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41550-0_13","type":"book-chapter","created":{"date-parts":[[2013,11,14]],"date-time":"2013-11-14T05:56:33Z","timestamp":1384408593000},"page":"139-151","source":"Crossref","is-referenced-by-count":2,"title":["Pushing Constraints into a Pattern-Tree"],"prefix":"10.1007","author":[{"given":"Andreia","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e1udia","family":"Antunes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","first-page":"487","volume-title":"VLDB 1994: Proc. of the 20th Intern. Conf. on Very Large Data Bases","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994: Proc. of the 20th Intern. Conf. on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"13_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11615576_1","volume-title":"Constraint-Based Mining and Inductive Databases","author":"R.J. Bayardo","year":"2006","unstructured":"Bayardo, R.J.: The hows, whys, and whens of constraints in itemset and rule discovery. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining. LNCS (LNAI), vol.\u00a03848, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., Jeudy, B.: Constraint-based data mining. In: The Data Mining and Knowledge Discovery Handbook, pp. 399\u2013416. Springer (2005)","DOI":"10.1007\/0-387-25465-X_18"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"Proc. of the 2000 ACM SIGMOD","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of the 2000 ACM SIGMOD, pp. 1\u201312. ACM, New York (2000)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/568574.568581","volume":"4","author":"C.K.-S. Leung","year":"2002","unstructured":"Leung, C.K.-S., Lakshmanan, L.V.S., Ng, R.T.: Exploiting succinct constraints using fp-trees. SIGKDD Explor. Newsl.\u00a04(1), 40\u201349 (2002)","journal-title":"SIGKDD Explor. Newsl."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Sun, L.: A new class of constraints for constrained frequent pattern mining. In: Proc. of the 27th Annual ACM Symposium on Applied Computing (SAC 2012), pp. 199\u2013204. ACM (2012)","DOI":"10.1145\/2245276.2245314"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Ng, R., Lakshmanan, L., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proc. of the 1998 ACM SIGMOD Int. Conf. on Management of Data, pp. 13\u201324. ACM (1998)","DOI":"10.1145\/276305.276307"},{"issue":"1","key":"13_CR8","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 Explor. Newsl.\u00a04(1), 31\u201339 (2002)","journal-title":"SIGKDD Explor. Newsl."},{"key":"13_CR9","first-page":"433","volume-title":"Proc. of the 17th Int. Conf. on Data Engineering (ICDE 2001)","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: Proc. of the 17th Int. Conf. on Data Engineering (ICDE 2001), pp. 433\u2013442. IEEE, Washington (2001)"},{"key":"13_CR10","first-page":"407","volume-title":"Proc. of the 21th Int. Conf. on Very Large Data Bases (VLDB 1995)","author":"R. Srikant","year":"1995","unstructured":"Srikant, R., Agrawal, R.: Mining generalized association rules. In: Proc. of the 21th Int. Conf. on Very Large Data Bases (VLDB 1995), pp. 407\u2013419. Morgan Kaufmann Publishers Inc., San Francisco (1995)"},{"key":"13_CR11","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proc. of the 3rd ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 67\u201373 (1997)"}],"container-title":["Lecture Notes in Computer Science","Modeling Decisions for Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41550-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T03:13:43Z","timestamp":1558667623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41550-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415494","9783642415500"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41550-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}