Multi-dimensional data inspection for supervised classification with eigen transformation classification trees

  • Authors:
  • Steven De Bruyne;Frank Plastria

  • Affiliations:
  • Vrije Universiteit Brussel;Vrije Universiteit Brussel

  • Venue:
  • PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data visualisation can be a great support to the data mining process. We introduce a data structure that allows browsing through the data giving a complete but very manageable overview over the entire data set, where the data is split into subsets and displayed from interesting angles to reveal the relevant patterns for each subset. Based on the features originating from principal separation analysis, a tree is grown. A node of the tree is associated with a feature and a subset of instances, and later on with a two-dimensional visualisation. At the node level, groups of instances of different classes that can be displayed from a more interesting angle are temporarily grouped together in subsets. For each of these subsets child nodes are created that display this part of the data from a more interesting angle, revealing new patterns. This process is continued until no further improved visualisation can be found. After the tree has been constructed, it can be used to easily browse through the data. The nodes correspond with two-dimensional visualisations of the data, but the specific properties of the tree allow for three-dimensional animated transitions from one node to another, further clarifying the patterns in the data.