In this work we address the concept of semantic redundancy in linked datasets considering class assignment assertions. We discuss how redundancy can be evaluated as well as the relationship between redundancy and three class hierarchy aspects: the number of instances a class has, number of class descendants and class depth. Finally, we performed an evaluation on the DBpedia dataset using SPARQL...

In this paper, we propose a model of schema versions for object-oriented databases called RIBS. At the heart of this model is the concept of the rich base schema called (RiBS). In our model, each schema version is in the form of a class hierarchy view over one base schema, called RIBS, which has richer schema information than any existing schema version in the database. Users are supposed to be...

Object-oriented databases are said to support evolution and incremental development. On the schema level, a rm restriction in this evolution is that it can only be done by evolving class hierarchies downwards by subclassing. We show a uni ed approach to class evolution in object-oriented databases, where class hierarchies are allowed to grow in all directions, covering for evolution situations ...

In this work, we investigate several neural network architectures for fine-grained entity type classification. Particularly, we consider extensions to a recently proposed attentive neural architecture and make three key contributions. Previous work on attentive neural architectures do not consider hand-crafted features, we combine learnt and hand-crafted features and observe that they complemen...

Metaphor and analogy are perhaps the most challenging aspects of linguistic creativity for a conceptual representation to facilitate, since by their very nature they seek to stretch the boundaries of domain description and dynamically establish new ways of determining inter-domain similarity. By solving the vexing representational problems posed by these phenomena, we can create a more fluid co...

Reuse in object-oriented languages typically focuses on inheritance. Numerous techniques have been developed to provide finer-grained reuse of methods, such as flavors, mixins and traits. These techniques, however, only deal with reuse at the level of classes. Class-based reuse is inherently static. Increasing use of reflection and meta-programming techniques in real world applications underlin...

We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not model the same general problems as POMDPs, they still capture a number of interesting and challenging problems and, in some cases, have interesting properties. By studying the observability available in this subclass, w...

The closure property is essential to enhance the power of database languages. In the deductive object-oriented database (DOOD) context, this property implies that the rule-derived objects as well as the rule-derived classes (i.e. the classes populated by the derived objects) be established with full OO (objectoriented) features. This paper provides the methods of specifying the OO features of d...

Object-oriented programs often have a regular structure where methods are propagated to classes following the part-of and is-a relationships between classes. To abbreviate the description of programs we propose a graph-based propagation notation, called propagation patterns. In addition, we suggest a method for programming with propagation patterns. A propagation pattern consists of an interfac...

We introduce a new method for building classification models when we have prior knowledge of how the classes can be arranged in a hierarchy, based on how easily they can be distinguished. The new method uses a Bayesian form of the multinomial logit (MNL, a.k.a. “softmax”) model, with a prior that introduces correlations between the parameters for classes that are nearby in the tree. We compare ...