Search

Your search keyword '"Mellouli, Khaled"' showing total 336 results
Start Over Author "Mellouli, Khaled"

Refine your results

more »

more »

more »

more »
336 results on '"Mellouli, Khaled"'

2. Propagation of Belief Functions: A Distributed Approach

Author

Shenoy, Prakash P., Shafer, Glenn, and Mellouli, Khaled

Subjects
Computer Science - Artificial Intelligence
Abstract

In this paper, we describe a scheme for propagating belief functions in certain kinds of trees using only local computations. This scheme generalizes the computational scheme proposed by Shafer and Logan1 for diagnostic trees of the type studied by Gordon and Shortliffe, and the slightly more general scheme given by Shafer for hierarchical evidence. It also generalizes the scheme proposed by Pearl for Bayesian causal trees (see Shenoy and Shafer). Pearl's causal trees and Gordon and Shortliffe's diagnostic trees are both ways of breaking the evidence that bears on a large problem down into smaller items of evidence that bear on smaller parts of the problem so that these smaller problems can be dealt with one at a time. This localization of effort is often essential in order to make the process of probability judgment feasible, both for the person who is making probability judgments and for the machine that is combining them. The basic structure for our scheme is a type of tree that generalizes both Pearl's and Gordon and Shortliffe's trees. Trees of this general type permit localized computation in Pearl's sense. They are based on qualitative judgments of conditional independence. We believe that the scheme we describe here will prove useful in expert systems. It is now clear that the successful propagation of probabilities or certainty factors in expert systems requires much more structure than can be provided in a pure production-system framework. Bayesian schemes, on the other hand, often make unrealistic demands for structure. The propagation of belief functions in trees and more general networks stands on a middle ground where some sensible and useful things can be done. We would like to emphasize that the basic idea of local computation for propagating probabilities is due to Judea Pearl. It is a very innovative idea; we do not believe that it can be found in the Bayesian literature prior to Pearl's work. We see our contribution as extending the usefulness of Pearl's idea by generalizing it from Bayesian probabilities to belief functions. In the next section, we give a brief introduction to belief functions. The notions of qualitative independence for partitions and a qualitative Markov tree are introduced in Section III. Finally, in Section IV, we describe a scheme for propagating belief functions in qualitative Markov trees., Comment: Appears in Proceedings of the Second Conference on Uncertainty in Artificial Intelligence (UAI1986)

Published
2013

3. A Generic Algorithm for Traversing a Directed Acyclic Graph: An Application to the Home Health Care Scheduling Problem.

Author

Chaieb, Marouene, Jemai, Jaber, Ben Sassi, Dhekra, and Mellouli, Khaled

Subjects
HOME care services, DIRECTED acyclic graphs, DIRECTED graphs, COMBINATORIAL optimization, ALGORITHMS, SCHEDULING
Abstract

Recently, Hierarchical Optimization Models (HOM) have been widely used to model Combinatorial Optimization Problems (COP) in numerous fields including transport, supply chain economics, healthcare, etc. Their efficiency as a modeling approach is justified by their ability to ease the difficulty of the studied COP. The main problem will be decomposed hierarchically into a set of interconnected subproblems using multiple decomposition strategies. However, solving the hierarchical optimization model presents a great challenge and difficult task to get an optimal solution for the main problem. In this context, we propose a generic algorithm to efficiently solve the hierarchical optimization model. Moreover, the developed algorithm will be able to solve all kinds of hierarchical optimization models using any decomposition strategy. To validate the proposed modeling and solving approach, we solved the Home Health Care Scheduling Problem (HCSP) by conducting some experiments on a set of real-world data instances. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

8. A Possibilistic Rule-Based Classifier

Author

Bounhas, Myriam, Prade, Henri, Serrurier, Mathieu, Mellouli, Khaled, Greco, Salvatore, editor, Bouchon-Meunier, Bernadette, editor, Coletti, Giulianella, editor, Fedrizzi, Mario, editor, Matarazzo, Benedetto, editor, and Yager, Ronald R., editor

