VSVasile-Marian Scuturici

Vasile-Marian Scuturici

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Vasile-Marian Scuturici has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Computing the g3-error with Relaxed Equality: Complexity, Algorithms and Visualization

    by Pierre Faure–Giovagnoli, Simon Vilmin, Jean-Marc Petit, Vasile-Marian Scuturici

    The incorporation of domain knowledge (DK) in AI has been studied for years and turns out to be critical in practice. Functions are also a basic notion for dealing with data science projects and are somehow related to DK. Consider the following scenario. Let \(D(y, z_1, \ldots , z_n)\) be a dataset, Alice a data scientist, Bob a domain expert and \(y = f(z_1, \ldots , z_n)\) a function known to Bob from his background knowledge. Alice is interested in the following simple yet crucial questions: How to define the satisfaction of f in D ? How to measure that satisfaction efficiently? How does this satisfaction relate to the supervised learning task of learning f from D ? It turns out that these problems are related to the study of counterexamples through the use of functional dependencies (FDs) and, in particular, FD measures used to quantify their satisfaction in a dataset such as the \(g_3\) indicator where the equality is replaced by more flexible predicates. In this article, we first examine the complexity of computing \(g_3\) . It is known that \(g_3\) can be computed in polynomial time when using equality, while it becomes NP -hard when using general predicates. Our goal is to refine this dichotomy by studying the impact of the following common properties: reflexivity, transitivity, symmetry, and antisymmetry. We show that symmetry and transitivity together are sufficient to guarantee that the \(g_3\) can be computed in polynomial time. However, removing one of them makes the problem NP -hard. Second, we study the computation of \(g_3\) in the polynomial and NP -hard cases identified previously. We propose different exact and approximate solutions for the computation of \(g_3\) in both cases. We compare these solutions in a detailed experimental study of time performance and approximation accuracy. All the algorithms are also made available via fastg3 , an open-source Python library with an underlying C++ implementation. Finally, we link counterexamples and \(g_3\) to supervised learning with a web application called adesit . adesit is intended to be part of an iterative data refinement process right after data selection and just before the machine learning process itself. It provides a way to evaluate the ability of a dataset to perform well for a given supervised learning problem through statistical and visual exploration. In a last section, we validate our approach by applying it to the industrial problem of air gap monitoring in compact hydro-generators.

  • Open Access

    Information visualisation for industrial process monitoring

    by Elodie Toufaili, Christophe Bortolaso, Youssef Miloudi, Jean-Marc Petit, Vasile-Marian Scuturici

    In the context of process monitoring and predictive maintenance, an adapted visualisation of sensor data is essential in order to help the domain experts to make the right maintenance decision. The large volume and diversity of data leads us to aggregate the data to obtain semantically rich information useful to the domain expert. We study the case of industrial machinery equipped with several sensors producing time series, and we consider that this machinery has different operating states in its operation. We propose a method to identify an optimal representation of the data in 2 dimensions, understandable by the domain expert. This representation allows to easily identify the operating modes of the equipment and the possible deviation from a "normal" behavior. We use co-occurrence matrices to synthesise the time series data, and the features of interest and discretization are selected using two proposed criteria to measure the separation of working modes.


  • SQL query extensions for imprecise questions

    by Marie Le Guilly, Jean-Marc Petit, Vasile-Marian Scuturici


  • Open Access

    ExplIQuE

    by Marie Le Guilly, Jean-Marc Petit, Vasile-Marian Scuturici, Ihab F. Ilyas


  • Open Access

    SQL Query Completion for Data Exploration

    by Marie Le Guilly, Jean-Marc Petit, Vasile-Marian Scuturici

    Within the big data tsunami, relational databases and SQL are still there and remain mandatory in most of cases for accessing data. On the one hand, SQL is easy-to-use by non specialists and allows to identify pertinent initial data at the very beginning of the data exploration process. On the other hand, it is not always so easy to formulate SQL queries: nowadays, it is more and more frequent to have several databases available for one application domain, some of them with hundreds of tables and/or attributes. Identifying the pertinent conditions to select the desired data, or even identifying relevant attributes is far from trivial. To make it easier to write SQL queries, we propose the notion of SQL query completion: given a query, it suggests additional conditions to be added to its WHERE clause. This completion is semantic, as it relies on the data from the database, unlike current completion tools that are mostly syntactic. Since the process can be repeated over and over again -- until the data analyst reaches her data of interest --, SQL query completion facilitates the exploration of databases. SQL query completion has been implemented in a SQL editor on top of a database management system. For the evaluation, two questions need to be studied: first, does the completion speed up the writing of SQL queries? Second , is the completion easily adopted by users? A thorough experiment has been conducted on a group of 70 computer science students divided in two groups (one with the completion and the other one without) to answer those questions. The results are positive and very promising.

  • Skeleton clustering by multi-robot monitoring for fall risk discovery

    by Yutaka Deguchi, Daisuke Takayama, Shigeru Takano, Vasile-Marian Scuturici, Jean-Marc Petit, Einoshin Suzuki


  • Continuous Query Processing Over Data, Streams and Services: Application to Robotics

    by Vasile-Marian Scuturici, Yann Gripay, Jean-Marc Petit, Yutaka Deguchi, Einoshin Suzuki

  • Open Access

    Multiple-robot monitoring system based on a service-oriented DBMS

    by Yutaka Deguchi, Daisuke Takayama, Shigeru Takano, Vasile-Marian Scuturici, Jean-Marc Petit, Einoshin Suzuki

    In this paper, we present a human-targeted monitoring system composed of two autonomous mobile robots based on a service-oriented DBMS, mainly from the viewpoint of positioning control. Each robot is equipped with a Kinect and monitors the target human from appropriate angles and distances. The service-oriented DBMS, which manages the monitoring system and enables a rapid development and extension of the system, views each robot as a data source which generates a data stream to be stored and processed in the DBMS. The results of the experiments conducted in a real office are promising.