SearcharxivSearch

arXiv subjects

Franck Ravat

Publications and source records attributed to Franck Ravat.

13 recordsLinked to original sources

Model Lake: a New Alternative for Machine Learning Models Management and Governance

The rise of artificial intelligence and data science across industries underscores the pressing need for effective management and governance of machine learning (ML) models. Traditional approaches to ML models management often involve disparate storage systems and lack standardized methodologies for versioning, audit, and re-use. Inspired by data lake concepts, this paper develops the concept of ML Model Lake as a centralized management framework for datasets, codes, and models within organizations environments. We provide an in-depth exploration of the Model Lake concept, delineating its architectural foundations, key components, operational benefits, and practical challenges. We discuss the transformative potential of adopting a Model Lake approach, such as enhanced model lifecycle management, discovery, audit, and reusability. Furthermore, we illustrate a real-world application of Model Lake and its transformative impact on data, code and model management practices.

cs.LG

DECWA : Density-Based Clustering using Wasserstein Distance

Clustering is a data analysis method for extracting knowledge by discovering groups of data called clusters. Among these methods, state-of-the-art density-based clustering methods have proven to be effective for arbitrary-shaped clusters. Despite their encouraging results, they suffer to find low-density clusters, near clusters with similar densities, and high-dimensional data. Our proposals are a new characterization of clusters and a new clustering algorithm based on spatial density and probabilistic approach. First of all, sub-clusters are built using spatial density represented as probability density function ($p.d.f$) of pairwise distances between points. A method is then proposed to agglomerate similar sub-clusters by using both their density ($p.d.f$) and their spatial distance. The key idea we propose is to use the Wasserstein metric, a powerful tool to measure the distance between $p.d.f$ of sub-clusters. We show that our approach outperforms other state-of-the-art density-based clustering methods on a wide variety of datasets.

cs.LG

Dimensional Data KNN-Based Imputation

Data Warehouses (DWs) are core components of Business Intelligence (BI). Missing data in DWs have a great impact on data analyses. Therefore, missing data need to be completed. Unlike other existing data imputation methods mainly adapted for facts, we propose a new imputation method for dimensions. This method contains two steps: 1) a hierarchical imputation and 2) a k-nearest neighbors (KNN) based imputation. Our solution has the advantage of taking into account the DW structure and dependency constraints. Experimental assessments validate our method in terms of effectiveness and efficiency.

cs.DB

Internal Data Imputation in Data Warehouse Dimensions

Missing values occur commonly in the multidimensional data warehouses. They may generate problems of usefulness of data since the analysis performed on a multidimensional data warehouse is through different dimensions with hierarchies where we can roll up or drill down to the different parameters of analysis. Therefore, it's essential to complete these missing values in order to carry out a better analysis. There are existing data imputation methods which are suitable for numeric data, so they can be applied for fact tables but not for dimension tables. Some other data imputation methods need extra time and effort costs. As consequence, we propose in this article an internal data imputation method for multidimensional data warehouse based on the existing data and considering the intra-dimension and inter-dimension relationships.

cs.DB

An Automatic Schema-Instance Approach for Merging Multidimensional Data Warehouses

Using data warehouses to analyse multidimensional data is a significant task in company decision-making.The data warehouse merging process is composed of two steps: matching multidimensional components and then merging them. Current approaches do not take all the particularities of multidimensional data warehouses into account, e.g., only merging schemata, but not instances; or not exploiting hierarchies nor fact tables. Thus, in this paper, we propose an automatic merging approach for star schema-modeled data warehouses that works at both the schema and instance levels. We also provide algorithms for merging hierarchies, dimensions and facts. Eventually, we implement our merging algorithms and validate them with the use of both synthetic and benchmark datasets.

cs.DB

Data Lake Ingestion Management

Data Lake (DL) is a Big Data analysis solution which ingests raw data in their native format and allows users to process these data upon usage. Data ingestion is not a simple copy and paste of data, it is a complicated and important phase to ensure that ingested data are findable, accessible, interoperable and reusable at all times. Our solution is threefold. Firstly, we propose a metadata model that includes information about external data sources, data ingestion processes, ingested data, dataset veracity and dataset security. Secondly, we present the algorithms that ensure the ingestion phase (data storage and metadata instanciation). Thirdly, we introduce a developed metadata management system whereby users can easily consult different elements stored in DL.

