Christel Vrain

ORCID: 0000-0003-3307-0753
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Rough Sets and Fuzzy Logic
  • Data Mining Algorithms and Applications
  • Data Management and Algorithms
  • Logic, Reasoning, and Knowledge
  • Advanced Clustering Algorithms Research
  • Semantic Web and Ontologies
  • Constraint Satisfaction and Optimization
  • Bayesian Modeling and Causal Inference
  • Natural Language Processing Techniques
  • Text and Document Classification Technologies
  • Time Series Analysis and Forecasting
  • Image Retrieval and Classification Techniques
  • Advanced Database Systems and Queries
  • Neural Networks and Applications
  • Imbalanced Data Classification Techniques
  • Advanced Algebra and Logic
  • Machine Learning and Algorithms
  • Data Quality and Management
  • Fuzzy Logic and Control Systems
  • Domain Adaptation and Few-Shot Learning
  • Complex Systems and Time Series Analysis
  • AI-based Problem Solving and Planning
  • Face and Expression Recognition
  • Advanced Image and Video Retrieval Techniques
  • Logic, programming, and type systems

Institut National des Sciences Appliquées Centre Val de Loire
2015-2025

Laboratoire d'Informatique Fondamentale d'Orléans
2015-2024

Centre Val de Loire
2015-2024

Université d'Orléans
2011-2023

Laboratoire d’Informatique Fondamentale de Marseille
2003-2020

Université Paris Cité
1986-2005

Université Paris-Sud
1990-2005

University of North Carolina at Charlotte
1997

Conference Board
1997

Saarland University
1997

10.1109/wacv61041.2025.00772 article EN 2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) 2025-02-26

It is well known that modeling with constraints networks require a fair expertise. Thus tools able to automatically generate such have gained major interest. The contribution of this paper set new framework based on Inductive Logic Programming build constraint model from solutions and non-solutions related problems. expressed in middle-level language. On particular relational learning problem, traditional top-down search methods fall into blind bottom-up produce too expensive coverage tests....

10.1109/ictai.2010.16 preprint EN 2010-10-01

This paper proposes a tentative and original survey of meeting points between Knowledge Representation Reasoning (KRR) Machine Learning (ML), two areas which have been developed quite separately in the last four decades. First, some common concerns are identified discussed such as types representation used, roles knowledge data, lack or excess information, need for explanations causal understanding. Then, is organised seven sections covering most territory where KRR ML meet. We start with...

10.1016/j.ijar.2024.109206 article EN cc-by-nc International Journal of Approximate Reasoning 2024-04-25

The advent of high-resolution instruments for time-series sampling poses added complexity the formal definition thematic classes in remote sensing domain-required by supervised methods-while unsupervised methods ignore expert knowledge and intuition. Constrained clustering is becoming an increasingly popular approach data mining because it offers a solution to these problems; however, its application relatively unknown. This article addresses this divide adapting publicly available...

10.1109/jstars.2019.2950406 article EN IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 2019-11-01

Gene regulatory network inference remains a challenging problem in systems biology despite the numerous approaches that have been proposed. When substantial knowledge on gene is already available, supervised appropriate. Such method builds binary classifier able to assign class (Regulation/No regulation) an ordered pair of genes. Once learnt, pairwise can be used predict new regulations. In this work, we explore framework Markov Logic Networks (MLN) combine features probabilistic graphical...

10.1186/1471-2105-14-273 article EN cc-by BMC Bioinformatics 2013-09-12

This paper introduces a deep learning method for image classification that leverages knowledge formalised as graph created from information represented by pairs attribute/value. The proposed investigates loss function adaptively combines the classical cross-entropy commonly used in with novel penalty function. is derived representation of nodes after embedding and incorporates proximity between class nodes. Its formulation enables model to focus on identifying boundary most challenging...

10.1016/j.datak.2024.102285 article EN cc-by-nc-nd Data & Knowledge Engineering 2024-02-28

In many settings just finding a good clustering is insufficient and an explanation of the required. If features used to perform are interpretable then methods such as conceptual can be used. However, in applications this not case particularly for image, graph other complex data. Here we explore setting where set discrete tags each instance available. We formulate descriptive problem bi-objective optimization simultaneously find compact clusters using describe them tags. present our...

10.24963/ijcai.2018/176 preprint EN 2018-07-01
Coming Soon ...