{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:27Z","timestamp":1725489027468},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413523"},{"type":"electronic","value":"9783540444183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44418-1_8","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:00:14Z","timestamp":1186880414000},"page":"86-98","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Greedy Algorithm for Finding Functional Relations: Efficient Implementation and Average Case Analysis"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoru","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoru","family":"Kuhara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. Proc. ACM SIGMOD Conference on Management of Data (1993) 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"8_CR2","unstructured":"Akutsu, T., Takasu, A.: Inferring approximate functional dependencies from example data. Proc. AAAI93 Workshop on Knowledge Discovery in Databases (1993) 138\u2013152"},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-61332-3_163","volume-title":"Approximating minimum keys and optimal substructure screens","author":"T. Akutsu","year":"1996","unstructured":"Akutsu, T., Bao, F.: Approximating minimum keys and optimal substructure screens. Lecture Notes in Computer Science 1090 (1996) 290\u2013299"},{"key":"8_CR4","unstructured":"Akutsu, T., Miyano, S., Kuhara, S.: Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function. Proc. 4th ACM Conf. Computational Molecular Biology (2000) 8\u201314"},{"key":"8_CR5","unstructured":"Akutsu, T., Miyano, S.: Selecting informative genes for cancer classification using gene expression data, Unpublished Manuscript."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progression. J. Symbolic Computation 9 (1990) 251\u2013280","journal-title":"J. Symbolic Computation"},{"key":"8_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge, MA (1990)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Computer and System Sciences 9 (1974) 256\u2013278","journal-title":"J. Computer and System Sciences"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Kivinen, J., Mannila, J.: Approximate dependency inference from relations. Proc. 4th Int. Conf. Database Theory (1992) 86\u201398","DOI":"10.1007\/3-540-56039-4_34"},{"key":"8_CR10","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.: Dependency inference. Proc. 13th VLDB Conference(1987) 155\u2013158"},{"key":"8_CR11","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., R\u00e4ih\u00e4, K.: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40 (1992) 237\u2013243","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR12","unstructured":"Quinlan, J. R.: C4.5 Programs for Machine Learning. (1993) Morgan Kaufmann"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/cplx.6130010612","volume":"1","author":"R. Somogyi","year":"1996","unstructured":"Somogyi, R., Sniegoski, C. A.: Modeling the complexity of genetic networks: Understanding multigene and pleiotropic regulation. Complexity 1 (1996) 45\u201363","journal-title":"Complexity"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44418-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T13:38:06Z","timestamp":1550756286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44418-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413523","9783540444183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44418-1_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}