Clustering approach using belief function theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4183 LNCS, Issue , 2006, Pages 162-171

  Hariz, Sarra Ben ^a   Elouedi, Zied ^a   Mellouli, Khaled ^a  

^a UNIVERSITÉ DE TUNIS   (Tunisia)

Author keywords

Belief function theory; Clustering; K modes method; Machine learning; Uncertainty

Indexed keywords

ALGORITHMS; DATA HANDLING; DATA STRUCTURES; LEARNING SYSTEMS; MATHEMATICAL MODELS;

BELIEF FUNCTION THEORY; DATA SETS; K-MODES METHOD;

DATABASE SYSTEMS;

EID: 33750225286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Bauer, Approximations for efficient computation in the theory of evidence, Arttif.Intell. 61(2), 315-329, 1993.
2. E. Bosse, A-L. Jousselme, and D. Grenier: A new distance between two bodies of evidence. In Information Fusion 2, 91-101, 2001.
3. T.M. Cover and P.E. Hart, Nearest neighbor pattern classification, IEEE Trans Inform Theory, vol. IT-13, 21-27, 1967.
4. T. Denoeux, A k-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Transactions on Systems, Man and Cybernetics, 25 (5), 804-813, 1995.
5. Z. Elouedi, K. Mellouli, P. Smets. Belief Decision trees: Theoretical foundations. International Journal of Approximat Reasoning, Vol 28, Issues 2-3, 91-124, 2001.
6. Z. Elouedi, K. Mellouli, and Ph. Smets. Assessing sensor reliability for multisensor data fusion within the transferable belief model.IEEE Trans Syst Man Cybern B Cybern, 34(1),782-787, 2004.
7. D. Fixen and R.P.S. Mahler, The modified Dempster-Shafer approach to classification, IEEE Trans.Syst.Man Cybern. A 27(1), 96-104, 1997.
8. Z. Huang: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining Knowl.Discov., Vol.2, No.2,283-304, 1998
9. A.K. Jain and R.C. Dubes: Algorithms for clustering data. Prentice-Hall, Englewood cliffs, NJ, 1988.
10. J. MacQueen: Some methods for classification and analysis of multivariate observations. In: Proc.of the Fifth Berkeley Symposium on Math, Stat. and Prob Vol 1, 281-296, 1967.
11. P.M. Murphy and D.W. Aha. Uci repository databases, http://www.ics.uci. edu/mlearn., 1996.
12. J.R. Quinlan, Learning efficient classification and their application to chess end games. In R. S. Michalski, J. G. Carbonell, and T. M. Michell (Eds.), Machnie Learning: An artificial intelligence approach, 463-482. Morgan Kaufmann, 1983.
13. G. Shafer A mathematical theory of evidence. Princeton Univ. Press. Princeton, NJ.30, 1976.
14. Ph. Smets and R. Kennes: The transferable belief model. Artificial Intelligence, 66: 191-234, 1994.
15. D.E. Rumelhart, G.E. Hinton, and R.J. Williams, Learning internal representations by error propagation. In D.E. Rumelhart and J.L. McClelland, editors, Parallel Distributed Processing. Cambridge, MA: MIT Press, 1986.
16. Ph. Smets: The transferable belief model for quantified belief representation. In D. M. Gabbay and P. Smets (Eds.), Handbook of defeasible reasoning and uncertainty management systems, Vol 1, 267-301, 1998b.
17. B. Tessem, Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - an empirical study, Int.J.Approx.Reason. 17(2-3) 217, 1997.
18. L.M. Zouhal and T. Denoeux, An evidence-theory k-NN rule with parameter optimization, IEEE Trans.Syst.Man Cybern. C 28(2), 263-271, 1998.