{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:02:57Z","timestamp":1725562977459},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642158827"},{"type":"electronic","value":"9783642158834"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15883-4_30","type":"book-chapter","created":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T09:29:46Z","timestamp":1282037386000},"page":"467-482","source":"Crossref","is-referenced-by-count":8,"title":["Integrating Constraint Programming and Itemset Mining"],"prefix":"10.1007","author":[{"given":"Siegfried","family":"Nijssen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"30_CR2","first-page":"1087","volume-title":"SDM","author":"H. Arimura","year":"2009","unstructured":"Arimura, H., Uno, T.: Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems. In: SDM, pp. 1087\u20131098. SIAM, Philadelphia (2009)"},{"key":"30_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-74976-9_37","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"M. Boley","year":"2007","unstructured":"Boley, M., Horv\u00e1th, T., Poign\u00e9, A., Wrobel, S.: Efficient closed pattern mining in strongly accessible set systems. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol.\u00a04702, pp. 382\u2013389. Springer, Heidelberg (2007)"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.is.2008.02.007","volume":"34","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Giannotti, F., Lucchese, C., Orlando, S., Perego, R., Trasarti, R.: A constraint-based querying system for exploratory pattern discovery. Inf. Syst.\u00a034(1), 3\u201327 (2009)","journal-title":"Inf. Syst."},{"key":"30_CR5","unstructured":"Borgelt, C.: Efficient implementations of Apriori and Eclat. In: Workshop of Frequent Item Set Mining Implementations, FIMI (2003)"},{"issue":"3","key":"30_CR6","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, W.M.: Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Min. Knowl. Discov.\u00a07(3), 241\u2013272 (2003)","journal-title":"Data Min. Knowl. Discov."},{"issue":"11","key":"30_CR7","first-page":"1490","volume":"17","author":"D. Burdick","year":"2005","unstructured":"Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: MAFIA: A maximal frequent itemset algorithm. IEEE TKDE\u00a017(11), 1490\u20131504 (2005)","journal-title":"IEEE TKDE"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: KDD, pp. 204\u2013212 (2008)","DOI":"10.1145\/1401890.1401919"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: report on FIMI 2003. In: SIGKDD Explorations, volume\u00a06, pp. 109\u2013117 (2004)","DOI":"10.1145\/1007730.1007744"},{"issue":"8","key":"30_CR10","doi-asserted-by":"crossref","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. IEEE Computer\u00a032(8), 46\u201350 (1999)","journal-title":"IEEE Computer"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Guns, T., De Raedt, L.: Correlated itemset mining in ROC space: a constraint programming approach. In: KDD, pp. 647\u2013656 (2009)","DOI":"10.1145\/1557019.1557092"},{"key":"30_CR13","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"F. Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., Amsterdam (2006)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. Transactions on Programming Languages and Systems 31(1) (2008)","DOI":"10.1145\/1452044.1452046"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In: OSDM 2005: Proceedings of the 1st International Workshop on Open Source Data Mining, pp. 77\u201386 (2005)","DOI":"10.1145\/1133905.1133916"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15883-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:16Z","timestamp":1606185736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15883-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158827","9783642158834"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15883-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}