Independence Diagrams: A Technique for Visual Data Mining

An important issue in data mining is the recognition of complex dependencies between attributes. Past techniques for identifying attribute dependence include correlation coefficients, scatterplots, and equiwidth histograms. These techniques are sensitive to outliers, and often are not sufficiently informative to identify the kind of attribute dependence present. We propose a new approach, which we call independence diagrams. We divide each attribute into ranges; for each pair of attributes, the combination of these ranges defines a two-dimensional grid. For each cell of this grid, we store the number of data items in it. We display the grid, scaling each attribute axis so that the displayed width of a range is proportional to the total number of data items within that range. The brightness of a cell is proportional to the density of data items in it. As a result, both attributes are independently normalized by frequency, ensuring insensitivity to outliers and skew, and allowing specif...

• Type: Conference
• Year: 1998
• Where: KDD
• Authors: Stefan Berchtold, H. V. Jagadish, Kenneth A. Ross
• Keywords: Attribute Dependence, Data Items, Data Mining, Dependence Include Correlation, KDD 1998