{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:52:49Z","timestamp":1725558769748},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202936"},{"type":"electronic","value":"9783540396444"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39644-4_11","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T19:38:23Z","timestamp":1277840303000},"page":"114-127","source":"Crossref","is-referenced-by-count":1,"title":["Performance Analysis of a Greedy Algorithm for Inferring Boolean Functions"],"prefix":"10.1007","author":[{"given":"Daiji","family":"Fukagawa","sequence":"first","affiliation":[]},{"given":"Tatsuya","family":"Akutsu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. SIGMOD Conference 1993, Washington, D.C, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-61332-3_163","volume-title":"Computing and Combinatorics","author":"T. Akutsu","year":"1996","unstructured":"Akutsu, T., Bao, F.: Approximating Minimum Keys and Optimal Substructure Screens. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 290\u2013299. Springer, Heidelberg (1996)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Miyano, S., Kuhara, S.: Identification of Genetic Networks from a Small Number of Gene Expression Patterns Under the Boolean Network Model. In: Proc. Pacific Symposium on Biocomputing, pp. 17\u201328 (1999)","DOI":"10.1142\/9789814447300_0003"},{"key":"11_CR4","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Discovery Science","year":"2000","unstructured":"Akutsu, T., Miyano, S., Kuhara, S.: A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. Theoretical Computer Science\u00a0292, 481\u2013495 (2003); Preliminary version has appeared in Morishita, S., Arikawa, S. (eds.): DS 2000. LNCS (LNAI), vol.\u00a01967. Springer, Heidelberg (2000)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"A. Blum","year":"1997","unstructured":"Blum, A., Langley, P.: Selection of Relevant Features and Examples in Machine Learning. Artificial Intelligence\u00a097, 245\u2013271 (1997)","journal-title":"Artificial Intelligence"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1024653703689","volume":"39","author":"E. Boros","year":"2003","unstructured":"Boros, E., Horiyama, T., Ibaraki, T., Makino, K., Yagiura, M.: Finding Essential Attributes from Binary Data. Annals of Mathematics and Artificial Intelligence\u00a039, 223\u2013257 (2003)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-59286-5_55","volume-title":"Machine Learning: ECML-95","author":"D. Gamberger","year":"1995","unstructured":"Gamberger, D.: A Minimization Approach to Propositional Inductive Learning. In: Lavra\u010d, N., Wrobel, S. (eds.) ECML 1995. LNCS, vol.\u00a0912, pp. 151\u2013160. Springer, Heidelberg (1995)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-62858-4_76","volume-title":"Machine Learning: ECML\u201997","author":"D. Gamberger","year":"1997","unstructured":"Gamberger, D., Lavrac, N.: Conditions for Occam\u2019s Razor Applicability and Noise Elimination. In: van Someren, M., Widmer, G. (eds.) ECML 1997. LNCS, vol.\u00a01224, pp. 108\u2013123. Springer, Heidelberg (1997)"},{"key":"11_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. The MIT Press, Cambridge (1994)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0743-1066(99)00019-9","volume":"40","author":"N. Lavrac","year":"1999","unstructured":"Lavrac, N., Gamberger, D., Jovanoski, V.: A Study of Relevance for Learning in Deductive Databases. Journal of Logic Programming\u00a040, 215\u2013249 (1999)","journal-title":"Journal of Logic Programming"},{"key":"11_CR11","first-page":"285","volume":"2","author":"N. Littlestone","year":"1987","unstructured":"Littlestone, N.: Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm. Machine Learning\u00a02, 285\u2013318 (1987)","journal-title":"Machine Learning"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(92)90031-5","volume":"40","author":"H. Mannila","year":"1992","unstructured":"Mannila, H., Raiha, K.-J.: On the Complexity of Inferring Functional Dependencies. Discrete Applied Mathematics\u00a040, 237\u2013243 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Univ. Press, Cambridge (1995)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1022611825350","volume":"5","author":"G. Pagallo","year":"1990","unstructured":"Pagallo, G., Haussler, D.: Boolean Feature Discovery in Empirical Learning. Machine Learning\u00a05, 71\u201399 (1990)","journal-title":"Machine Learning"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Tsai, C.-C., Marek-Sadowska, M.: Boolean Matching Using Generalized Reed- Muller Forms. In: Proc. Design Automation Conference, pp. 339\u2013344 (1994)","DOI":"10.1145\/196244.196404"},{"key":"11_CR16","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39644-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:42:24Z","timestamp":1605760944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39644-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202936","9783540396444"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39644-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}