CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1996 vol.18 Issue No.02 - February
Issue No.02 - February (1996 vol.18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.481538
<p>Abstract—In this paper we propose a <it>rule-based</it> inductive learning algorithm called <it>Multiscale Classification</it> (MSC). It can be applied to any <it>N</it>-dimensional real or binary classification problem to classify the training data by successively splitting the feature space in half. The algorithm has several significant differences from existing rule-based approaches: learning is incremental, the tree is non-binary, and backtracking of decisions is possible to some extent.</p><p>The paper first provides background on current machine learning techniques and outlines some of their strengths and weaknesses. It then describes the MSC algorithm and compares it to other inductive learning algorithms with particular reference to ID3, C4.5, and back-propagation neural networks. Its performance on a number of standard benchmark problems is then discussed and related to standard learning issues such as generalization, representational power, and over-specialization.</p>
Multiscale classification, decision trees, inductive machine learning, tree pruning.
Brian C. Lovell, Andrew P. Bradley, "The Multiscale Classifier", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.18, no. 2, pp. 124-137, February 1996, doi:10.1109/34.481538