{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:22Z","timestamp":1760596222538},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260769"},{"type":"electronic","value":"9783540319351"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_15","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T02:06:46Z","timestamp":1283825206000},"page":"114-124","source":"Crossref","is-referenced-by-count":43,"title":["Pushing Tougher Constraints in Frequent Pattern Mining"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Lucchese","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of VLDB 1994 (1994)"},{"key":"15_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39804-2_7","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Adaptive Constraint Pushing in frequent pattern mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 47\u201358. Springer, Heidelberg (2003)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAMiner: Optimized level-wise frequent pattern mining with monotone constraints. In: Proceedings of ICDM 2003 (2003)","DOI":"10.1109\/ICDM.2003.1250892"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39804-2_7","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, vol.\u00a02838, pp. 47\u201358. Springer, Heidelberg (2003)"},{"key":"15_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-24775-3_19","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F. Bonchi","year":"2004","unstructured":"Bonchi, F., Goethals, B.: FP-Bonsai: the art of growing and pruning small fp-trees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 155\u2013160. Springer, Heidelberg (2004)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Proceedings of ICDM 2004 (2004)","DOI":"10.1109\/ICDM.2004.10093"},{"key":"15_CR7","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 ACM SIGKDD 2002 (2002)","DOI":"10.1145\/775047.775054"},{"key":"15_CR8","unstructured":"De Raedt, L., Kramer, S.: The levelwise version space algorithm and its application to molecular fragment finding. In: Proceedings of IJCAI 2001 (2001)"},{"key":"15_CR9","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":"15_CR10","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":"15_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD 2000 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"4","key":"15_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.3233\/IDA-2002-6404","volume":"6","author":"B. Jeudy","year":"2002","unstructured":"Jeudy, B., Boulicaut, J.-F.: Optimization of association rule mining queries. Intelligent Data Analysis Journal\u00a06(4), 341\u2013357 (2002)","journal-title":"Intelligent Data Analysis Journal"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kifer, D., Gehrke, J., Bucila, C., White, W.: How to quicklyfind a witness. In: Proceedings of PODS 2003 (2003)","DOI":"10.1145\/773153.773180"},{"key":"15_CR14","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\u00a028(2) (1999)","DOI":"10.1145\/304181.304196"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of the ACM SIGMOD 1998 (1998)","DOI":"10.1145\/276304.276307"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J.: Can we push more constraints into frequent pattern mining? In: Proceedings of ACM SIGKDD 2000 (2000)","DOI":"10.1145\/347090.347166"},{"key":"15_CR17","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: Proceedings of ICDE 2001 (2001)"},{"key":"15_CR18","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceedings of ACM SIGKDD 1997 (1997)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11430919_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:57:31Z","timestamp":1605625051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11430919_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}