A modular decision-tree architecture for better problem understanding

  • Authors:
  • Vineet R. Khare;Halasya Siva Subramania

  • Affiliations:
  • India Science Lab, General Motors Global Research and Development, GM Technical Centre India Pvt Ltd, International Tech Park Ltd., Bangalore, India;India Science Lab, General Motors Global Research and Development, GM Technical Centre India Pvt Ltd, International Tech Park Ltd., Bangalore, India

  • Venue:
  • SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a sequential decomposition method for multi-class pattern classification problems based on domain knowledge. A novel modular decision tree architecture is used to divide a K-class classification problem into a series of L smaller (binary or multiclass) sub-problems. The set of all K classes c = {c1, c2, . . . cK} is divided into smaller subsets (c = {s1, s2, . . . sL}) each of which contains classes that are related to each other. A modular approach is then used to solve (1) the binary sub-problems (pi = {si, si}) and (2) the smaller multiclass problem si = {ci1, ci2, . . . cin}. Problem decomposition helps in a better understanding of the problem without compromising on the classification accuracy. This is demonstrated using the rules generated by the C4.5 classifier using a monolithic system and the modular system.