Semiring induced valuation algebras: Exact and approximate local computation algorithms

被引:36
|
作者
Kohlas, J. [2 ]
Wilson, N. [1 ]
机构
[1] Cork Constraint Computat Ctr, Dept Comp Sci, Cork, Ireland
[2] Univ Fribourg, Dept Informat, CH-1700 Fribourg, Switzerland
基金
爱尔兰科学基金会;
关键词
semirings; local computation; join tree decompositions; soft constraints; uncertainty; valuation networks; valuation algebras;
D O I
10.1016/j.artint.2008.03.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1360 / 1399
页数:40
相关论文
共 50 条
  • [41] Exact computation of Maximum Induced Forest
    Razgon, Igor
    ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 160 - 171
  • [42] Exact and approximate computation of the scatter halfspace depthExact and approximate computation of the scatter halfspace\ldotsX. Liu et al.
    Xiaohui Liu
    Yuzi Liu
    Petra Laketa
    Stanislav Nagy
    Yuting Chen
    Computational Statistics, 2025, 40 (1) : 547 - 572
  • [43] Exact and Approximate Map-Reduce Algorithms for Convex Hull
    Ghosh, Anirban
    Schwartz, Samuel
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 480 - 494
  • [44] Exact and approximate algorithms for movement problems on (special classes of) graphs
    Bilo, Davide
    Guala, Luciano
    Leucci, Stefano
    Proietti, Guido
    THEORETICAL COMPUTER SCIENCE, 2016, 652 : 86 - 101
  • [45] Exact and approximate algorithms for helical cone-beam CT
    Kudo, H
    Rodet, T
    Noo, F
    Defrise, M
    PHYSICS IN MEDICINE AND BIOLOGY, 2004, 49 (13): : 2913 - 2931
  • [46] Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
    Czekaj, Jacek
    Socha, Leslaw
    SYSTEM MODELING AND OPTIMIZATION, 2009, 312 : 220 - +
  • [47] Search algorithms for the multiple constant multiplications problem: Exact and approximate
    Aksoy, Levent
    Gunes, Ece Olcay
    Flores, Paulo
    MICROPROCESSORS AND MICROSYSTEMS, 2010, 34 (05) : 151 - 162
  • [48] Approximate and exact algorithms for an energy minimization traveling salesman problem
    Wang, Shijin
    Liu, Ming
    Chu, Feng
    JOURNAL OF CLEANER PRODUCTION, 2020, 249
  • [49] Approximate local isometries of Banach algebras of differentiable functions
    Hosseini, Maliheh
    Jimenez-Vargas, A.
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2021, 500 (01)
  • [50] The traveling purchaser problem with stochastic prices: Exact and approximate algorithms
    Kang, Seungmo
    Ouyang, Yanfeng
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 209 (03) : 265 - 272