- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c27 |      | Raouia Ayachi, Nahla Ben Amor, Salem Benferhat: Inference Using Compiled Product-Based Possibilistic Networks. IPMU (3) 2012: 470-480 |
| c26 | | Raouia Ayachi, Nahla Ben Amor, Salem Benferhat: Possibilistic Local Structure for Compiling Min-Based Networks. SMPS 2012: 479-487 |
| i2 | | Hélène Fargier, Nahla Ben Amor, Wided Guezguez: On the Complexity of Decision Making in Possibilistic Decision Trees. CoRR abs/1202.3718 (2012) |
| i1 | | Raouia Ayachi, Nahla Ben Amor, Salem Benferhat, Rolf Haenni: Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference. CoRR abs/1203.3465 (2012) |
| 2011 | ||
| c25 | | Montassar Ben Messaoud, Philippe Leray, Nahla Ben Amor: SemCaDo: A Serendipitous Strategy for Learning Causal Bayesian Networks Using Ontologies. ECSQARU 2011: 182-193 |
| c24 | | Raouia Ayachi, Nahla Ben Amor, Salem Benferhat: Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach. ECSQARU 2011: 700-712 |
| c23 |  | Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor: A Two-way Approach for Probabilistic Graphical Models Structure Learning and Ontology Enrichment. KEOD 2011: 189-194 |
| c22 | | Raouia Ayachi, Nahla Ben Amor, Salem Benferhat: An Augmented-Based Approach for Compiling Min-based Possibilistic Causal Networks. ICTAI 2011: 675-678 |
| c21 | | Hélène Fargier, Nahla Ben Amor, Wided Guezguez: On the Complexity of Decision Making in Possibilistic Decision Trees. UAI 2011: 203-210 |
| c20 | | Raouia Ayachi, Nahla Ben Amor, Salem Benferhat: Experimental Comparative Study of Compilation-Based Inference in Bayesian and Possibilitic Networks. WILF 2011: 155-163 |
| 2010 | ||
| c19 | | Ahmed Badreddine, Nahla Ben Amor: A dynamic barriers implementation in Bayesian-based bow tie diagrams for risk analysis. AICCSA 2010: 1-8 |
| c18 | | Ahmed Badreddine, Nahla Ben Amor: A New Approach to Construct Optimal Bow Tie Diagrams for Risk Analysis. IEA/AIE (2) 2010: 595-604 |
| c17 | | Nahla Ben Amor, Hélène Fargier, Wided Guezguez: Necessity-Based Choquet Integrals for Sequential Decision Making under Uncertainty. IPMU 2010: 521-531 |
| c16 | | Raouia Ayachi, Nahla Ben Amor, Salem Benferhat, Rolf Haenni: Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference. UAI 2010: 40-47 |
| 2009 | ||
| j10 | | Wided Guezguez, Nahla Ben Amor, Khaled Mellouli: Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities. European Journal of Operational Research 195(1): 223-238 (2009) |
| j9 | | Bakhta Haouari, Nahla Ben Amor, Zied Elouedi, Khaled Mellouli: Naïve possibilistic network classifiers. Fuzzy Sets and Systems 160(22): 3224-3238 (2009) |
| j8 | | Khaled Mellouli, Zied Elouedi, Nahla Ben Amor, Boutheina Ben Yaghlane: Special Issue on the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2007). Int. J. Approx. Reasoning 50(6): 823-824 (2009) |
| c15 | | Montassar Ben Messaoud, Philippe Leray, Nahla Ben Amor: Integrating Ontological Knowledge for Iterative Causal Discovery and Visualization. ECSQARU 2009: 168-179 |
| c14 | | Raouia Ayachi, Nahla Ben Amor: Brain Tumor Segmentation Using Support Vector Machines. ECSQARU 2009: 736-747 |
| c13 | | Ahmed Badreddine, Taieb Ben Romdhane, Nahla Ben Amor: A Multi-objective Approach to Implement an Integrated Management System: Quality, Security, Environment. SMC 2009: 4728-4733 |
| 2008 | ||
| j7 | | Ilyes Jenhani, Nahla Ben Amor, Zied Elouedi: Decision trees as possibilistic classifiers. Int. J. Approx. Reasoning 48(3): 784-807 (2008) |
| j6 | | Hanen Borchani, Nahla Ben Amor, Fédia Khalfallah: Learning and Evaluating Bayesian Network Equivalence Classes from Incomplete Data. IJPRAI 22(2): 253-278 (2008) |
| c12 | | Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zied Elouedi: SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach. FoIKS 2008: 348-364 |
| 2007 | ||
| j5 | | Nahla Ben Amor, Salem Benferhat, Khaled Mellouli, Salma Smaoui: Inférence dans les réseaux possibilistes basés sur le conditionnement ordinal. Revue d'Intelligence Artificielle 21(4): 489-519 (2007) |
| c11 | | Hanen Borchani, Maher Chaouachi, Nahla Ben Amor: Learning Causal Bayesian Networks from Incomplete Observational Data and Interventions. ECSQARU 2007: 17-29 |
| c10 | | Ilyes Jenhani, Nahla Ben Amor, Zied Elouedi, Salem Benferhat, Khaled Mellouli: Information Affinity: A New Similarity Measure for Possibilistic Uncertain Information. ECSQARU 2007: 840-852 |
| 2006 | ||
| j4 | | Nahla Ben Amor, Salem Benferhat, Zied Elouedi: Réseaux bayésiens naïfs et arbres de décision dans les systèmes de détection d'intrusions. Technique et Science Informatiques 25(2): 167-196 (2006) |
| c9 | | Hanen Borchani, Nahla Ben Amor, Khaled Mellouli: Learning Bayesian Network Equivalence Classes from Incomplete Data. Discovery Science 2006: 291-295 |
| 2005 | ||
| j3 | | Nahla Ben Amor, Salem Benferhat: Graphoid Properties Of Qualitative Possibilistic Independence Relations. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 13(1): 59-96 (2005) |
| c8 | | Nahla Ben Amor, Salem Benferhat, Zied Elouedi: Towards a Definition of Evaluation Criteria for Probabilistic Classifiers. ECSQARU 2005: 921-931 |
| c7 | | Ilyes Jenhani, Zied Elouedi, Nahla Ben Amor, Khaled Mellouli: Qualitative Inference in Possibilistic Option Decision Trees. ECSQARU 2005: 944-955 |
| 2004 | ||
| c6 | | Nahla Ben Amor, Salem Benferhat, Zied Elouedi: Naive Bayes vs decision trees in intrusion detection systems. SAC 2004: 420-424 |
| 2003 | ||
| j2 | | Nahla Ben Amor, Salem Benferhat, Khaled Mellouli: Anytime propagation algorithm for min-based possibilistic graphs. Soft Comput. 8(2): 150-161 (2003) |
| c5 | | Yannick Le Moullec, Nahla Ben Amor, Jean-Philippe Diguet, Mohamed Abid, Jean Luc Philippe: Multi-Granularity Metrics for the Era of Strongly Personalized SOCs. DATE 2003: 10674-10681 |
| c4 | | Nahla Ben Amor, Salem Benferhat, Zied Elouedi, Khaled Mellouli: Decision Trees and Qualitative Possibilistic Inference: Application to the Intrusion Detection Problem. ECSQARU 2003: 419-431 |
| 2002 | ||
| j1 | | Nahla Ben Amor, Khaled Mellouli, Salem Benferhat, Didier Dubois, Henri Prade: A Theoretical Framework for Possibilistic Independence in a Weakly Ordered Setting. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(2): 117-155 (2002) |
| c3 | | Nahla Ben Amor, Salem Benferhat, Khaled Mellouli: Anytime Possibilistic Propagation Algorithm. Soft-Ware 2002: 263-279 |
| 2001 | ||
| c2 | | Nahla Ben Amor, Salem Benferhat, Khaled Mellouli: A Two-Steps Algorithm for Min-Based Possibilistic Causal Networks. ECSQARU 2001: 266-277 |
| 2000 | ||
| c1 | | Nahla Ben Amor, Salem Benferhat, Didier Dubois, Hector Geffner, Henri Prade: Independence in qualitative uncertainty frameworks. KR 2000: 235-246 |
Colors in the list of coauthors
Last update Tue May 21 18:22:17 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page