Maximum entropy in support of semantically annotated datasets

ISSN: 16130073
0Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

One of the important problems of semantic web is checking whether two datasets describe the same quantity. The existing solution to this problem is to use these datasets' ontologies to deduce that these datasets indeed represent the same quantity. However, even when ontologies seem to confirm the identify of the two corresponding quantities, it is still possible that in reality, we deal with somewhat different quantities. A natural way to check the identity is to compare the numerical values of the measurement results: if they are close (within measurement errors), then most probably we deal with the same quantity, else we most probably deal with different ones. In this paper, we show how to perform this checking.

Cite

CITATION STYLE

APA

Da Silva, P. P., Kreinovich, V., & Servin, C. (2008). Maximum entropy in support of semantically annotated datasets. In CEUR Workshop Proceedings (Vol. 423).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free