{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:33:25Z","timestamp":1742384005897},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200857"},{"type":"electronic","value":"9783540398042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39804-2_8","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:06:45Z","timestamp":1277683605000},"page":"59-70","source":"Crossref","is-referenced-by-count":45,"title":["ExAnte: Anticipated Data Reduction in Constrained Pattern Mining"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Fosca","family":"Giannotti","sequence":"additional","affiliation":[]},{"given":"Alessio","family":"Mazzanti","sequence":"additional","affiliation":[]},{"given":"Dino","family":"Pedreschi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C, May 26-28, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"8_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the Twentieth International Conference on Very Large Databases, Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"8_CR3","unstructured":"Boulicaut, J.-F., Jeudy, B.: Using constraints during set mining: Should we prune or not? In: Actes des Seizieme Journiies Bases de Donnues Avancues BDA 2000, Blois (F), pp. 221\u2013237 (2000)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.: Dualminer: A dual-pruning algorithm for itemsets with constraints. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)","DOI":"10.1145\/775047.775054"},{"key":"8_CR5","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Exante: a preprocessing algorithm for constrained frequent pattern mining. Technical Report ISTI-B4-2003-07, ISTI (2003)"},{"key":"8_CR6","first-page":"512","volume-title":"16th International Conference on Data Engineering (ICDE 2000)","author":"G. Grahne","year":"2000","unstructured":"Grahne, G., Lakshmanan, L., Wang, X.: Efficient mining of constrained correlated sets. In: 16th International Conference on Data Engineering (ICDE 2000), pp. 512\u2013524. IEEE, Los Alamitos (2000)"},{"issue":"8","key":"8_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/2.781634","volume":"32","author":"J. Han","year":"1999","unstructured":"Han, J., Lakshmanan, L.V.S., Ng, R.T.: Constraint-based, multidimensional data mining. Computer\u00a032(8), 46\u201350 (1999)","journal-title":"Computer"},{"key":"8_CR8","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. SIGMOD Record (ACM Special Interest Group on Management of Data)\u00a028(2) (1999)","DOI":"10.1145\/304181.304196"},{"key":"8_CR9","series-title":"ACM SIGMOD Record","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/276304.276307","volume-title":"Proceedings ofthe ACM SIGMOD International Conference on Management of Data (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 associations rules. In: Proceedings ofthe ACM SIGMOD International Conference on Management of Data (SIGMOD 1998), June 1-4. ACM SIGMOD Record, vol.\u00a027(2), pp. 13\u201324. ACM Press, New York (1998)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/347090.347166","volume-title":"Proceedinmgs of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2000)","author":"J. Pei","year":"2000","unstructured":"Pei, J., Han, J.: Can we push more constraints into frequent pattern mining? In: Ramakrishnan, R., et al. (eds.) Proceedinmgs of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2000), August 20-23, pp. 350\u2013354. ACM Press, New York (2000)"},{"key":"8_CR11","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: ICDE 2001, pp. 433\u2013442 (2001)"},{"key":"8_CR12","first-page":"67","volume-title":"Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining, KDD","author":"R. Srikant","year":"1997","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Heckerman, D., et al. (eds.) Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining, KDD, August 14-17, pp. 67\u201373. AAAI Press, Menlo Park (1997)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39804-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T23:53:20Z","timestamp":1552607600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39804-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200857","9783540398042"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39804-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}