Sciweavers

SBBD
2007

Similarity and Analogy over Application Domains

13 years 5 months ago
Similarity and Analogy over Application Domains
Abstract. Databases, particularly when storing heterogeneous, sparse semistructured data, tend to provide incomplete information and information which is difficult to categorize. This paper first considers how to classify entity instances as members of entity classes organized in a lattice-like generalization/specialization hierarchy. Then, it describes how the frame representation employed for instances and classes, as well as the closeness criterion involved in the classification method, favors the practical use of similarity and analogy, where similarity refers to instances within the same class, and analogy involves different classes. Finally, the paper argues that similarity and analogy facilitate querying semi-structured data.
Simone Diniz Junqueira Barbosa, Karin Koogan Breit
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2007
Where SBBD
Authors Simone Diniz Junqueira Barbosa, Karin Koogan Breitman, Antonio L. Furtado, Marco A. Casanova
Comments (0)