Abstract

Two methods for studying the consistency problems of a class of binary relation inference networks are described. One method is derived using the mathematical concepts of energy function (Et) and delta energy function (ΔEt), where both functions have closely related geometrical interpretations. By properly formulating ΔEt as matrix quadratic form, network convergence is shown to be directly related to the matrix property of negative semidefiniteness. The other method, which can be applied in either a discrete-time or continuous-time framework, is based on studying the eigenvalue problem for an associated state-space model of the inference network. The merits and limitations of the proposed methods are discussed, with reference to several specific examples.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.