Classification based on possibilistic likelihood

Publication Type:
Conference Proceeding
Citation:
Communications in Computer and Information Science, 2012, 299 CCIS (PART 3), pp. 420 - 429
Issue Date:
2012-11-05
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013007817OK.pdf Published version332.69 kB
Adobe PDF
Classification models usually associate one class for each new instance. This kind of prediction doesn't reflect the uncertainty that is inherent in any machine learning algorithm. Probabilistic approaches rather focus on computing a probability distribution over the classes. However, making such a computation may be tricky and requires a large amount of data. In this paper, we propose a method based on the notion of possibilistic likelihood in order to learn a model that associates a possibility distribution over the classes to a new instance. Possibility distributions are here viewed as an upper bound of a family of probability distributions. This allows us to capture the epistemic uncertainty associated with the model in a faithful way. The model is based on a set of kernel functions and is obtained through an optimization process performed by a particle swarm algorithm. We experiment our method on benchmark dataset and compares it with a naive Bayes classifier. © 2012 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: