{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:20Z","timestamp":1725663920368},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573692"},{"type":"electronic","value":"9783540480938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57369-0_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:54:41Z","timestamp":1330260881000},"page":"229-239","source":"Crossref","is-referenced-by-count":1,"title":["On PAC learnability of functional dependencies"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Atsuhiro","family":"Takasu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"20_CR1","unstructured":"T. Akutsu and A. Takasu. \u201cOn PAC learnability of functional dependencies in relational databases\u201d. In Proceedings of the 6th Conference of Japanese Society of Artificial Intelligence, pp. 327\u2013330, (in Japanese) 1992."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1990","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. \u201cLearnability and the Vapnik-Chervonenkis dimension\u201d. Journal of the ACM, Vol. 36, pp. 929\u2013965, 1990.","journal-title":"Journal of the ACM"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E. F. Codd","year":"1970","unstructured":"E. F. Codd. \u201cA relational model for large shared data banks\u201d. Communications of the ACM, Vol. 13, pp. 377\u2013387, 1970.","journal-title":"Communications of the ACM"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/322326.322330","volume":"29","author":"P. Honeyman","year":"1982","unstructured":"P. Honeyman. \u201cTesting satisfaction of functional dependencies\u201d. Journal of the ACM, Vol. 29, pp. 668\u2013677, 1982.","journal-title":"Journal of the ACM"},{"key":"20_CR5","volume-title":"Machine Learning \u2014 A Theoretical Approach","author":"B. K. Natarajan","year":"1991","unstructured":"B. K. Natarajan. \u201cMachine Learning \u2014 A Theoretical Approach\u201d. Morgan Kaufmann, CA, 1991."},{"key":"20_CR6","unstructured":"G. Piatetsky-Shapiro. \u201cDiscovery and analysis of strong rules in databases\u201d. In Proceedings of Advanced Database System Symposium '89, pp. 135\u2013142, 1989."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J. R. Quinlan","year":"1989","unstructured":"J. R. Quinlan and R. L. Rivest. \u201cInferring decision trees using the minimum description length principle\u201d. Information and Computation, Vol. 80, pp. 227\u2013248, 1989.","journal-title":"Information and Computation"},{"key":"20_CR8","unstructured":"K. Sonoo, H. Kawano, S. Nishio, and T. Hasegawa. \u201cAccuracy evaluation of rules derived from sample data in VLKD\u201d. In Proceedings of the 5th Conference of Japanese Society of Artificial Intelligence, pp. 181\u2013184, (in Japanese) 1991."},{"key":"20_CR9","unstructured":"J. D. Ullman. \u201cPrinciples of Database and Knowledge-Base Systems \u2014 Volume 1\u201d. Computer Science Press, 1988."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. \u201cA theory of the learnable\u201d. Communications of the ACM, Vol. 27, pp. 1134\u20131142, 1984.","journal-title":"Communications of the ACM"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/0214019","volume":"14","author":"D. E. Willard","year":"1985","unstructured":"D. E. Willard. \u201cNew data structures for orthogonal range queries\u201d. SIAM Journal on Computing, Vol. 14, pp. 232\u2013253, 1985.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57369-0_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:33Z","timestamp":1619571873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57369-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573692","9783540480938"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57369-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}