{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:17:43Z","timestamp":1725538663162},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047466"},{"type":"electronic","value":"9783642047473"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04747-3_10","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T05:06:12Z","timestamp":1254805572000},"page":"92-106","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Constraint-Based Theory Extraction"],"prefix":"10.1007","author":[{"given":"Mario","family":"Boley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"10_CR2","first-page":"11","volume-title":"ICDM","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAMiner: Optimized level-wise frequent pattern mining with monotone constraint. In: ICDM, pp. 11\u201318. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/MIS.2005.45","volume":"20","author":"F. Bonchi","year":"2005","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Exante: A preprocessing method for frequent-pattern mining. IEEE Intelligent Systems\u00a020(3), 25\u201331 (2005)","journal-title":"IEEE Intelligent Systems"},{"key":"10_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11430919_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F. Bonchi","year":"2005","unstructured":"Bonchi, F., Lucchese, C.: Pushing tougher constraints in frequent pattern mining. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 114\u2013124. Springer, Heidelberg (2005)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/3-540-45841-7_10","volume-title":"STACS 2002","author":"E. Boros","year":"2002","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, p. 733. Springer, Heidelberg (2002)"},{"issue":"3","key":"10_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.: DualMiner: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery\u00a07(3), 241\u2013272 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/312129.312191","volume-title":"KDD 1999: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"G. Dong","year":"1999","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: KDD 1999: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 43\u201352. ACM, New York (1999)"},{"key":"10_CR8","first-page":"146","volume-title":"ICDM","author":"M. El-Hajj","year":"2005","unstructured":"El-Hajj, M., Za\u00efane, O.R., Nalos, P.: Bifold constraint-based mining by simultaneous monotone and anti-monotone checking. In: ICDM, pp. 146\u2013153. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"10_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11871637_17","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"J. Fischer","year":"2006","unstructured":"Fischer, J., Heun, V., Kramer, S.: Optimal string mining under frequency constraints. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 139\u2013150. Springer, Heidelberg (2006)"},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient algorithms for listing combinatorial structures","author":"L.A. Goldberg","year":"1993","unstructured":"Goldberg, L.A.: Efficient algorithms for listing combinatorial structures. Cambridge University Press, New York (1993)"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D. Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. ACM Trans. Database Syst.\u00a028(2), 140\u2013174 (2003)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery\u00a08(1), 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett.\u00a027(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"E.L. Lawler","year":"1980","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Generating all maximal independent sets: Np-hardness and polynomial-time algorithms. SIAM J. Comput.\u00a09(3), 558\u2013565 (1980)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR15","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 Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10_CR16","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. Artificial Intelligence\u00a018, 203 (1982)","journal-title":"Artificial Intelligence"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J.: Can we push more constraints into frequent pattern mining? In: KDD, pp. 350\u2013354 (2000)","DOI":"10.1145\/347090.347166"},{"key":"10_CR18","first-page":"853","volume-title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001","author":"L. Raedt De","year":"2001","unstructured":"De Raedt, L., Kramer, S.: The levelwise version space algorithm and its application to molecular fragment finding. In: Nebel, B. (ed.) Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001, pp. 853\u2013862. Morgan Kaufmann, San Francisco (2001)"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R.C. Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks\u00a05, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Saigo, H., Nowozin, S., Kadowaki, T., Kudo, T., Tsuda, K.: gBoost: A mathematical programming approach to graph classification and regression. Machine Learning (2009)","DOI":"10.1007\/s10994-008-5089-z"},{"issue":"1-4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1018905417023","volume":"24","author":"R.H. Sloan","year":"1998","unstructured":"Sloan, R.H., Takata, K., Tur\u00e1n, G.: On frequent sets of boolean matrices. Annals of Mathematics and Artificial Intelligence\u00a024(1-4), 193\u2013209 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2004.12.014","volume":"335","author":"L. Wang","year":"2005","unstructured":"Wang, L., Zhao, H., Dong, G., Li, J.: On the complexity of finding emerging patterns. Theoretical Computer Science\u00a0335(1), 15\u201327 (2005); Pattern Discovery in the Post Genome","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2006.05.029","volume":"362","author":"G. Yang","year":"2006","unstructured":"Yang, G.: Computational aspects of mining maximal frequent patterns. Theoretical Computer Science\u00a0362(1-3), 63\u201385 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04747-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T04:04:59Z","timestamp":1552190699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04747-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047466","9783642047473"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04747-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}