Bibliothek

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • 1995-1999  (2)
  • knowledge representation  (1)
  • probabilistic networks  (1)
Datenquelle
Materialart
Erscheinungszeitraum
  • 1995-1999  (2)
Jahr
Schlagwörter
  • 1
    Digitale Medien
    Digitale Medien
    A “Microscopic” Study of Minimum Entropy Search in Learning Decomposable Markov Networks (1997)
    Springer
    Machine learning 26 (1997), S. 65-92 
    Details
    ISSN: 0885-6125
    Schlagwort(e): inductive learning ; reasoning under uncertainty ; knowledge acquisition ; Markov networks ; probabilistic networks
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Several scoring metrics are used in different search procedures for learning probabilistic networks. We study the properties of cross entropy in learning a decomposable Markov network. Though entropy and related scoring metrics were widely used, its “microscopic” properties and asymptotic behavior in a search have not been analyzed. We present such a “microscopic” study of a minimum entropy search algorithm, and show that it learns an I-map of the domain model when the data size is large. Search procedures that modify a network structure one link at a time have been commonly used for efficiency. Our study indicates that a class of domain models cannot be learned by such procedures. This suggests that prior knowledge about the problem domain together with a multi-link search strategy would provide an effective way to uncover many domain models.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1007324100110
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    An Extended Relational Data Model For Probabilistic Reasoning (1997)
    Springer
    Journal of intelligent information systems 9 (1997), S. 181-202 
    Details
    ISSN: 1573-7675
    Schlagwort(e): Relational database ; probabilistic reasoning ; knowledge representation ; generalized acyclic join dependency ; belief networks
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Probabilistic methods provide a formalism for reasoning aboutpartial beliefs under conditions of uncertainty. This paper suggests a newrepresentation of probabilistic knowledge. This representation encompassesthe traditional relational database model. In particular, it is shown thatprobabilistic conditional independence is equivalent to the notion of generalized multivalued dependency. More importantly,a Markov network can be viewed as a generalized acyclic joindependency. This linkage between these two apparently different butclosely related knowledge representations provides a foundation fordeveloping a unified model for probabilistic reasoning and relationaldatabase systems.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1008603515938
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...