{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:03Z","timestamp":1725489303050},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667131"},{"type":"electronic","value":"9783540468462"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46846-3_9","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T03:55:34Z","timestamp":1187150134000},"page":"92-102","source":"Crossref","is-referenced-by-count":4,"title":["Schema Design for Causal Law Mining from Incomplete Database"],"prefix":"10.1007","author":[{"given":"Kazunori","family":"Matsumoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Hashimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,10,22]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. proceedings of the ACM SIGMOD Conference on Management of Data, 1993.","DOI":"10.1145\/170035.170072"},{"key":"9_CR3","series-title":"IBM Research Report","volume-title":"Fast Algorithms for Mining Association Rules","author":"R. Agrawal","year":"1993","unstructured":"R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. IBM Research Report RJ9839, June 1993, IBM Almaden Research Center, San Jose, Calif.."},{"issue":"12","key":"9_CR4","first-page":"2481","volume":"E81-B","author":"K. Matsumoto","year":"1998","unstructured":"K. Matsumoto and K. Hashimoto. Association Rule Filter for Data Mining in Call Tracking Data. IEICE Transactions on Communication, E81-B, No. 12, pp. 2481\u20132486, 1998.","journal-title":"IEICE Transactions on Communication"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H. Akaike","year":"1974","unstructured":"H. Akaike. A New Look at the Statistical Model Identification. IEEE Transactions on Automatic Control, 19:716\u2013723, 1974.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"9_CR6","unstructured":"R. Zembowicz and J. M. \u017bytkow. Testing the existence of Functional Relationships in Data. AAAI Workshop on Knowledge Discovery in Database, 1993."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"D. Heckerman, D. Geiger, and D. Chickering. Learning Bayesian Networks: The Combination of Knowledge and Statistical Data. Machine Learning, 1995.","DOI":"10.1007\/BF00994016"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1111\/j.1467-8640.1994.tb00166.x","volume":"10","author":"W. Lam","year":"1994","unstructured":"W. Lam and F. Bacchaus. Learning Bayesian belief networks: An approach based on the MDL principle. em Computational Intelligence, 10:269\u2013293, 1994.","journal-title":"em Computational Intelligence"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"D._M. Chickering. Learning Baysean network is NP-complete. in Learning from Data: Artificial Intelligence and Statistics V, Springer Verlag, 1996.","DOI":"10.1007\/978-1-4612-2404-4_12"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"N. Friedman and M. Goldszmidt. Learning Baysean Networks with Local Strucures. in Learning in Graphical Models, MIT Press, 1999.","DOI":"10.1007\/978-94-011-5014-9_15"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen. Modeling by shortest data description. In Automatica, 14:465\u2013471, 1978.","journal-title":"Automatica"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46846-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:16:43Z","timestamp":1556749003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46846-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667131","9783540468462"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46846-3_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}