{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:29:16Z","timestamp":1743053356952,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332923"},{"type":"electronic","value":"9783540332930"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11733492_12","type":"book-chapter","created":{"date-parts":[[2006,3,4]],"date-time":"2006-03-04T11:29:53Z","timestamp":1141471793000},"page":"202-221","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Virtual Patterns for Automatically Pruning the Search Space"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Soulet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"487","volume-title":"VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"12_CR2","first-page":"3","volume-title":"ICDE","author":"R. Agrawal","year":"1995","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Yu, P.S., Chen, A.L.P. (eds.) ICDE, pp. 3\u201314. IEEE Computer Society, Los Alamitos (1995)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: The hows, whys, and whens of constraints in itemset and rule discovery. In: Proceedings of the Workshop on Inductive Databases and Constraint Based Mining (2005)","DOI":"10.1007\/11615576_1"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11733492_4","volume-title":"Knowledge Discovery in Inductive Databases","author":"J. Besson","year":"2006","unstructured":"Besson, J., Pensa, R., Robardet, C., Boulicaut, J.-F.: Constraint-based mining of fault-tolerant patterns from boolean data. In: Bonchi, F., Boulicaut, J.-F. (eds.) KDID 2005. LNCS, vol.\u00a03933, pp. 55\u201371. Springer, Heidelberg (2006)"},{"key":"12_CR5","first-page":"359","volume-title":"SIGMOD Conference","author":"K.S. Beyer","year":"1999","unstructured":"Beyer, K.S., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. In: Delis, A., Faloutsos, C., Ghandeharizadeh, S. (eds.) SIGMOD Conference, pp. 359\u2013370. ACM Press, New York (1999)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","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. 59\u201370. Springer, Heidelberg (2003)"},{"key":"12_CR7","first-page":"35","volume-title":"ICDM","author":"F. Bonchi","year":"2004","unstructured":"Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: ICDM, pp. 35\u201342. IEEE Computer Society, Los Alamitos (2004)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: Pushing tougher constraints in frequent pattern mining. In: Ho, et al. (eds.) [14], pp. 114\u2013124","DOI":"10.1007\/11430919_15"},{"key":"12_CR9","first-page":"42","volume-title":"KDD","author":"C. Bucila","year":"2002","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.M.: Dualminer: a dual-pruning algorithm for itemsets with constraints. In: KDD, pp. 42\u201351. ACM, New York (2002)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/312129.312191","volume-title":"Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 1999)","author":"G. Dong","year":"1999","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 1999), pp. 43\u201352. ACM Press, New York (1999)"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/1014052.1014070","volume-title":"KDD","author":"K. Gade","year":"2004","unstructured":"Gade, K., Wang, J., Karypis, G.: Efficient closed pattern mining in the presence of tough block constraints. In: Kim, W., Kohavi, R., Gehrke, J., DuMouchel, W. (eds.) KDD, pp. 138\u2013147. ACM, New York (2004)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-30214-8_22","volume-title":"Discovery Science","author":"F. Geerts","year":"2004","unstructured":"Geerts, F., Goethals, B., Mielik\u00e4inen, T.: Tiling databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS, vol.\u00a03245, pp. 278\u2013289. Springer, Heidelberg (2004)"},{"key":"12_CR13","first-page":"1","volume-title":"SIGMOD Conference","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) SIGMOD Conference, pp. 1\u201312. ACM, New York (2000)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Knowledge Discovery and Data Mining","year":"2005","unstructured":"Ho, T.-B., Cheung, D., Liu, H. (eds.): PAKDD 2005. LNCS, vol.\u00a03518. Springer, Heidelberg (2005)"},{"issue":"11","key":"12_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Commun. ACM\u00a039(11), 58\u201364 (1996)","journal-title":"Commun. ACM"},{"key":"12_CR16","first-page":"272","volume-title":"PODS","author":"D. Kifer","year":"2003","unstructured":"Kifer, D., Gehrke, J., Bucila, C., White, W.M.: How to quickly find a witness. In: PODS, pp. 272\u2013283. ACM, New York (2003)"},{"key":"12_CR17","first-page":"313","volume-title":"ICDM","author":"M. Kuramochi","year":"2001","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) ICDM, pp. 313\u2013320. IEEE Computer Society, Los Alamitos (2001)"},{"key":"12_CR18","unstructured":"Lee, S.D., Raedt, L.D.: An algebra for inductive query evaluation. In: Proceedings of the Second International Workshop on Inductive Databases (KDID 2003), Rudjer Boskovic Institute, Zagreb, Croatia, pp. 80\u201396 (September 2003)"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov.\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Min. Knowl. Discov."},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","volume":"18","author":"T.M. Mitchell","year":"1982","unstructured":"Mitchell, T.M.: Generalization as search. Artif. Intell.\u00a018(2), 203\u2013226 (1982)","journal-title":"Artif. Intell."},{"key":"12_CR21","first-page":"13","volume-title":"SIGMOD Conference","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 association rules. In: Haas, L.M., Tiwary, A. (eds.) SIGMOD Conference, pp. 13\u201324. ACM Press, New York (1998)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"key":"12_CR23","first-page":"433","volume-title":"ICDE","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: ICDE, pp. 433\u2013442. IEEE Computer Society, Los Alamitos (2001)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Soulet, A., Cr\u00e9milleux, B.: An efficient framework for mining flexible constraints. In: Ho, et al. (eds.) [14], pp. 661\u2013671","DOI":"10.1007\/11430919_76"},{"key":"12_CR25","unstructured":"Soulet, A., Cr\u00e9milleux, B.: Optimizing constraint-based mining by automatically relaxing constraints. In: Proceedings of The Fifth IEEE International Conference on Data Mining (ICDM 2005) (2005)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11733492_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T05:44:21Z","timestamp":1706939061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11733492_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332923","9783540332930"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11733492_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}