{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:34:40Z","timestamp":1725564880019},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404941"},{"type":"electronic","value":"9783540450627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45062-7_25","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T02:14:10Z","timestamp":1283566450000},"page":"306-318","source":"Crossref","is-referenced-by-count":2,"title":["Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination"],"prefix":"10.1007","author":[{"given":"Weiru","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xin","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Kenny","family":"Adamson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Barnett, J.A.: Computational methods for a mathematical theory of evidence. In: Proc. of IJCAI 1981, Vancouver, BC, pp. 868\u2013875 (1981)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1002\/1098-111X(200011)15:11<1027::AID-INT4>3.0.CO;2-#","volume":"15","author":"A. Cano","year":"2000","unstructured":"Cano, A., Moral, S., Salmeron, A.: Penniless propagation in join trees. International Journal of Intelligent Systems\u00a015, 1027\u20131059 (2000)","journal-title":"International Journal of Intelligent Systems"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/BFb0028110","volume-title":"Uncertainty in Knowledge Bases","author":"D. Dubois","year":"1991","unstructured":"Dubois, D., Prade, H.: Inference in possibilistic hypergraphs. In: Bouchon-Meunier, B., Zadeh, L.A., Yager, R.R. (eds.) IPMU 1990. LNCS, vol.\u00a0521, pp. 228\u2013230. Springer, Heidelberg (1991)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0004-3702(85)90064-5","volume":"26","author":"J. Gordon","year":"1985","unstructured":"Gordon, J., Shortliffe, E.H.: A method for managing evidential reasoning in a hierarchical hypothesis space. Artificial Intelligence\u00a026, 323\u2013357 (1985)","journal-title":"Artificial Intelligence"},{"key":"25_CR5","unstructured":"Liu, W., Hong, X., Adamson, K.: Parallel implementation of evidence combination in qualitative Markov tress. Technical Report, University of Ulster"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0004-3702(99)00062-4","volume":"113","author":"A. Madsen","year":"1999","unstructured":"Madsen, A., Jensen, F.: LAZY propagation: A junction tree inference algorithm based on lazy propagation. Artificial Intelligence\u00a0113, 203\u2013245 (1999)","journal-title":"Artificial Intelligence"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/S0167-8191(98)00004-0","volume":"24","author":"P. Maheshwari","year":"1998","unstructured":"Maheshwari, P., Shen, H.: An efficient clustering algorithm for partitioning parallel programs. Parallel Computing\u00a024, 893\u2013909 (1998)","journal-title":"Parallel Computing"},{"key":"25_CR8","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Mateo (1988)"},{"key":"25_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214696","volume-title":"A mathematical theory of evidence","author":"G. Shafer","year":"1976","unstructured":"Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0004-3702(87)90040-3","volume":"33","author":"G. Shafer","year":"1987","unstructured":"Shafer, G., Logan, R.: Implementing Dempster\u2019s rule for hierarchical evidence. Artificial Intelligence\u00a033, 271\u2013298 (1987)","journal-title":"Artificial Intelligence"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0888-613X(87)90024-7","volume":"1","author":"G. Shafer","year":"1987","unstructured":"Shafer, G., Shenoy, P., Mellouli, K.: Propagating belief functions in qualitative Markov trees. Int. J. of Approx. Reasoning.\u00a01, 349\u2013400 (1987)","journal-title":"Int. J. of Approx. Reasoning."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Shenoy, P.: Binary join trees. In: Proc. of UAI 1996, pp. 492\u2013499 (1996)","DOI":"10.1149\/199607.0492PV"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0888-613X(97)89135-9","volume":"17","author":"P. Shenoy","year":"1997","unstructured":"Shenoy, P.: Binary join trees for computing marginals in the Shenoy-Shafer architecture. Int. J. of Approx. Reasoning\u00a017, 239\u2013263 (1997)","journal-title":"Int. J. of Approx. Reasoning"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MEX.1986.4306979","volume":"1","author":"P. Shenoy","year":"1986","unstructured":"Shenoy, P., Shafer, G.: Propagating belief functions with local computations. IEEE Expert\u00a01, 43\u201352 (1986)","journal-title":"IEEE Expert"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0004-3702(93)90072-J","volume":"61","author":"B. Tessem","year":"1993","unstructured":"Tessem, B.: Approximations for efficient computation in the theory of evidence. Artificial Intelligence\u00a061, 315\u2013329 (1993)","journal-title":"Artificial Intelligence"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/S0020-7373(89)80032-X","volume":"30","author":"F. Voorbraak","year":"1989","unstructured":"Voorbraak, F.: A computationally efficient approximation of Dempster-Shafer theory. International Journal of Man-Machine Studies\u00a030, 525\u2013536 (1989)","journal-title":"International Journal of Man-Machine Studies"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Wilson, N.: A Monte-Carlo algorithm for Dempster-Shafer belief. In: Proc. of UAI 1991, p. 414 (1991)","DOI":"10.1016\/B978-1-55860-203-8.50058-9"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45062-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T06:30:31Z","timestamp":1636353031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45062-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404941","9783540450627"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45062-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}