{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T17:10:37Z","timestamp":1706893837414},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T00:00:00Z","timestamp":1138838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s00778-005-0170-8","type":"journal-article","created":{"date-parts":[[2006,1,30]],"date-time":"2006-01-30T07:31:28Z","timestamp":1138606288000},"page":"250-262","source":"Crossref","is-referenced-by-count":1,"title":["Dependency trees in sub-linear time and bounded memory"],"prefix":"10.1007","volume":"15","author":[{"given":"Dan","family":"Pelleg","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Moore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,2]]},"reference":[{"key":"170_CR1","unstructured":"Blake, C., Merz, C.: UCI repository of machine learning databases (1998) http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"170_CR2","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C.K. Chow","year":"1968","unstructured":"Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14, 462\u2013467 (1968)","journal-title":"IEEE Transactions on Information Theory"},{"key":"170_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill (1989)"},{"key":"170_CR4","unstructured":"Davies, S.: Scalable and practical probability density estimators for scientific anomaly detection. Doctoral dissertation, Carnegie-Mellon University (2002)"},{"key":"170_CR5","doi-asserted-by":"crossref","unstructured":"Domingos, P., Hulten, G.: Mining high-speed data streams. In Proceedings of 6th International Conference on Knowledge Discovery and Data Mining, pp. 71\u201380, N.Y., ACM Press (2000)","DOI":"10.1145\/347090.347107"},{"key":"170_CR6","unstructured":"Domingos, P., Hulten, G.: A general method for scaling up machine learning algorithms and its application to clustering. In Proceedings of the Eighteenth International Conference on Machine Learning. Morgan Kaufmann (2001a)"},{"key":"170_CR7","doi-asserted-by":"crossref","unstructured":"Domingos, P., Hulten, G.: Learning from infinite data in finite time. In Advances in Neural Information Processing Systems 14, Vancouver, British Columbia, Canada (2001b)","DOI":"10.7551\/mitpress\/1120.003.0091"},{"key":"170_CR8","unstructured":"Friedman, N., Goldszmidt, M., Lee, T.J.: Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting. In Proceedings of the Fifteenth International Conference on Machine Learning. Morgan Kaufmann, San Francisco, CA (1998)"},{"key":"170_CR9","unstructured":"Friedman, N., Nachman, I., Pe\u00e9r, D.: Learning bayesian network structure from massive datasets: The \u201csparse candidate\u201d algorithm. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99), pp. 206\u2013215. Stockholm, Sweden 1999)"},{"key":"170_CR10","doi-asserted-by":"crossref","unstructured":"Goldenberg, A., Moore, A.: Tractable learning of large bayes net structures from sparse data. In Proc. 21st International Conf. on Machine Learning (2004)","DOI":"10.1145\/1015330.1015406"},{"key":"170_CR11","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD archive, (1999) http:\/\/kdd.ics.uci.edu"},{"key":"170_CR12","unstructured":"Maron, O., Moore A.W.: Hoeffding races: Acdelerating model selection search for classification and function approximation. Advances in Neural Information Processing Systems, pp 59\u201366. Denver, Colorado, Morgan Kaufmann (1994)"},{"key":"170_CR13","unstructured":"Meila, M.: An accelerated Chow and Liu algorithm: fitting tree distributions to high dimensional sparse data. In Proceedings of the Sixteenth International Conference on Machine Learning (1999a)"},{"key":"170_CR14","unstructured":"Meila, M.: Learning with Mixtures of Trees. Doctoral dissertation. Massachusetts Institute of Technology (1999b)"},{"key":"170_CR15","doi-asserted-by":"crossref","unstructured":"Moore, A.W., Lee M.S.: Efficient algorithms fro minimizing cross validation error. In Proceedings of the Eleventh International Conference on Machine Learning, pp. 190\u2013198 New Brunswick, US: Morgan Kaufmann (1994)","DOI":"10.1016\/B978-1-55860-335-6.50031-3"},{"key":"170_CR16","unstructured":"Pelleg, D.: Scalable and Practical Probability Density Estimators for Scientific Anomaly Detection. Doctoral dissertation, Carnegie-Mellon University (2004)"},{"key":"170_CR17","unstructured":"Reza, F.: An Introduction to Information Theory. Dover Publications, pp. 282\u2013283. New York (1994)"},{"key":"170_CR18","unstructured":"SDSS. The Sloan Digital Sky Survey. (1998) http:\/\/www.sdss.org"},{"key":"170_CR19","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms, Vol. 44 of CBMS-NSF Reg. Conf. Ser. Appl. Math. SIAM (1983)","DOI":"10.1137\/1.9781611970265"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0170-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-005-0170-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0170-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T16:29:29Z","timestamp":1706891369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-005-0170-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2,2]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["170"],"URL":"https:\/\/doi.org\/10.1007\/s00778-005-0170-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2,2]]}}}