138 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Charles UniversityCZ11 papers
- Czech Academy of Sciences, Institute of Information Theory and AutomationCZ5 papers
- Czech Technical University in PragueCZ5 papers
- University of MannheimDE3 papers
- Johannes Kepler University of LinzAT2 papers
- Queen Mary University of LondonGB2 papers
- University of California, BerkeleyUS2 papers
- University of OxfordGB2 papers
- University of TurinIT2 papers
- Utrecht UniversityNL2 papers
- American UniversityUS1 paper
- Cambridge Econometrics (United Kingdom)GB1 paper
10 papers · 1 filter
Traceable LLM-based validation of statements in knowledge graphs
Daniel Adam, Tomáš Kliegr
This article presents a method for verifying RDF triples using LLMs, with an emphasis on providing traceable arguments. Because the LLMs cannot currently reliably identify the orig…
Neurosymbolic Methods for Rule Mining
Agnieszka Lawrynowicz, Luis Galarraga, Mehwish Alam +3
In this chapter, we address the problem of rule mining, beginning with essential background information, including measures of rule quality. We then explore various rule mining met…
Knowledge Graphs Evolution and Preservation -- A Technical Report from ISWS 2019
Nacira Abbas, Kholoud Alghamdi, Mortaza Alinam +71
One of the grand challenges discussed during the Dagstuhl Seminar "Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web" and described in its report is…
Composition of Probability Measures on Finite Spaces
Radim Jirousek
Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results sug…
Conditional Independence and Markov Properties in Possibility Theory
Jirina Vejnarova
Conditional independence and Markov properties are powerful tools allowing expression of multidimensional probability distributions by means of low-dimensional ones. As multidimens…
Marginalization in Composed Probabilistic Models
Radim Jirousek
Composition of low-dimensional distributions, whose foundations were laid in the papaer published in the Proceeding of UAI'97 (Jirousek 1997), appeared to be an alternative apparat…
On characterizing Inclusion of Bayesian Networks
Tomas Kocka, Remco R. Bouckaert, Milan Studeny
Every directed acyclic graph (DAG) over a finite non-empty set of variables (= nodes) N induces an independence model over N, which is a list of conditional independence statements…
Exploiting Functional Dependence in Bayesian Network Inference
Jirka Vomlel
We propose an efficient method for Bayesian network inference in models with functional dependence. We generalize the multiplicative factorization method originally designed by Tak…
Evaluating Ontology Matching Systems on Large, Multilingual and Real-world Test Cases
Christian Meilicke, Ondrej Sváb-Zamazal, Cássia Trojahn +4
In the field of ontology matching, the most systematic evaluation of matching systems is established by the Ontology Alignment Evaluation Initiative (OAEI), which is an annual camp…
Effective Dimensions of Hierarchical Latent Class Models
T. Kocka, N. L. Zhang
Hierarchical latent class (HLC) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are latent. There are no theoretically well justifie…