|
Search the dblp DataBase
Khaled Mellouli:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Zied Elouedi, Khaled Mellouli, Philippe Smets
Classification with Belief Decision Trees. [Citation Graph (0, 0)][DBLP] AIMSA, 2000, pp:80-90 [Conf]
- Sarra Ben Hariz, Zied Elouedi, Khaled Mellouli
Clustering Approach Using Belief Function Theory. [Citation Graph (0, 0)][DBLP] AIMSA, 2006, pp:162-171 [Conf]
- Hanen Borchani, Nahla Ben Amor, Khaled Mellouli
Learning Bayesian Network Equivalence Classes from Incomplete Data. [Citation Graph (0, 0)][DBLP] Discovery Science, 2006, pp:291-295 [Conf]
- Zied Elouedi, Khaled Mellouli
Classiying Scenarios Using Belief Decision Trees. [Citation Graph (0, 0)][DBLP] Discovery Science, 2000, pp:127-140 [Conf]
- Nahla Ben Amor, Salem Benferhat, Zied Elouedi, Khaled Mellouli
Decision Trees and Qualitative Possibilistic Inference: Application to the Intrusion Detection Problem. [Citation Graph (0, 0)][DBLP] ECSQARU, 2003, pp:419-431 [Conf]
- Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
A Two-Steps Algorithm for Min-Based Possibilistic Causal Networks. [Citation Graph (0, 0)][DBLP] ECSQARU, 2001, pp:266-277 [Conf]
- Ilyes Jenhani, Zied Elouedi, Nahla Ben Amor, Khaled Mellouli
Qualitative Inference in Possibilistic Option Decision Trees. [Citation Graph (0, 0)][DBLP] ECSQARU, 2005, pp:944-955 [Conf]
- Zied Elouedi, Khaled Mellouli, Philippe Smets
The Evaluation of Sensors' Reliability and Their Tuning for Multisensor Data Fusion within the Transferable Belief Model. [Citation Graph (0, 0)][DBLP] ECSQARU, 2001, pp:350-361 [Conf]
- Fédia Khalfallah, Khaled Mellouli
Optimized Algorithm for Learning Bayesian Network from Data. [Citation Graph (0, 0)][DBLP] ESCQARU, 1999, pp:221-232 [Conf]
- Amel Ben Yaghlane, Thierry Denoeux, Khaled Mellouli
Coarsening Approximations of Belief Functions. [Citation Graph (0, 0)][DBLP] ECSQARU, 2001, pp:362-373 [Conf]
- Boutheina Ben Yaghlane, Khaled Mellouli
Updating Directed Belief Networks. [Citation Graph (0, 0)][DBLP] ESCQARU, 1999, pp:43-54 [Conf]
- Boutheina Ben Yaghlane, Philippe Smets, Khaled Mellouli
About Conditional Belief Function Independence. [Citation Graph (0, 0)][DBLP] ECSQARU, 2001, pp:340-349 [Conf]
- Boutheina Ben Yaghlane, Philippe Smets, Khaled Mellouli
Directed Evidential Networks with Conditional Belief Functions. [Citation Graph (0, 0)][DBLP] ECSQARU, 2003, pp:291-305 [Conf]
- Rim Faiz, Nizar Khayati, Khaled Mellouli
Optimisation des requêtes temporelles sur le web. [Citation Graph (0, 0)][DBLP] EGC, 2004, pp:504- [Conf]
- Rim Faiz, Najeh Naffakhi, Khaled Mellouli
Apprentissage supervisé pour la classification des images basé sur la structure P-tree. [Citation Graph (0, 0)][DBLP] EGC, 2005, pp:469-480 [Conf]
- Thabet Slimani, Boutheina Ben Yaghlane, Khaled Mellouli
Approche binaire pour la génération des fortes règles d'association. [Citation Graph (0, 0)][DBLP] EGC, 2004, pp:329-340 [Conf]
- Khaled Mellouli
Decision Making Using Belief Functions: Evaluation of Information. [Citation Graph (0, 0)][DBLP] IPMU, 1994, pp:77-83 [Conf]
- Khaled Mellouli, Glenn Shafer, Prakash P. Shenoy
Qualitative Markov networks. [Citation Graph (0, 0)][DBLP] IPMU, 1986, pp:69-74 [Conf]
- Rim Faiz, Sami Mahfoudhi, Khaled Mellouli
Web Services as a Tool for Information Systems Effectiveness. [Citation Graph (0, 0)][DBLP] SAINT Workshops, 2005, pp:362-365 [Conf]
- Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Anytime Possibilistic Propagation Algorithm. [Citation Graph (0, 0)][DBLP] Soft-Ware, 2002, pp:263-279 [Conf]
- Prakash P. Shenoy, Glenn Shafer, Khaled Mellouli
Propagation of belief functions: a distributed approach. [Citation Graph (0, 0)][DBLP] UAI, 1986, pp:325-336 [Conf]
- Zied Elouedi, Khaled Mellouli, Philippe Smets
Belief decision trees: theoretical foundations. [Citation Graph (0, 0)][DBLP] Int. J. Approx. Reasoning, 2001, v:28, n:2-3, pp:91-124 [Journal]
- Glenn Shafer, Prakash P. Shenoy, Khaled Mellouli
Propagating belief functions in qualitative Markov trees. [Citation Graph (0, 0)][DBLP] Int. J. Approx. Reasoning, 1987, v:1, n:4, pp:349-400 [Journal]
- Boutheina Ben Yaghlane, Philippe Smets, Khaled Mellouli
Belief function independence: II. The conditional case. [Citation Graph (0, 0)][DBLP] Int. J. Approx. Reasoning, 2002, v:31, n:1-2, pp:31-75 [Journal]
- Boutheina Ben Yaghlane, Philippe Smets, Khaled Mellouli
Belief function independence: I. The marginal case. [Citation Graph (0, 0)][DBLP] Int. J. Approx. Reasoning, 2002, v:29, n:1, pp:47-70 [Journal]
- Nahla Ben Amor, Khaled Mellouli, Salem Benferhat, Didier Dubois, Henri Prade
A Theoretical Framework for Possibilistic Independence in a Weakly Ordered Setting. [Citation Graph (0, 0)][DBLP] International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002, v:10, n:2, pp:117-155 [Journal]
- Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Anytime propagation algorithm for min-based possibilistic graphs. [Citation Graph (0, 0)][DBLP] Soft Comput., 2003, v:8, n:2, pp:150-161 [Journal]
- Christophe Gonzales, Khaled Mellouli, Olfa Mourali
On Directed and Undirected Propagation Algorithms for Bayesian Networks. [Citation Graph (0, 0)][DBLP] ECSQARU, 2007, pp:598-610 [Conf]
- Ilyes Jenhani, Nahla Ben Amor, Zied Elouedi, Salem Benferhat, Khaled Mellouli
Information Affinity: A New Similarity Measure for Possibilistic Uncertain Information. [Citation Graph (0, 0)][DBLP] ECSQARU, 2007, pp:840-852 [Conf]
Langage de recherche d'associations sémantiques à partir d'une base de connaissances. [Citation Graph (, )][DBLP]
Incremental Maintenance of Frequent Itemsets in Evidential Databases. [Citation Graph (, )][DBLP]
Frequent Itemset Mining from Databases Including One Evidential Attribute. [Citation Graph (, )][DBLP]
From Bayesian Classifiers to Possibilistic Classifiers for Numerical Data. [Citation Graph (, )][DBLP]
Evaluation d'associations sémantiques dans une ontologie de domaine. [Citation Graph (, )][DBLP]
Using Class-Based Reasoning to Improve the Accuracy of Symbolic Rules in a Hybrid Possibilistic Approach. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
|