In this paper, we propose a new method for measuring the closeness of multiple sets of rules that are combined using Dempster’s rule of combination to improve classification performance. The closeness provides an insight into combining multiple sets of rules in classification − in what circumambience the performance of combinations of some sets of rules using Dempster’s rule is better than that of others. Experiments have been carried out over the 20-newsgroups benchmark data collection, and the empirical results show that when the closeness between two sets of rules is higher than that of others, the performance of its combination using Dempster’s rule is better than the others.
|Title of host publication||PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science|
|Publication status||Published - 2006|