166 research outputs found
Databases and Artificial Intelligence
International audienceThis chapter presents some noteworthy works which show the links between Databases and Artificial Intelligence. More precisely, after an introduction, Sect. 2 presents the seminal work on "logic and databases" which opened a wide research field at the intersection of databases and artificial intelligence. The main results concern the use of logic for database modeling. Then, in Sect. 3, we present different problems raised by integrity constraints and the way logic contributed to formalizing and solving them. In Sect. 4, we sum up some works related to queries with preferences. Section 5 finally focuses on the problematic of database integration
From fuzzy to annotated semantic web languages
The aim of this chapter is to present a detailed, selfcontained and comprehensive account of the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such as triple languages RDF/RDFS, conceptual languages of the OWL 2 family and rule languages. We further show how one may generalise them to so-called annotation domains, that cover also e.g. temporal and provenance extensions
Image annotation and retrieval based on multi-modal feature clustering and similarity propagation.
The performance of content-based image retrieval systems has proved to be inherently constrained by the used low level features, and cannot give satisfactory results when the user\u27s high level concepts cannot be expressed by low level features. In an attempt to bridge this semantic gap, recent approaches started integrating both low level-visual features and high-level textual keywords. Unfortunately, manual image annotation is a tedious process and may not be possible for large image databases. In this thesis we propose a system for image retrieval that has three mains components. The first component of our system consists of a novel possibilistic clustering and feature weighting algorithm based on robust modeling of the Generalized Dirichlet (GD) finite mixture. Robust estimation of the mixture model parameters is achieved by incorporating two complementary types of membership degrees. The first one is a posterior probability that indicates the degree to which a point fits the estimated distribution. The second membership represents the degree of typicality and is used to indentify and discard noise points. Robustness to noisy and irrelevant features is achieved by transforming the data to make the features independent and follow Beta distribution, and learning optimal relevance weight for each feature subset within each cluster. We extend our algorithm to find the optimal number of clusters in an unsupervised and efficient way by exploiting some properties of the possibilistic membership function. We also outline a semi-supervised version of the proposed algorithm. In the second component of our system consists of a novel approach to unsupervised image annotation. Our approach is based on: (i) the proposed semi-supervised possibilistic clustering; (ii) a greedy selection and joining algorithm (GSJ); (iii) Bayes rule; and (iv) a probabilistic model that is based on possibilistic memebership degrees to annotate an image. The third component of the proposed system consists of an image retrieval framework based on multi-modal similarity propagation. The proposed framework is designed to deal with two data modalities: low-level visual features and high-level textual keywords generated by our proposed image annotation algorithm. The multi-modal similarity propagation system exploits the mutual reinforcement of relational data and results in a nonlinear combination of the different modalities. Specifically, it is used to learn the semantic similarities between images by leveraging the relationships between features from the different modalities. The proposed image annotation and retrieval approaches are implemented and tested with a standard benchmark dataset. We show the effectiveness of our clustering algorithm to handle high dimensional and noisy data. We compare our proposed image annotation approach to three state-of-the-art methods and demonstrate the effectiveness of the proposed image retrieval system
Foundations of Fuzzy Logic and Semantic Web Languages
This book is the first to combine coverage of fuzzy logic and Semantic Web languages. It provides in-depth insight into fuzzy Semantic Web languages for non-fuzzy set theory and fuzzy logic experts. It also helps researchers of non-Semantic Web languages get a better understanding of the theoretical fundamentals of Semantic Web languages. The first part of the book covers all the theoretical and logical aspects of classical (two-valued) Semantic Web languages. The second part explains how to generalize these languages to cope with fuzzy set theory and fuzzy logic
Closing Bell: Boxing black box simulations in the resource theory of contextuality
This chapter contains an exposition of the sheaf-theoretic framework for
contextuality emphasising resource-theoretic aspects, as well as some original
results on this topic. In particular, we consider functions that transform
empirical models on a scenario S to empirical models on another scenario T, and
characterise those that are induced by classical procedures between S and T
corresponding to 'free' operations in the (non-adaptive) resource theory of
contextuality. We construct a new 'hom' scenario built from S and T, whose
empirical models induce such functions. Our characterisation then boils down to
being induced by a non-contextual model. We also show that this construction on
scenarios provides a closed structure on the category of measurement scenarios.Comment: Corrected a mistake in Theorem 44 and other fixes stemming from it.
This supersedes the published version and should be considered the version of
referenc
Treatment of imprecision in data repositories with the aid of KNOLAP
Traditional data repositories introduced for the needs of business
processing, typically focus on the storage and querying of crisp
domains of data. As a result, current commercial data repositories
have no facilities for either storing or querying imprecise/
approximate data.
No significant attempt has been made for a generic and applicationindependent
representation of value imprecision mainly as a
property of axes of analysis and also as part of dynamic
environment, where potential users may wish to define their “own”
axes of analysis for querying either precise or imprecise facts. In
such cases, measured values and facts are characterised by
descriptive values drawn from a number of dimensions, whereas
values of a dimension are organised as hierarchical levels.
A solution named H-IFS is presented that allows the representation
of flexible hierarchies as part of the dimension structures. An
extended multidimensional model named IF-Cube is put forward,
which allows the representation of imprecision in facts and
dimensions and answering of queries based on imprecise
hierarchical preferences. Based on the H-IFS and IF-Cube
concepts, a post relational OLAP environment is delivered, the
implementation of which is DBMS independent and its performance
solely dependent on the underlying DBMS engine
- …