Exploratory data analysis , often performed interactively, is an established technique for learning about relations in a dataset prior to more formal analyses. Humans can easily identify patterns that are relevant for the task at hand but often difficult to model algorithmically. Current visual exploration systems lack a principled approach for this process. Our goal and main contribution in this paper is to devise a framework for human-guided data exploration by modeling the user’s background knowledge and objectives and using these to offer the user the most informative views of the data..
Our contribution consists of two main parts: (i) a framework to model and incorporate the user’s background knowledge of the data and to express the user’s objectives, and (ii) a system to show the most informative views of the data. The first contribution is general, but the second contribution, the most informative views of the data, is specific to a particular data type. In this paper we focus on data items that can be represented as real-valued vectors of attribute values.
As an example, consider the 4-dimensional toy data set shown in Fig. 1a. The dataset has been generated by first creating the strongly correlated attributes and , and then generating attribute by adding noise to , and attribute by adding noise to . The purpose of this example is to show how the user’s background knowledge and objectives affect the views that are most informative to the user.
Assume the user is interested in the relation of attributes and ; we call the relation of interest a hypothesis. Our task is to find a maximally informative 1-dimensional projection of the data that takes both this objective and the user’s background knowledge into account.111It is not usually possible for the user to view the whole distribution at once, hence, it is necessary, e.g., to view projections of the data.
First, assume that the user knows only the marginal distributions of the attributes but nothing of their relations. We argue that in such a case the user’s internal model of the data can be modeled by a distribution over data sets that we call the background distribution, which in this case can be sampled from by permuting the columns of the data matrix at random, shown by the red spheres in Fig. 1b. Because we are interested in the relation of we create another distribution in which are permuted together but the data is otherwise randomised, as shown by the blue squares in Fig. 1b. The red distribution models what the user knows and the blue what the user could optimally learn about the relation of from the data. The red and blue distributions differ most in the plot —as one would expect!—and indeed the maximally informative 1-dimensional projection is given by .222See Eq. (3) for a formal definition of informativeness used in this paper.
Secondly, assume that—unlike above—the user already knows the relationship of attributes and , but does not yet know that attributes are almost identical. We can repeat the previous exercise with the difference that we now add the user’s knowledge as constraints to both the red and blue distributions, i.e., we permute and together (modeling the user’s knowledge of these relations), as shown in Fig. 1c. Again, the red distribution models the user’s knowledge and the blue what the user could learn from the relation of from the data, given that the user already knows the relationships of and . The red and blue distributions differ most in plot and therefore the user would gain most information if shown this view; indeed, the most informative projection is . In other words, the knowledge of the relation of and gives maximal information about the relation of ! This makes sense, because variables are really connected via through their generative process.
Background model and objectives. We model the user’s background knowledge by a distribution over all datasets. We define the distribution using permutations and constraints on the permutations, which we call tiles. A tile is defined by a subset of data items and attributes. All attributes within a tile are permuted with the same permutation to conserve the relation between attributes. When the user has not seen the data, we assume that the background distribution is unconstrained and can be sampled from by permuting each attribute of the data at random. The user can input observations of the data using tiles. Essentially, by constructing a tile the user acknowledges that he or she knows the relations within the tile.
The tiles can also be used to formalise the user’s objectives. For example, if the user is interested in the interaction between two groups of variables, he or she can define two distributions using tiles, which we call hypotheses: one in which the interaction of interest is preserved and one in which it is broken. Any difference between these two hypotheses gives the user new information about the interaction of interest.
Finding views. The data and the hypotheses are typically high-dimensional and it is in practice not possible to view all relations at once; if it were, the whole problem would be trivial by just showing the user the entire dataset in one view. As a consequence, we need to construct a visualisation or a dimensionality reduction method that shows the most informative view (defined in Sec. 2
) of the differences between the hypotheses. We introduce a linear projection pursuit method that finds a projection in a direction in which the two hypotheses differ most. The proposed method seeks directions in which the ratio of the variance of these two distributions is maximal. At the limit of no background information and most generic hypotheses the method reduces to PCA (Thm.2.3).
The domain of interactive data exploration sets some further requirements for any implementation. On one hand, our system has no need of scaling to a huge number of data points, since visualising an extremely large number of points makes no sense. In practice, if the number of data points is large enough, we can always downsample the data to a manageable size. Therefore, our system has essentially a constant time complexity with respect to the number of data items, but not to the number of attributes, as shown later in Sec. 3. On the other hand, the response times must be on the order of seconds for fluid interaction. This rules out many slow to compute but otherwise sound approaches.
In summary, the contributions of this paper are: (i) a computationally efficient formulation and implementation of the user’s background model and hypotheses using constrained randomisation, (ii) a dimensionality reduction method to show the most informative view to the user, and (iii) an experimental evaluation that supports that our approach is fast, robust, and produces easily understandable results. The Appendix contains an algorithm for merging tiles (Sec. A), and an example demonstrating exploration of the German data (Secs. B and C)
Let be an data matrix (dataset). Here denotes the th element in column . Each column , is an attribute in the dataset, where we used the shorthand . Let be a finite set of domains (e.g., continuous or categorical) and let denote the domain of . Also let , i.e., all elements in a column belong to the same domain, but different columns can have different domains. The derivation in Sec. 2.1 is generic, but in Sec. 2.3 we consider only real numbers, for all .
2.1 Background model and tile constraints
In this subsection, we introduce the permutation-based sampling method and tiles which can be used to constrain the sampled distribution and to express the user’s background knowledge and objectives (hypotheses). The sampled distribution is constructed so that in the absence of constraints (tiles) the marginal distributions of the attributes are preserved.
We define a permutation of the data matrix as follows.
Let denote the set of permutation functions of length
is a bijection for all , and denote by the vector of column-specific permutations. A permutation of the data matrix is then given as . When permutation functions are sampled uniformly at random, we obtain a uniform sample from the distribution of datasets where each of the attributes has the same marginal distribution as the original data. We parametrise this distribution with tiles that preserve the relations in the data matrix for a subset of rows and columns: a tile is a tuple , where and
. The tiles considered here are combinatorial (in contrast to geometric), meaning that rows and columns in the tile do not need to be consecutive. In an unconstrained case, there areallowed vectors of permutations. The tiles constrain the set of allowed permutations as follows. [Tile constraint] Given a tile
, the vector of permutations is allowed by iff the following condition is true for all , , and :
Given a set of tiles , a set of permutations is allowed iff it is allowed by all . A tile defines a subset of rows and columns, and the rows in this subset are permuted by the same permutation function in each column in the tile. In other words, the relations between the columns inside the tile are preserved. Notice that the identity permutation is always an allowed permutation. Now, the sampling problem can be formulated as follows.
Problem 2.1 (Sampling problem)
Given a set of tiles , draw samples uniformly at random from vectors of permutations in allowed by .
The sampling problem is trivial when the tiles are non-overlapping, since permutations can be done independently within each non-overlapping tile. However, in the case of overlapping tiles, multiple constraints can affect the permutation of the same subset of rows and columns and this issue must be resolved. To this end, we need to define the equivalence of two sets of tiles, which means that the same constraints are enforced on the permutations. [Equivalence of sets of tiles] Let and be two sets of tiles. is equivalent to , if is allowed by iff is allowed by for all vectors of permutations .
We say that a set of tiles where no tiles overlap, is a tiling. Next, we show that there always exists a tiling equivalent to a set of tiles. Given a set of (possibly overlapping) tiles , there exists a tiling that is equivalent to . Let and be two overlapping tiles. Each tile describes a set of constraints on the allowed permutations of the rows in their respective column sets and . A tiling equivalent to is given by:
Tiles and represent the non-overlapping parts of and and the permutation constraints by these parts can be directly met. Tile takes into account the combined effect of and on their intersecting row set, in which case the same permutation constraints must apply to the union of their column sets. It follows that these three tiles are non-overlapping and enforce the combined constraints of tiles and . Hence, a tiling can be constructed by iteratively resolving overlap in a set of tiles until no tiles overlap. Notice that merging overlapping tiles leads to wider (larger column set) and lower (smaller row set) tiles. The limiting case is a fully-constrained situation where each row is a separate tile and only the identity permutation is allowed. We provide an efficient algorithm for merging tiles in Appendix A.
2.2 Formulating hypotheses
Our goal is to compare two distributions and we constrain the distributions in question by forming hypotheses. Tilings are used to form the hypotheses. The so-called hypothesis tilings provide a flexible method for the user to specify the relations in which he or she is interested. [Hypothesis tilings] Given a subset of rows , a subset of columns , and a -partition of the columns given by , such that and if , a pair of hypothesis tilings is given by and , respectively. The hypothesis tilings define the items and attributes of interest and the relations between the attributes that the user is interested in (through the partition of ). Hypothesis 1 () corresponds to a hypothesis where all relations in are preserved, and hypothesis 2 () to a hypothesis where there are no unknown relations between attributes in the partitions of .
For example, if the columns are partitioned into two groups and the user is interested in relations between the attributes in and , but not in relations within or . On the other hand, if the partition is full, i.e., and for all , then the user is interested in all relations between the attributes. In the latter case, the special case of and indeed reduces to unguided data exploration, where the user has no background knowledge and the hypothesis covers all inter-attribute relations in the data.
The user’s knowledge concerning relations in the data is described by tiles as well. As the user views the data she or he can highlight relations observed by tiles. For example, the user can mark an observed cluster structure with a tile involving the data points in the cluster and the relevant attributes. We denote the set of user-defined tiles by . In our general framework, the user compares two distributions characterised by the tilings and , respectively. Here ‘’ is used with a slight abuse of notation to denote the operation of merging tilings into an equivalent tiling. By we denote the pair of hypotheses
Note that specifies two distributions over datasets, both parametrised by their respective tilings, from which we can draw samples as described in Sec. 2.1.
2.3 Finding views
We are now ready to formulate our second main problem, i.e., given two distributions characterised by the hypothesis pair , how can we find an informative view of the data maximally contrasting these two distributions. The answer to this question depends on the type of data and the visualisation selected. For example, the visualisations or measures of difference are different for categorical and real-valued data. The real-valued data discussed in this paper allows us to use projections (such as principal components) that mix attributes.
Problem 2.2 (Comparing hypotheses)
Given two distributions characterised by the pair , where is a (user-defined) background model tiling, and and are hypothesis tilings, find the projection in which the distributions differ the most.
To formalise the optimisation criterion in Prob. 2.2, we define a gain function by
where and are the covariance matrices of the distributions parametrised by the tilings and , respectively, and is the projection direction. The covariance matrices and can be found analytically by the following theorem. Given , the covariance of attributes under the distribution defined by the tiling is given by , where
and . We denote by the set of rows permuted together, by the centered data matrix, and by a set satisfying , i.e., the rows in a tile that data point belongs to. The covariance is defined by
where the expectation is defined over the permutations and of columns and allowed by the tiling, respectively. The part of the sum for rows permuted together reads
where we have used and reordered the sum for . The remainder of the sum reads
where and the expectations have been taken independently, because the
rows in are permuted independently at random. The result then follows from
the observation that for any .333 We have also verified
experimentally that the analytically
derived covariance matrix matches the covariance matrix estimated from a
sample from the distribution.
We have also verified experimentally that the analytically derived covariance matrix matches the covariance matrix estimated from a sample from the distribution.
Now, the projection in which the distributions differ most is given by
The vector gives the direction in which the two distributions differ the most in terms of the variance. Here we could in principle use some other difference measure as well. We chose the form of Eq. (3) because it is intuitive and it can be implemented efficiently, as described in the following theorem. The solution to the optimisation problem of Eq. (3) is given by , where is the first principal component of and is a whitening matrix  such that . Using we can rewrite the gain of Eq. (2) as
Eq. (4) is maximised when is the maximal variance direction of , from which it follows that the solution to the optimisation problem of Eq. (3) is given by , where is the first principal component of . In visualisations (when making two-dimensional scatterplots), we project the data to the first two principal components, instead of considering only the first component.
We note that at the limit of no background knowledge and with the most general hypotheses, our method reduces to the PCA of the correlation matrix, as shown by the following theorem. In the special case of the first step in unguided data exploration, i.e., comparing a pair of hypotheses specified by , where and , the solution to Eq. (3) is given by the first principal component of the correlation matrix of the data when the data has been scaled to unit variance. The proof follows from the observations that for the covariance matrix is a diagonal matrix (here a unit matrix), resulting in the whitening matrix . For this pair of hypotheses, denotes the covariance matrix of the original data. The result then follows from Thm. 2.3.
2.4 Selecting attributes for a tile constraint
Once we have defined the most informative projection, which displays the most prominent differences between the distributions parametrised by the pair of hypotheses, we can view the data in this projection. This allows the user to observe different patterns, e.g., a clustered set of points, a linear relationship or a set of outlier points.
After observing a pattern, the user defines a tile to be added to . The set of data points
involved in the pattern can be easily selected from the projection shown. For selecting the attributes that characterise the pattern, we can use a procedure where for each attribute the ratio between the standard deviation of the attribute for the selection and the standard deviation of all data points is computed. If this ratio is below a threshold value(e.g., ), then the attribute is included in the set of attributes characterising the pattern. The intuition here is that we are looking for attributes in which the selection of points are more similar to each other than is expected based on the whole data.
In this section we first consider the stability and scalability of the method presented in this paper. After this, we present two brief examples of how the method is used to (i) explore relations in a dataset and (ii) focus on investigating a hypothesis concerning relations in a subset of the data.
Dataset In the experiments, we utilise the german socio-economic dataset [1, 11]444 http://users.ugent.be/~bkang/software/sica/sica.zip. The dataset contains records from 412 administrative districts in Germany. The full dataset has 46 attributes describing socio-economic, political and geographic aspects of the districts, but we only use 32 variables (see the Sections B and C in the Appendix for details) in the experiments. We scale the real-valued variables to zero mean and unit variance. All of the experiments were performed with a single-threaded R 3.5.0  implementation on a MacBook Pro laptop with a 2.5 GHz Intel Core i7 processor.
3.1 Stability and scalability
We first study the sensitivity of the results with respect to noise or missing data rows. We begin the experiment by separating 32 real-valued variables and 3 (non-trivial) factors from the full german data. A synthetic dataset, parametrised by the noise term and an integer is constructed as follows. First, we randomly remove rows, after which we to the remaining variables add Gaussian noise with variance , and finally rescale all variables to zero mean and unit variance. We create a random tile by randomly picking a factor that defines the rows in a tile and randomly pick 2–32 columns. The background distribution consists of three such random tiles and the hypothesis tiles are constructed of one such random tile as and .
The results are shown in Tab. 1. We notice that the method is relatively insensitive with respect to the gain to noise and removal of rows. Even removing about half of the rows does not change the results meaningfully. Only very large noise, corresponding to (i.e., c. 10% signal to noise ratio) degrades the results substantially.
Tab. 2 shows the running time of the algorithm as a function of the size of the data for Gaussian random data with a similar tiling setup as used for the german data. We make two observations. First, the tile operations scale linearly with the size of the data and they are relatively fast. Most of the time is spent on finding the views, i.e., solving Eq. (3). Even our unoptimised pure R implementation runs in seconds for datasets that are visualisable (having thousands of rows and hundreds of attributes); any larger dataset should in any case be downsampled for visualisation purposes.
3.2 Human-guided data exploration of the german dataset
Finally, we demonstrate our human-guided data exploration framework by exploring the german dataset under different hypotheses. Sections B and C in the Appendix contain larger figures with more details (samples corresponding to both hypotheses and axes labelled with components of the projection vectors) and more thorough explanations of the exploration process described below.
We start with unguided data exploration where we have no prior knowledge about the data and our interest is as generic as possible. In this case and as the hypothesis tilings we use , where all rows and columns belong to the same tile (a fully-constrained tiling), and , where all columns form a tile of their own (fully unconstrained tiling). Our hypothesis pair is then .
Now, looking at the view where the distributions characterised by the pair differ the most, shown in Fig. 2 (left), we observe cluster patterns. Selecting a set of data points allows us to investigate what kind of items and attributes the selected points represent. E.g., Cluster 1 (shown in orange in Fig. 2 (left)) corresponds to rural districts in Eastern Germany characterised by a high degree of voting for the Left party. We now add a tile constraint for the items in the observed pattern where the columns (attributes) are chosen as described in Sec. 2.4, using a threshold value . The hypothesis pair is then updated to . The most informative view displaying differences of the distributions parametrised by is now shown in Fig. 2 (right) and we observe that Cluster 2 (the selection shown in orange) has become prominent. By inspecting the class attributes of this selection we learn that these items correspond to urban districts.
Next, we focus on a more specific hypothesis involving only a subset of rows and attributes. As the subset of rows we choose rural districts. As attributes of interest, we consider a partition , where contains voting results for the political parties in 2009, contains demographic attributes, contains workforce attributes, and contains education, employment and income attributes. We here want to investigate relations between different attribute groups, ignoring the relations inside the groups.
We form the hypothesis pair , where consists of a tile spanning all rows in and all columns in whereas consists of four tiles: , . Looking at the view where the distributions parametrised by the pair differ the most, shown in Fig. 3 (left), we find two clear clusters corresponding to a division of the districts into those located in the East, and those located elsewhere. We could also have used our already observed background knowledge of Cluster 1, by considering the hypothesis pair . For this hypothesis pair, the most informative view is shown in Fig. 3 (right), which clearly is different to Fig. 3 (left), demonstrating that the background knowledge is important.
To understand the utility of the views shown, we compute values of the gain function as follows. We consider our four hypothesis pairs , , , and . For each of these pairs, we denote the direction in which the two distributions differ most in terms of the variance (solutions to Eq. (3)) by , , , and , respectively. We then compute the gain for each and . For comparison, we also compute the first PCA and ICA projection vectors, denoted by and , respectively, and calculate the gain in different hypothesis pairs using these. The results are presented in Tab. 3. We notice that the gain is indeed always the highest when the projection vector matches the hypothesis pair (highlighted in the table), as expected. This shows that the views presented are indeed the most informative ones given the current background knowledge and the hypotheses being investigated. We also notice that the gain for PCA is equal to that of unguided data exploration, as expected by Thm. 2.3. When some background knowledge is used or if we investigate a particular hypothesis, the views achievable using PCA or ICA are less informative than using our framework. The gains close to zero for ICA are directions where the variance of the more constrained distribution is small due to, e.g., linear dependencies in the data.
4 Related work
Iterative data mining  is a paradigm where patterns already discovered by the user are taken into account as constraints during subsequent exploration. This concept of iterative pattern discovery is also central to the data mining framework presented in [4, 5, 6]
, where the user’s current knowledge (or beliefs) of the data is modelled as a probability distribution over datasets, and this distribution is then updated iteratively during the exploration phase as the user discovers new patterns. Our work has been motivated by[18, 16, 12, 17], where these concepts have been successfully applied in visual exploratory data analysis where the user is visually shown a view of the data which is maximally informative given the user’s current knowledge. Visual interactive exploration has also been applied in different contexts, e.g., in item-set mining and subgroup discovery [1, 8, 22, 15], information retrieval , and network analysis .
Solving the problem of determining which views of the data that are maximally informative to the user, and hence interesting, have been approached in terms of, e.g., different projections and measures of interestingness [7, 11, 23]. Constraints have also been used to assess the significance of data mining results, e.g., in pattern mining  or in investigating spatio-temporal relations .
The present work fundamentally differs from the above discussed previous work concerning iterative data mining and applications to visual exploratory data analysis in the following way. In previous work, the user is presented with informative views (visual or not) of the data, but the user cannot beforehand know which aspects of the data these views will show, since by definition the views are such that they contrast maximally with the user’s current knowledge. The implication is that the user cannot steer the exploration process. In the present work we solve this navigational problem by incorporating both the user’s knowledge of the data, and different hypotheses concerning the data into the background distribution.
In this paper we proposed a method to integrate both the user’s background model learned from the data and the user’s current interests in the explorative data analysis process. We provided an efficient implementation of this method using constrained randomisation. Furthermore, we extended PCA to work seamlessly with the framework in the case of real-valued datasets.
The power of human-guided data exploration stems from the fact that typical datasets contain a huge number of interesting patterns. However, the patterns that are interesting to a user depend on the task at hand. A non-interactive data mining method is therefore restricted to either show generic features of the data—which may already be obvious to an expert—or then output unusably many patterns (a typical problem, e.g., in frequent pattern mining: there are easily too many patterns for the user to absorb). Our framework is a solution to this problem: by integrating the human background knowledge and focus—formulated as a mathematically defined hypothesis—we can at the same time guide the search towards topics interesting to the user at any particular moment while taking the user’s prior knowledge into account in an understandable and efficient way.
This work could be extended, e.g., to understand classifier or regression functions in addition to static data and to different data types, such as time series. An interesting problem would also be to find an efficient algorithm that could find a sparse solution to the optimisation problem of Eq. (3). To our knowledge, no such solution is readily available as the solutions for sparse PCA are not directly applicable here; sparse PCA would give a sparse variant of the vector in Thm. 2.3, which would however not result in a sparse . An obvious next step would be to implement these ideas in interactive data analysis tools.
-  M. Boley, M. Mampaey, B. Kang, P. Tokmakov, and S. Wrobel. One click mining—interactive local pattern discovery through implicit preference and performance learning. In KDD-IDEA, pages 27–35, 2013.
D. Chau, A. Kittur, J. Hong, and C. Faloutsos.
Apolo: making sense of large network data by combining rich user interaction and machine learning.In CHI, pages 167–176, 2011.
-  F. Chirigati, H. Doraiswamy, T. Damoulas, and J. Freire. Data polygamy: the many-many relationships among urban spatio-temporal data sets. In SIGMOD/PODS, pages 1011–1025, 2016.
-  T. De Bie. An information theoretic framework for data mining. In KDD, pages 564–572, 2011.
-  T. De Bie. Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min. Knowl. Discov., 23(3):407–446, 2011.
-  T. De Bie. Subjective interestingness in exploratory data mining. In IDA, pages 19–31, 2013.
-  T. De Bie, J. Lijffijt, R. Santos-Rodriguez, and B. Kang. Informative data projections: a framework and two examples. In ESANN, pages 635 – 640, 2016.
-  V. Dzyuba and M. van Leeuwen. Interactive discovery of interesting subgroup sets. In IDA, pages 150–161, 2013.
-  S. Hanhijärvi, M. Ojala, N. Vuokko, K. Puolamäki, N. Tatti, and H. Mannila. Tell me something I don’t know: randomization strategies for iterative data mining. In KDD, pages 379–388, 2009.
-  J. Kalofolias, E. Galbrun, and P. Miettinen. From sets of good redescriptions to good sets of redescriptions. In ICDM, pages 211–220, 2016.
-  B. Kang, J. Lijffijt, R. Santos-Rodríguez, and T. De Bie. Subjectively interesting component analysis: Data projections that contrast with prior expectations. In KDD, pages 1615–1624, 2016.
-  B. Kang, K. Puolamäki, J. Lijffijt, and T. De Bie. A tool for subjective and interactive visual data exploration. In ECML-PKDD, pages 3–7, 2016.
-  A. Kessy, A. Lewin, and K. Strimmer. Optimal whitening and decorrelation. Am. Stat., 2018. Published online 26 Jan 2018.
-  J. Lijffijt, P. Papapetrou, and K. Puolamäki. A statistical significance testing approach to mining the most informative set of patterns. DMKD, 28(1):238–263, 2014.
-  D. Paurat, R. Garnett, and T. Gärtner. Interactive exploration of larger pattern collections: A case study on a cocktail dataset. In KDD-IDEA, pages 98–106, 2014.
-  K. Puolamäki, B. Kang, J. Lijffijt, and T. De Bie. Interactive visual data exploration with subjective feedback. In ECML-PKDD, pages 214–229, 2016.
-  K. Puolamäki, E. Oikarinen, B. Kang, J. Lijffijt, and T. D. Bie. Interactive visual data exploration with subjective feedback: An information-theoretic approach. In ICDE, pages 1208–1211, 2018.
-  K. Puolamäki, P. Papapetrou, and J. Lijffijt. Visually controllable data mining methods. In ICDMW, pages 409–417, 2010.
-  R Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2018.
-  T. Ruotsalo, G. Jacucci, P. Myllymäki, , and S. Kaski. Interactive intent modeling: Information discovery beyond search. CACM, 58(1):86–92, 2015.
-  J. W. Tukey. Exploratory data analysis. Addison-Wesley, 1977.
-  M. van Leeuwen and L. Cardinaels. Viper—visual pattern explorer. In ECML-PKDD, pages 333–336, 2015.
-  M. Vartak, S. Rahman, S. Madden, A. Parameswaran, and N. Polyzotis. SeeDB: efficient data-driven visualization recommendations to support visual analytics. In PVLDB, volume 8(3), pages 2182–2193, 2015.
Appendix A Algorithm for merging tiles
Merging a new tile into a tiling where all tiles are non-overlapping can be done efficiently using Alg. LABEL:alg:merge. We assume that the starting point always is a non-overlapping set of tiles and hence we only need to consider the overlap that the new tile has with the tiles already existing in the tiling. This is similar to the merging of statements considered in .
The algorithm for merging tiles has two steps. Let be the existing tiling (with non-overlapping tiles) and let be the new tile to be added to the tiling, where is the set of rows and is the set of columns spanned by the tile . In the first step (lines 1–11) we identify those tiles in the tiling with which overlaps. In the second step we resolve (merge) the overlap between and the tiles identified in . The algorithm proceeds as follows.
An empty hash map is initialised (line 1) in order to be used to detect overlap between columns of existing tiles in and the new tile . We proceed to iterate over each row in the new tile (lines 2–11).
The matrix is of the same size as the data matrix and contains information on which tiles that cover a particular part of the data matrix. Each element in hence holds information concerning which tile that occupies a particular region. Since the tiling described by is non-overlapping, it means that each element in corresponds to the ID of the tile that covers that position. Given a row and a set of columns (line 3) we then get the IDs of the tiles on row with which overlaps and we store this in . The hash map is used to detect if this row has been seen before, i.e., if is a key in (line 4). If this is the first time this row is seen, is used as the key for a new element in the hash map and is initialised to be a tuple (line 5). Elements in this tuple are referred to by name, e.g., gives the set of rows associated with the key , while gives the set of tile IDs.
On lines 6 and 7 we store the current row index and the unique tile IDs in the tuple. If the row was seen before, the row set associated with these tile IDs is updated (line 9). After this first step, the hash map contains tuples of the form (rows, id) where id specifies the IDs of the tiles with which overlaps at the rows specified by rows.
We then proceed to the second step in the algorithm (lines 12–16) where the identified overlap is resolved. We first determine the currently largest tile ID in use (line 12). After this we iterate over the tuples in the hash map . For each tuple we must update the tiles having IDs and on line 14 we hence find the columns associated with these tiles. After this, the IDs of the affected overlapping tiles are updated (line 15), and the tile ID counter is incremented. Finally, the updated tiling is returned on line 17. The time complexity of the tile merging algorithm is .
Appendix B Exploration of the German data without background knowledge
In the experiments we consider the german socio-economic dataset [1, 11]. The dataset contains records from 412 administrative districts in Germany. Each district is represented by 46 attributes describing socio-economic and political aspects in addition to attributes such as the type of the district (rural/urban), area name/code, state, region and the geographic coordinates of each district center. The socio-ecologic attributes include, e.g., population density, age and education structure, economic indicators (e.g., GDP growth, unemployment, income), and the proportion of the workforce in different sectors. The political attributes include election results of the five major political parties (CDU/CSU, SPD, FDP, Green, and Left) in the German federal elections in 2005 and 2009, as well as the voter turnout. For our experiments we remove the election results from 2005, all non-numeric variables, and the area code and coordinates of the districts, resulting in 32 real-valued attributes (although we use the full dataset when interpreting the results). We scale the real-valued variables to zero mean and unit variance.
We first consider the case where the data miner has no prior knowledge concerning the relations in the data, i.e., we have no initial background knowledge. We hence set and as the hypothesis tilings we use , where all rows and columns belong to the same tile (a fully-constrained tiling), and , where all columns form their own tile (fully unconstrained tiling). Our hypothesis pair is then .
We then consider the first view of the data (Figure 4), which is maximally informative in terms of the two distributions parametrised by the hypotheses differing the most. In our figures we use black circles () to denote the real data points. We mark selected clusters with orange. Green squares () denote points belonging to the data sample from the distribution parametrised by and blue triangles () denote points belonging to the data sample from the distribution parametrised by . Note that in this particular case the actual data and the sample corresponding to are identical (although the rows might be in different order), since this is a fully constrained tiling. The and axis labels show the five attributes with the largest absolute values of each projection vector.
We observe that there are cluster patterns visible in the data and that the two distributions differ (the green and blue points are distributed differently). In order to investigate the characteristics of the data points, corresponding to different patterns in the german data, we select a set of points that form a cluster. Here we first choose to focus on the set of points in the upper right corner, marked with orange in Figure 4.
We now want to learn about the cluster we have identified. We consider the Type and Region attributes for the subset of data points (the marked cluster in the view) in the original data. These two categorical attributes tell whether a district in a cluster is urban or rural (Type) and where in Germany it is located (Region); in the Northern, Southern, Western, or Eastern region. For Cluster 1, we obtain the information shown in Table 3(a).
We also consider a parallel coordinates plot of the data, shown in Figure 5(a). This plot shows all 32 attributes in the data. The currently selected points (Cluster 1) are shown with red while the rest of the data is shown in black. The number in parentheses following each variable name is the ratio of the standard deviation of the selection and the standard deviation of all data. If this number is small we can conclude that the values for a particular attribute are homogeneous inside the selection (behave similarly).
Cluster 1 hence corresponds to Urban areas in the East. Based on the parallel coordinates plot in Figure 5(a), one clear political feature which we can observe is that there is little support for the Green party and a high support for the Left party in these districts.
We continue our exploration by adding a tile constraint for Cluster 1. The set of rows for the tile is determined by our selection (marked in Figure 4
). To determine the set of columns for the tile constraint we use the following heuristic: using the parallel coordinates plot (Figure5(a)) we choose as columns for the tile those attributes for which the standard deviation ratio (the number in parentheses) is less than .
We then update our hypotheses to take into account the newly added tile, i.e., consider the hypothesis pair . The most informative view is shown in Figure 4(a), We have here for illustration purposes marked Cluster 1 with orange. As can be seen, this cluster is no longer as clearly visible as in our first view in Figure 4. This is expected, since this pattern has been accounted for in the background distribution and the relations in this cluster no longer differ between the data samples corresponding to the distributions characterised by the hypothesis pair we are currently investigating. Instead we observe Cluster 2, marked in Figure 4(b). In a similar fashion as we did for Cluster 1, we consider the Region and Type attributes for Cluster 2 (Table 3(b)) and conclude that we have found urban districts spread out over all regions. Based on the parallel coordinates plot shown in Figure 5(b) we can conclude that these districts are characterised by a low fraction of agricultural workforce and a high amount of service workforce, both as expected in urban districts. We also notice that these districts have had a high GDP growth in 2009 and that it appears that the amount of votes for the CDU party in these districts was quite low.
|LEFT.2009, CDU.2009, SPD.2009,|
|Elderly.pop., Old.Pop., Mid.aged.Pop.,|
|Unemploy., Unempl..Youth, Income|
Appendix C Exploration of the german data with specific hypotheses
Case 1: No background knowledge
In this section we consider investigating hypotheses involving a subset of data items (rows in the data matrix, corresponding to different districts) and attributes.
We want to investigate a hypothesis concerning the relations between certain attribute groups in rural areas. We hence define our hypotheses as follows. As the subset of rows we choose all districts that are of the rural type. We then partition a subset of the attributes into four groups. The first attribute group () consists of the voting results for the political parties in 2009. The second attribute group () describes demographic properties such as the fraction of elderly people, old people, middle aged people, young people, and children in the population. The third group () contains attributes describing the workforce in terms of the fraction of the different professions such as agriculture, production, or service. The fourth group () contains attributes describing the education level, unemployment, and income. The attribute groupings are listed in Table 5.
We then form a hypothesis pair , where consists of a tile spanning all rows in and the columns whereas consists of tiles , . These focus tiles allow us to investigate whether there are relations between these attribute groups, while ignoring relations inside the attribute groups.
The view where the distributions characterised by the pair differ the most is shown in Figure 6(a). Again, we use green squares () to denote items belonging to the data sample corresponding to and blue triangles () to denote items belonging to the data sample corresponding to . The points outside the focus area are shown using a plus-sign (). We notice a clear division into two clusters, one on the left (marked in Figure 6(a)) and one on the right (marked in Figure 6(b)). We now investigate these two clusters in a similar fashion as we did before when exploring the relations in the data. Based on the Region and Type attributes for the clusters shown in Table 6, we conclude that Cluster 3 represents rural districts in the North, South and West, whereas Cluster 4 represents rural districts in the East. Based on the parallel coordinates plots in Figure 6(c) and Figure 6(d) it is clear that the voting behaviour is one aspect separating Cluster 3 and Cluster 4. In Cluster 4, the support for the Left party is prominent. Also, the fraction of old people in the population in Cluster 4 is larger, whereas the fraction of children in the population is high in Cluster 3. We conclude that there are interesting relations between the attribute groups considered, which means, e.g., that there is a connection between demographic properties and voting behaviour in the different rural districts.
Case 2: Using background knowledge
We could also have used our already observed background knowledge. Let be a tile corresponding to Cluster 1 in Table 3(a). We hence consider the hypothesis pair . Using these hypotheses we get the view shown in Figure 8. This view is clearly different than Figure 6(a), since we already were aware of the relations concerning the rural districts in the East and this was included in our background knowledge. We hence conclude that the background knowledge matters when comparing hypotheses.