Each attribute value is represented by one colored pixel (the value ranges of the attributes are mapped to a fixed color map).
Different attributes are presented in separate sub windows.
Visual Data Mining: Framework and Algorithm Development Ganesh, M., Han, E.H., Kumar, V., Shekar, S., & Srivastava, J. (1996). Working Paper. Twin Cities, MN: University of Minnesota, Twin Cities Campus.
Learning a classification decision tree from a training data set can be regarded as a process of searching for the best decision tree that meets user-provided goal constraints.
The problem space of this search process consists of Model Candidates, Model Candidate Generator and Model Constraints.
Many existing classification-learning algorithms like C4.5 and CDP fit nicely within this search framework. New learning algorithms that fit user’s requirements can be developed by defining the components of the problem space.