33,465 research outputs found
Goal Node Search for Semantic Web Source Selection
We present an efficient search approach for selecting all potentially relevant data sources for a conjunctive Semantic Web query. We use map ontologies to align heterogeneous domain ontologies. This allows us to select data sources that may be relevant to the query but generally do not de-scribe their data directly in terms of the ontology of the query. The āGoal Node Search ā algorithm is a significant improvement on our original source selection algorithm. The new algorithm allows a more expressive knowledge rep-resentation language to describe domain ontologies and it is about three times more efficient than the original source selection algorithm when performing similar tasks. 1
CHORUS Deliverable 2.1: State of the Art on Multimedia Search Engines
Based on the information provided by European projects and national initiatives related to multimedia search as well as domains experts that participated in the CHORUS Think-thanks and workshops, this document reports on the state of the art related to multimedia content search from, a technical, and socio-economic perspective.
The technical perspective includes an up to date view on content based indexing and retrieval technologies, multimedia search in the context of mobile devices and peer-to-peer networks, and an overview of current evaluation and benchmark inititiatives to measure the performance of multimedia search engines.
From a socio-economic perspective we inventorize the impact and legal consequences of these technical advances and point out future directions of research
Graph Summarization
The continuous and rapid growth of highly interconnected datasets, which are
both voluminous and complex, calls for the development of adequate processing
and analytical techniques. One method for condensing and simplifying such
datasets is graph summarization. It denotes a series of application-specific
algorithms designed to transform graphs into more compact representations while
preserving structural patterns, query answers, or specific property
distributions. As this problem is common to several areas studying graph
topologies, different approaches, such as clustering, compression, sampling, or
influence detection, have been proposed, primarily based on statistical and
optimization methods. The focus of our chapter is to pinpoint the main graph
summarization methods, but especially to focus on the most recent approaches
and novel research trends on this topic, not yet covered by previous surveys.Comment: To appear in the Encyclopedia of Big Data Technologie
Effect of heuristics on serendipity in path-based storytelling with linked data
Path-based storytelling with Linked Data on the Web provides users the ability to discover concepts in an entertaining and educational way. Given a query context, many state-of-the-art pathfinding approaches aim at telling a story that coincides with the user's expectations by investigating paths over Linked Data on the Web. By taking into account serendipity in storytelling, we aim at improving and tailoring existing approaches towards better fitting user expectations so that users are able to discover interesting knowledge without feeling unsure or even lost in the story facts. To this end, we propose to optimize the link estimation between - and the selection of facts in a story by increasing the consistency and relevancy of links between facts through additional domain delineation and refinement steps. In order to address multiple aspects of serendipity, we propose and investigate combinations of weights and heuristics in paths forming the essential building blocks for each story. Our experimental findings with stories based on DBpedia indicate the improvements when applying the optimized algorithm
A Requirement-centric Approach to Web Service Modeling, Discovery, and Selection
Service-Oriented Computing (SOC) has gained considerable popularity for implementing Service-Based Applications (SBAs) in a flexible\ud
and effective manner. The basic idea of SOC is to understand users'\ud
requirements for SBAs first, and then discover and select relevant\ud
services (i.e., that fit closely functional requirements) and offer\ud
a high Quality of Service (QoS). Understanding usersĀ requirements\ud
is already achieved by existing requirement engineering approaches\ud
(e.g., TROPOS, KAOS, and MAP) which model SBAs in a requirement-driven\ud
manner. However, discovering and selecting relevant and high QoS\ud
services are still challenging tasks that require time and effort\ud
due to the increasing number of available Web services. In this paper,\ud
we propose a requirement-centric approach which allows: (i) modeling\ud
usersĀ requirements for SBAs with the MAP formalism and specifying\ud
required services using an Intentional Service Model (ISM); (ii)\ud
discovering services by querying the Web service search engine Service-Finder\ud
and using keywords extracted from the specifications provided by\ud
the ISM; and(iii) selecting automatically relevant and high QoS services\ud
by applying Formal Concept Analysis (FCA). We validate our approach\ud
by performing experiments on an e-books application. The experimental\ud
results show that our approach allows the selection of relevant and\ud
high QoS services with a high accuracy (the average precision is\ud
89.41%) and efficiency (the average recall is 95.43%)
Web and Semantic Web Query Languages
A number of techniques have been developed to facilitate
powerful data retrieval on the Web and Semantic Web. Three categories
of Web query languages can be distinguished, according to the format
of the data they can retrieve: XML, RDF and Topic Maps. This article
introduces the spectrum of languages falling into these categories
and summarises their salient aspects. The languages are introduced using
common sample data and query types. Key aspects of the query
languages considered are stressed in a conclusion
- ā¦