-rigid databases and the expressibility of incomplete relational query languages. (Abstract).
Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer
Large File Operations Support Using Order Preserving Perfect Hashing Functions
Latent Semantic Indexing for patent documents
Since the huge database of patent documents is continuously increasing, the issue of classifying, updating and retrieving patent documents turned into an acute necessity. Therefore, we investigate the efficiency of applying Latent Semantic Indexing, an automatic indexing method of information retrieval, to some classes of patent documents from the United States Patent Classification System. We present some experiments that provide the optimal number of dimensions for the Latent Semantic Space and...
Latent Semantic Indexing using eigenvalue analysis for efficient information retrieval
Text retrieval using Latent Semantic Indexing (LSI) with truncated Singular Value Decomposition (SVD) has been intensively studied in recent years. However, the expensive complexity involved in computing truncated SVD constitutes a major drawback of the LSI method. In this paper, we demonstrate how matrix rank approximation can influence the effectiveness of information retrieval systems. Besides, we present an implementation of the LSI method based on an eigenvalue analysis for rank approximation...
Learning imprecise semantic concepts from image databases.
In this paper we introduce a model to represent high-level semantic concepts that can be perceived in images. The concepts are learned and represented by means of a set of association rules that relate the presence of perceptual features to the fulfillment of a concept for a set of images. Since both the set of images where a perceptual feature appears and the set of images fulfilling a given concept are fuzzy, we use in fact fuzzy association rules for the learning model. The concepts so acquired...
Les termes : un modèle algébrique de représentation et de structuration de données symboliques
Nos travaux se situent dans le cadre de l'analyse conceptuelle des données. Notre objectif est de généraliser les représentations par variables binaires ou nominales en y adjoignant la modélisation de structures internes. Le problème est de ne pas perdre en complexité algorithmique ce qui est gagné en puissance de représentation. Selon ces considérations, décrire les données et des classes de données par des structures arborescentes semble un bon compromis. Le système de représentation que nous...
Linear Space Data Structures for Two Types of Range Search.
Lossless joins of relational database views.