Automatické inkrementální budování váženého úložište dat pro sémantický web

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F09%3A00324312" target="_blank" >RIV/67985807:_____/09:00324312 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Automated Incremental Building of Weighted Semantic Web Repository

Popis výsledku v původním jazyce

The chapter introduces an incremental algorithm creating a selforganizing repository and it describes the processes needed for updates and inserts into the repository, especially the processes updating estimated structure driving data storage in the repository. The process of building repository is foremost aimed at allowing the well-known Semantic web tools to query data presented by the current web sources. In order to respect features of current web documents, the relationships should be at least weighted by an additional indirect criteria, which allow the query result to be sorted accordingly to an estimated quality of data provided by web sources. The relationship weights can be based on relationship soundness or on the reputation of the source providing them. The extension of the relationships by the weights leads to the repository able to return a query result as complete as possible, where (possibly) inconsistent parts are sorted by the relationships weights.

Název v anglickém jazyce

Automated Incremental Building of Weighted Semantic Web Repository

Popis výsledku anglicky

The chapter introduces an incremental algorithm creating a selforganizing repository and it describes the processes needed for updates and inserts into the repository, especially the processes updating estimated structure driving data storage in the repository. The process of building repository is foremost aimed at allowing the well-known Semantic web tools to query data presented by the current web sources. In order to respect features of current web documents, the relationships should be at least weighted by an additional indirect criteria, which allow the query result to be sorted accordingly to an estimated quality of data provided by web sources. The relationship weights can be based on relationship soundness or on the reputation of the source providing them. The extension of the relationships by the weights leads to the repository able to return a query result as complete as possible, where (possibly) inconsistent parts are sorted by the relationships weights.

Druh

C - Kapitola v odborné knize

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/1M0554" target="_blank" >1M0554: Pokročilé sanační technologie a procesy</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2009

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název knihy nebo sborníku

Foundations of Computational Intelligence, Volume 6

ISBN

978-3-642-01090-3

Počet stran výsledku

32

Strana od-do

—

Počet stran knihy

397

Název nakladatele

Springer

Místo vydání

Berlin

Kód UT WoS kapitoly

—