cs.DB

Automatic Integration Issues of Tabular Data for On-Line Analysis Processing

Companies and individuals produce numerous tabular data. The objective of this position paper is to draw up the challenges posed by the automatic integration of data in the form of tables so that they can be cross-analyzed. We provide a first automatic solution for the integration of such tabular data to allow On-Line Analysis Processing. To fulfil this task, features of tabular data should be analyzed and the challenge of automatic multidimensional schema generation should be addressed. Hence, we propose a typology of tabular data and discuss our idea of an automatic solution.

cs.DB

Personnalisation de Systèmes OLAP Annotés

This paper deals with personalization of annotated OLAP systems. Data constellation is extended to support annotations and user preferences. Annotations reflect the decision-maker experience whereas user preferences enable users to focus on the most interesting data. User preferences allow annotated contextual recommendations helping the decision-maker during his/her multidimensional navigations.

cs.DB

Personnalisation de bases de données multidimensionnelles

This paper deals with decision support systems resting on multidimensional modelling of data. Moreover, we intend to offer a set of concepts and mechanisms for personalized multidimensional database specifications. This personalization consists in associating weights to different components of a multidimensional schema. Personalization specifications are specified through the use of a language based on the principle of Event Condition Action. This personalisation determines multidimensional data display as well as their analyses (with the use of drilling or rotating operations).

cs.DB

Algèbre OLAP et langage graphique

This article deals with OLAP systems based on multidimensional model. The conceptual model we provide, represents data through a constellation (multi-facts) composed of several multi-hierarchy dimensions. In this model, data are displayed through multidimensional tables. We define a query algebra handling these tables. This user oriented algebra is composed of a closure core of OLAP operators as soon as advanced operators dedicated to complex analysis. Finally, we specify a graphical OLAP language based on this algebra. This language facilitates analyses of decision makers.

cs.DB

Modélisation et extraction de données pour un entrepôt objet

This paper describes an object-oriented model for designing complex and time-variant data warehouse data. The main contribution is the warehouse class concept, which extends the class concept by temporal and archive filters as well as a mapping function. Filters allow the keeping of relevant data changes whereas the mapping function defines the warehouse class schema from a global data source schema. The approach take into account static properties as well as dynamic properties. The behaviour extraction is based on the use-matrix concept.

cs.DB

Contraintes pour modèle et langage multidimensionnels

This paper defines a constraint-based model dedicated to multidimensional databases. The model we define represents data through a constellation of facts (subjects of analyse) associated to dimensions (axis of analyse), which are possibly shared. Each dimension is organised according to several hierarchies (views of analyse) integrating several levels of data granularity. In order to insure data consistency, we introduce 5 semantic constraints (exclusion, inclusion, partition, simultaneity, totality) which can be intra-dimension or inter-dimensions; the intra-dimension constraints allow the expression of constraints between hierarchies within a same dimension whereas the inter-dimensions constraints focus on hierarchies of distinct dimensions. We also study repercussions of these constraints on multidimensional manipulations and we provide extensions of the multidimensional operators.

cs.DB

Modélisation et manipulation de données historisées et archivées dans un entrepôt orienté objet

This paper deals with temporal and archive object-oriented data warehouse modelling and querying. In a first step, we define a data model describing warehouses as central repositories of complex and temporal data extracted from one information source. The model is based on the concepts of warehouse object and environment. A warehouse object is composed of one current state, several past states (modelling value changes) and several archive states (summarising some value changes). An environment defines temporal parts in a warehouse schema according to a relevant granularity (attribute, class or graph). In a second step, we provide a query algebra dedicated to data warehouses. This algebra, which is based on common object algebras, integrates temporal operators and operators for querying object states. An other important contribution concerns dedicated operators allowing users to transform warehouse objects in temporal series as well as operators facilitating analytical treatments.

cs.DB