{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:34:34Z","timestamp":1773246874945,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10994-005-0470-7","type":"journal-article","created":{"date-parts":[[2005,5,20]],"date-time":"2005-05-20T17:16:05Z","timestamp":1116609365000},"page":"323-354","source":"Crossref","is-referenced-by-count":24,"title":["TAN Classifiers Based on Decomposable Distributions"],"prefix":"10.1007","volume":"59","author":[{"given":"Jes\u00fas","family":"Cerquides","sequence":"first","affiliation":[]},{"given":"Ramon L\u00f3pez","family":"de M\u00c1ntaras","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"470_CR1","doi-asserted-by":"crossref","unstructured":"Cerquides, J. (1999). Applying general Bayesian techniques to improve TAN induction. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, KDD99 (pp. 292\u2013296).","DOI":"10.1145\/312129.312256"},{"key":"470_CR2","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C. Chow","year":"1968","unstructured":"Chow, C., & Liu, C. (1968). Aproximatting discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14, 462\u2013497.","journal-title":"IEEE Transactions on Information Theory"},{"key":"470_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007413511361","volume":"29","author":"P. Domingos","year":"1997","unstructured":"Domingos, P., & Pazzani, M. (1997). On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29, 103\u2013130.","journal-title":"Machine Learning"},{"key":"470_CR4","unstructured":"Fawcett, T. (2003). Roc graphs: Notes and practical considerations for data mining researchers. Technical Report HPL-2003-4, HP Laboratories Palo Alto."},{"key":"470_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1007465528199","volume":"29","author":"N. Friedman","year":"1997","unstructured":"Friedman, N., Geiger, D., & Goldszmidt, M. (1997).Bayesian network classifiers. Machine Learning, 29, 131\u2013163.","journal-title":"Machine Learning"},{"issue":"2","key":"470_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1010920819831","volume":"45","author":"D. Hand","year":"2001","unstructured":"Hand, D. & Till, R. (2001). A simple generalization of the area under the roc curve to multiple class classification problems. Machine Learning, 45:2, 171\u201386.","journal-title":"Machine Learning"},{"key":"470_CR7","first-page":"197","volume":"20","author":"D. Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., & Chickering, D. (1995). Learning bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20, 197\u2013243.","journal-title":"Machine Learning"},{"key":"470_CR8","unstructured":"Ide, J., & Cozman, F. (2003). Generation of random bayesian networks with constraints on induced width, with applications to the average analysis od d-connectivity, quasi-random sampling, and loopy propagation. Technical report, University of Sao Paulo."},{"issue":"2","key":"470_CR9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/0210017","volume":"10","author":"N. Katoh","year":"1981","unstructured":"Katoh, N., Ibaraki, T., & Mine, H. (1981). An algorithm for finding k minimum spanning trees. SIAM J. Comput., 10:2, 247\u201355.","journal-title":"SIAM J. Comput."},{"key":"470_CR10","doi-asserted-by":"crossref","unstructured":"Kontkanen, P., Myllymaki, P., Silander, T., & Tirri H. (1998). Bayes Optimal Instance-Based Learning. In Machine Learning: ECML-98, Proceedings of the 10th European Conference, volume 1398 of Lecture Notes in Artificial Intelligence (pp. 77\u201388). Springer-Verlag.","DOI":"10.1007\/BFb0026675"},{"key":"470_CR11","unstructured":"Langley, P., Iba, W., & Thompson, K. (1992). An analysis of Bayesian classifiers. In Proceedings of the Tenth National Conference on Artificial Intelligence (pp. 223\u2013228). AAAI Press and MIT Press."},{"key":"470_CR12","unstructured":"Meila, M., & Jaakkola, T. (2000a). Tractable bayesian learning of tree belief networks. In Proc. of the Sixteenth Conference on Uncertainty in Artificial Intelligence (pp. 380\u2013388)."},{"key":"470_CR13","unstructured":"Meila, M., & Jaakkola, T. (2000b). Tractable bayesian learning of tree belief networks. Technical Report CMU-RI-TR-00-15, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA."},{"issue":"1","key":"470_CR14","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/505241.505243","volume":"49","author":"S. Pettie","year":"2002","unstructured":"Pettie, S., & Ramachandran, V. (2002). An optimal minimum spanning tree algorithm. Journal of the ACM (JACM), 49:1, 16\u201334.","journal-title":"Journal of the ACM (JACM)"},{"key":"470_CR15","unstructured":"Shoup, V. (2003). NTL: A library for doing number theory. http:\/\/www.shoup.net\/ntl."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-005-0470-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-005-0470-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-005-0470-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:19Z","timestamp":1559353219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-005-0470-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["470"],"URL":"https:\/\/doi.org\/10.1007\/s10994-005-0470-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}