Relation Robustness Evaluation for the Semantic Associations
Keywords:
Semantic web, semantic associations' search, relation robustness, ranking semantic relations, relationship search, discovery queryAbstract
The search tools and information retrieval systems on the contemporary Web use keywords, lexical analysis, popularity, and statistical methods to find and prioritise relevant data to a specific query. In recent years, Semantic web has introduced new approaches to specify Web data using machine‑interpretable structures. This has led to the establishment of new frameworks for search engines and information systems based on discovering complex and meaningful relationships between information resources. In this paper we discuss a semantic supported information search and retrieval system to answer users' information queries. The paper focuses on knowledge discovery aspects of the system and in particular analysis of semantic associations. The information resources are multimedia data, which could be retrieved from heterogeneous resources. The main goal is to provide a hypermedia presentation, which narratively conveys relevant information to the queried term. The structure describes the related entities to the queried topic and a ranking mechanism assigns weights to the entities. The assigned weights express the degree of relevancy of each related entity in the presentation structure.Downloads
Published
Issue
Section
License
Open Access Publishing
The Electronic Journal of Knowledge Maangement operates an Open Access Policy. This means that users can read, download, copy, distribute, print, search, or link to the full texts of articles, crawl them for indexing, pass them as data to software, or use them for any other lawful purpose, without financial, legal, or technical barriers other than those inseparable from gaining access to the internet itself. The only constraint on reproduction and distribution, and the only role for copyright in this domain, is that authors control the integrity of their work, which should be properly acknowledged and cited.