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. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Řimnáč, M., & Špánek, R. (2009). Automated incremental building of weighted semantic web repository. Studies in Computational Intelligence, 206, 265–296. https://doi.org/10.1007/978-3-642-01091-0_12
Mendeley helps you to discover research relevant for your work.