In this paper we propose a generalised maximum-entropy classification framework, in which the empirical expectation of the feature functions is bounded by the lower and upper expectations associated with the lower and upper probabilities associated with a belief measure. This generalised setting permits a more cautious appreciation of the information content of a training set. We analytically derive the KarushKuhn-Tucker conditions for the generalised max-entropy classifier in the case in which a Shannon-like entropy is adopted.
Faculty of Technology, Design and Environment\School of Engineering, Computing and Mathematics
Year of publication: 2018Date of RADAR deposit: 2018-09-20
RADAR: Research Archive and Digital Asset RepositoryAbout RADAR