Search results for " Indexing"
showing 10 items of 88 documents
VIRES: A distributed open architecture for pictorial database
2006
In this paper we describe VIRES (Visual Information Retrieval Extendible System) an open distributed pictorial database for image retrieval. The retrieval methods, pictorial indexing and data are distributed over the network. VIRES has been designed as an open architecture. The system is based on the concept of distributed model via dictionary in order to reach a good versatility without changing the kernel of VIRES.
Textual data compression in computational biology: a synopsis.
2009
Abstract Motivation: Textual data compression, and the associated techniques coming from information theory, are often perceived as being of interest for data communication and storage. However, they are also deeply related to classification and data mining and analysis. In recent years, a substantial effort has been made for the application of textual data compression techniques to various computational biology tasks, ranging from storage and indexing of large datasets to comparison and reverse engineering of biological networks. Results: The main focus of this review is on a systematic presentation of the key areas of bioinformatics and computational biology where compression has been use…
Increasing the Inference and Learning Speed of Tsetlin Machines with Clause Indexing
2020
The Tsetlin Machine (TM) is a machine learning algorithm founded on the classical Tsetlin Automaton (TA) and game theory. It further leverages frequent pattern mining and resource allocation principles to extract common patterns in the data, rather than relying on minimizing output error, which is prone to overfitting. Unlike the intertwined nature of pattern representation in neural networks, a TM decomposes problems into self-contained patterns, represented as conjunctive clauses. The clause outputs, in turn, are combined into a classification decision through summation and thresholding, akin to a logistic regression function, however, with binary weights and a unit step output function. …
Approximate Matching over Biological RDF Graphs
2012
In the last few years, the amount of biological interaction data discovered and stored in public databases (e.g., KEGG [2]) considerably increased. To this aim, RDF is a powerful representation for interactions (or pathways), since they can be modeled as directed graphs, often referred to as biological networks, where nodes represent cellular components and the (labeled or unlabeled) edges correspond to interactions among components. Often for a given organism some components are known to be linked by well studied interactions. Such groups of components are called modules and they can be represented by sub-graphs in the corresponding biological network model. At today, one of the most impor…
Indexing Method for Transitive Relationships of Product Information
2008
To successfully use a relational database management system (RDBMS) as a repository for product information, the RDBMS must efficiently process and properly answer ontological queries. The key to processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. In particular, the transitive relationships (e.g., is-a, component-of relationships) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. We propose an efficient index using a numbering scheme (labeling scheme) to process queries over transitive relationships. (This paper is an extended version o…
Content based indexing of MPEG-4 video on relational DBMS
2001
Semantic User Profiling for Digital Advertising
2015
International audience; With the emergence of real-time distribution of online advertising space (“real-time bidding”), user profiling from web navigation traces becomes crucial. Indeed, it allows online advertisers to target customers without interfering with their activities. Current techniques apply traditional methods as statistics and machine learning, but suffer from their limitations. As an answer, the proposed approach aims to develop and evaluate a semantic-based user profiling system for digital advertising.
Localisation basée vision à partir de caractéristiques discriminantes issues de données visuelles hétérogènes
2019
Visual-based Localization (VBL) consists in retrieving the location of a visual image within a known space. VBL is involved in several present-day practical applications, such as indoor and outdoor navigation, 3D reconstruction, etc. The main challenge in VBL comes from the fact that the visual input to localize could have been taken at a different time than the reference database. Visual changes may occur on the observed environment during this period of time, especially for outdoor localization. Recent approaches use complementary information in order to address these visually challenging localization scenarios, like geometric information or semantic information. However geometric or sema…
Innovative modelling techniques in computer vision
1996
Abstract The paper is concerned with two of main research activities currently carried on at the Computer Science and Artificial Intelligence lab of DIE. The first part deals with hybrid artificial vision models, intended to provide object recognition and classification capabilities to an autonomous intelligen system. In this framework, a system recovering 3-D shape information from grey-level images of a scene, building a geometric representation of the scene in terms of superquadrics at the geometric level, and reasoning about the scene at the symbolic level is described. In the second part, attention is focused on automatic indexing of image databases. JACOB, a prototypal system allowing…