Published
2012
Full Text
View/download PDF

9. An NSGA-II Algorithm for the Green Vehicle Routing Problem

Author

Jemai, Jaber, Zekri, Manel, Mellouli, Khaled, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hao, Jin-Kao, editor, and Middendorf, Martin, editor

Published
2012
Full Text
View/download PDF

10. Possibilistic Classifiers for Uncertain Numerical Data

Author

Bounhas, Myriam, Prade, Henri, Serrurier, Mathieu, Mellouli, Khaled, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, and Liu, Weiru, editor

Published
2011
Full Text
View/download PDF

12. From Bayesian Classifiers to Possibilistic Classifiers for Numerical Data

Author

Bounhas, Myriam, Mellouli, Khaled, Prade, Henri, Serrurier, Mathieu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Deshpande, Amol, editor, and Hunter, Anthony, editor

Published
2010
Full Text
View/download PDF

14. Incremental Maintenance of Frequent Itemsets in Evidential Databases

Author

Bach Tobji, Mohamed Anis, Ben Yaghlane, Boutheina, Mellouli, Khaled, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Sossai, Claudio, editor, and Chemello, Gaetano, editor

Published
2009
Full Text
View/download PDF

16. Learning Bayesian Network Equivalence Classes from Incomplete Data

Author

Borchani, Hanen, Ben Amor, Nahla, Mellouli, Khaled, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Todorovski, Ljupčo, editor, Lavrač, Nada, editor, and Jantke, Klaus P., editor

Published
2006
Full Text
View/download PDF

17. Clustering Approach Using Belief Function Theory

Author

Ben Hariz, Sarra, Elouedi, Zied, Mellouli, Khaled, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Euzenat, Jérôme, editor, and Domingue, John, editor

Published
2006
Full Text
View/download PDF

18. Qualitative Inference in Possibilistic Option Decision Trees

Author

Jenhani, Ilyes, Elouedi, Zied, Amor, Nahla Ben, Mellouli, Khaled, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, and Godo, Lluís, editor

Published
2005
Full Text
View/download PDF

22. Independence Concepts for Belief Functions

Author

Ben Yaghlane, Boutheina, Smets, Philippe, Mellouli, Khaled, Kacprzyk, Janusz, editor, Bouchon-Meunier, Bernadette, editor, Gutiérrez-Ríos, Julio, editor, Magdalena, Luis, editor, and Yager, Ronald R., editor

Published
2002
Full Text
View/download PDF

25. Coarsening Approximations of Belief Functions

Author

Yaghlane, Amel Ben, Denœux, Thierry, Mellouli, Khaled, Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Benferhat, Salem, editor, and Besnard, Philippe, editor

Published
2001
Full Text
View/download PDF

27. About Conditional Belief Function Independence

Author

Yaghlane, Boutheina Ben, Smets, Philippe, Mellouli, Khaled, Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Benferhat, Salem, editor, and Besnard, Philippe, editor

Published
2001
Full Text
View/download PDF

29. Updating Directed Belief Networks

Author

Yaghlane, Boutheina Ben, Mellouli, Khaled, Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Hunter, Anthony, editor, and Parsons, Simon, editor

Published
1999
Full Text
View/download PDF

43. Assessing sensor reliability for multisensor data fusion within the transferable belief model

Author

Elouedi, Zied, Mellouli, Khaled, and Smets, Philippe

Abstract

This paper presents a method for assessing the reliability of a sensor in a classification problem based on the transferable belief model. First, we develop a method for the evaluation of the reliability of a sensor when considered alone. The method is based on finding the discounting racer minimizing the distance between the pignistic probabilities computed from the discounted beliefs and the actual values of data. Next, we develop a method for assessing the reliability of several sensors that are supposed to work jointly and their readings are aggregated. The discounting factors are computed on the basis of minimizing the distance between the pignistic probabilities computed from the combined discounted belief functions and the actual values of data. Index Terms--Multisensor data fusion, sensor reliability, transferable belief model.

Published
2004

Catalog

Books, media, physical & digital resources
See catalog results