A decision-tree framework for instance-space decomposition

Shahar Cohen, Lior Rokach, Oded Maimon

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

This paper presents a novel instance-space decomposition framework for decision trees. According to this framework, the original instance-space is decomposed into several subspaces in a parallel-to-axis manner. A different classifier is assigned to each subspace. Subsequently, an unlabelled instance is classified by employing the appropriate classifier based on the subspace where the instance belongs. An experimental study which was conducted in order to compare various implementations of this framework indicates that previously presented implementations can be improved both in terms of accuracy and computation time.

Original languageEnglish
Title of host publicationAdvances in Web Intelligence and Data Mining
EditorsMark Last, Piotr Szczepaniak, Piotr Szczepaniak, Zeev Vlvolkov, Abraham Kandel
PublisherSpringer Berlin Heidelberg
Pages265-274
Number of pages10
ISBN (Print)3540338799, 9783540338796
DOIs
StatePublished - 2006

Publication series

NameStudies in Computational Intelligence
Volume23
ISSN (Print)1860-949X

Fingerprint

Dive into the research topics of 'A decision-tree framework for instance-space decomposition'. Together they form a unique fingerprint.

Cite this