Accueil › Annuaire des chercheurs › Salem Benferhat A
Salem Benferhat A
Affiliation : Centre National de la Recherche Scientifique · Centre de Recherche en Informatique de Lens · Université d'Artois
- 94Publications (affiliation française)
- 602Publications au total
- 6620Citations
- 38Indice h
Profil de recherche
Salem Benferhat A compte 94 publications référencées (2000–2026). Ses travaux paraissent principalement dans « Lecture notes in computer science », « HAL » et « International Journal of Uncertainty Fuzziness and Knowledge-Based Systems ». Son article le plus cité, « Naive Bayes vs decision trees in intrusion detection systems » (2004), a été cité 487 fois. 6 de ces publications datent des trois dernières années d’activité. Ses travaux sont cosignés avec au moins 12 chercheurs, notamment dans des établissements de Algérie, Tunisie, Maroc.
C’est vous ? Faites connaître vos travaux
Créez gratuitement votre profil DzCademia et ajoutez vos articles : ils apparaîtront plus facilement sur Google et dans les assistants d’IA comme ChatGPT. Plus de personnes pourront vous lire et vous citer.
Créer mon profil gratuit Ajouter mes publicationsDomaines de recherche
- Logic, Reasoning, and Knowledge
- Bayesian Modeling and Causal Inference
- Constraint Satisfaction and Optimization
- Semantic Web and Ontologies
- Multi-Criteria Decision Making
Publications (94)
- Integration and Alignment of Multiple Water Network Data Sources
- Analysis of the syntactic computation of Fagin-Halpern conditioning in possibilistic logic
- Enhancing the Representation of WastewaterNetwork Maps Using Graphs
- Graphs as Tools for Wastewater Network Representation: Benefits and Insights
- From GIS to Graphical Representation for Maintaining Connectivity of Wastewater Network Elements
- A Graph-Based Representation of Wastewater Maps
- Syntactic computation of Fagin-Halpern conditioning in possibility theory
- A Graph-Based Approach for Representing Wastewater Networks from GIS Data: Ensuring Connectivity and Consistency
- Revising possibilistic knowledge bases using FH-conditioning: -Extended abstract
- Managing imprecise map and image data in a possibility theory framework
- Query answering DL-lite knowledge bases from hidden datasets
- A Weighted-Logic Representation of C-Revising Ordinal Conditional Functions
- Classifying Non-elementary Movements in Vietnamese Mõ Dances
- Penalty Logic-Based Representation of C-Revision.
- An Ontology for Classifying Vietnamese Dance Movements
- Querying DL-lite Knowledge Bases from Hidden Datasets
- Handling Capabilities in Security Policies
- Polynomial Algorithms for Computing a Single Preferred Assertional-Based Repair
- Uncertain lightweight ontologies in a product-based possibility theory framework
- Qualitative Possibilistic Decisions: Decomposition and Sequential Decisions Making
- An Integer 0-1 Linear Programming Approach for Computing Inconsistency Degree in Product-Based Possibilistic DL-Lite
- Integrating non elementary actions in access control models
- Algorithms for Quantitative-Based Possibilistic Lightweight Ontologies
- Representing Lightweight Ontologies in a Product-Based Possibility Theory Framework
- Representing sequences of actions in access control security policies
- On the Decomposition of Min-based Possibilistic Influence Diagrams
- Negated Min-Based Possibilistic Networks.
- Instantiated First Order Qualitative Choice Logic for an efficient handling of alerts correlation
- An Approximate Algorithm for Min-Based Possibilistic Networks
- Post-processing a classifier's predictions: Strategies and empirical evaluation
- Comparing and Weakening Possibilistic Knowledge Bases
- Merging Possibilistic Networks through a Disjunctive Mode
- Lukasiewicz-based merging possibilistic networks
- Ascribing Causality from Observational and Interventional Belief Function Knowledge Modeling.
- Quantitative possibility theory: logical- and graphical-based representations
- Min-Based Fusion of Possibilistic DL-Lite Knowledge Bases
- Dealing with external actions in belief causal networks
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks
- Inference using compiled min-based possibilistic causal networks in the presence of interventions
- A possibilistic graphical model for handling decision problems under uncertainty
- A Comparative Study of Compilation-Based Inference Methods for Min-Based Possibilistic Networks
- Qualitative fusion-based traffic signal preemption
- On the Possibilistic Handling of Priorities in Access Control Models
- A New Approach for QCL-Based Alert Correlation Process
- On the modeling of causal belief networks
- Causal Belief Networks: Handling Uncertain Interventions
- Behavior of compiled bases in compilation-based inference methods for min-based possibilistic networks
- An intrusion detection and alert correlation approach based on revising probabilistic classifiers using expert knowledge
- An intrusion detection and alert correlation approach based on revising probabilistic classifiers using expert knowledge
- Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference
- Computing optimal optimistic decisions using min-based possibilistic networks
- Possibilistic Local Structure for Compiling Min-Based Networks
- Inference Using Compiled Product-Based Possibilistic Networks
- Handling Interventions with Uncertain Consequences in Belief Causal Networks
- Ascribing Causality from Interventional Belief Function Knowledge
- Representing Belief Function Knowledge with Graphical Models
- Analyzing belief function networks with conditional beliefs
- Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach
- Experimental Comparative Study of Compilation-Based Inference in Bayesian and Possibilitic Networks
- On the fusion of probabilistic networks
- Encoding default-based SELinux-security policy in Organization-Based Access Control Model
- Approximate inference in qualitative possibilistic networks
- On the Fusion of Probabilistic Networks
- Possibilistic Similarity Measures
- Integrating security operator knowledge and preferences to the alert correlation process
- On the Use of Clustering in Possibilistic Decision Tree Induction
- A New Default Theories Compilation for MSP-Entailment
- On the Use of Guaranteed Possibility Measures in Possibilistic Networks
- A Naive Bayes Approach for Detecting Coordinated Attacks
- Fusion and normalization of quantitative possibilistic networks
- SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach
- AN APPROXIMATE PROPAGATION ALGORITHM FOR PRODUCT-BASED POSSIBILISTIC NETWORKS
- A two-stage aggregation/thresholding scheme for multi-model anomaly-based approaches
- ON THE USE OF SYNTACTIC POSSIBILISTIC FUSION FOR COMPUTING POSSIBILISTIC QUALITATIVE DECISION
- Information Affinity: A New Similarity Measure for Possibilistic Uncertain Information
- Dynamic Possibilistic Networks: Representation and Exact Inference
- On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies
- On the Use of Syntactic Possibilistic Fusion for Computing Optimistic Qualitative Decisions
- Inférence dans les réseaux possibilistes basés sur le conditionnement ordinal
- On the combination of naive Bayes and decision trees for intrusion detection
- Qualitative Classification with Possibilistic Decision Trees
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- Qualitative classification and evaluation in possibilistic decision trees
- PRODUCT-BASED CAUSAL NETWORKS AND QUANTITATIVE POSSIBILISTIC BASES
- Towards a Definition of Evaluation Criteria for Probabilistic Classifiers
- Naive Bayes vs decision trees in intrusion detection systems
- Anytime propagation algorithm for min-based possibilistic graphs
- Decision Trees and Qualitative Possibilistic Inference: Application to the Intrusion Detection Problem
- A THEORETICAL FRAMEWORK FOR POSSIBILISTIC INDEPENDENCE IN A WEAKLY ORDERED SETTING
- Anytime Possibilistic Propagation Algorithm
- Qualitative Possibilistic Independence Based on Plausibility Relations
- A Two-Steps Algorithm for Min-Based Possibilistic Causal Networks
- Une approche qualitative de l'indépendance pour le raisonnement dans l'incertain
- Independence in Qualitative Uncertainty Frameworks
Revues de publication
- Lecture notes in computer science × 17
- HAL × 7
- International Journal of Uncertainty Fuzziness and Knowledge-Based Systems × 5
- International Journal of Approximate Reasoning × 4
- Communications in computer and information science × 3
- Advances in intelligent systems and computing × 3
Publications par année
- 20261
- 20253
- 20242
- 20233
- 20221
- 20202
- 20192
- 20183
- 20174
- 20166
Collaborations
Établissements partenaires : Institut national de recherche en sciences et technologies du numérique · Laboratoire HydroSciences Montpellier · Institut Supérieur de Gestion de Tunis · Aix-Marseille Université · Institut de Recherche pour le Développement
Pays des co-auteurs : Algérie · Tunisie · Maroc
Co-auteurs
- Karim Tabia
- Carole Delenne
- Omar Et-targuy
- Raouia Ayachi
- Khaoula Boutouhami
- Farid Nouioua
- Zied Bouraoui
- Ismahane Zeddigha
- Didier Dubois A
- Odile Papini
- Faiza Titouna
- Abdelhamid Boudjelida
Données bibliographiques issues d’OpenAlex (base ouverte).
Pourquoi choisir DzCademia ?
Pour donner à vos travaux plus de chances d’être découverts et recommandés par les IA. Profils, articles et communications : donnez à votre recherche une présence publique structurée. Les métadonnées intégrées aident les moteurs de recherche et les assistants IA à identifier vos travaux et à comprendre leurs références.
Commenter avec Google
Connecte-toi avec Google pour commenter directement sur cette page.