<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Factorial Clustering with an Application to Plant Distribution Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Manfred Jaeger</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simon P. Lyager</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael W. Vandborg</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thomas Wohlgemuth</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dept. of Computer Science, Aalborg University</institution>
          ,
          <country country="DK">Denmark</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Swiss Federal Research Institute WSL</institution>
        </aff>
      </contrib-group>
      <fpage>31</fpage>
      <lpage>42</lpage>
      <abstract>
        <p>We propose a latent variable approach for multiple clustering of categorical data. We use logistic regression models for the conditional distribution of observable features given the latent cluster variables. This model supports an interpretation of the different clusterings as representing distinct, independent factors that determine the distribution of the observed features. We apply the model for the analysis of plant distribution data, where multiple clusterings are of interest to determine the major underlying factors that determine the vegetation in a geographical region.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>There exist a variety of different approaches to learning multiple clusterings.
They can differ not only with regard to their mathematical models and
algorithmic methods, but there can also be widely different intuitions and objectives
with regard to the interpretation of the multiple clusterings. On the one hand, in
ensemble clustering, the individual clusterings are essentially regarded as
different, imperfect versions of a single underlying true clustering (e.g. [10]). In many
multiple clustering methods, on the other hand, the different clusterings are
intended to represent different views of the data, each providing a different insight
into the structure of the data. One objective for clustering methods then is to
ensure that different clusterings are in some sense independent, disparate [6], or
non-redundant [8].</p>
      <p>Probabilistic latent variable models are used for a variety of data analysis
tasks (in the case of discrete data jointly referred to as latent class analysis ),
including clustering. Several authors have investigated probabilistic latent variable
models for multiple clusterings [13, 4, 2]. For the case of discrete observable
features, no special assumptions on the distributional form of the features given the
latent variables are made in these approaches, i.e. the conditional distribution of
the features follows an unconstrained multinomial distribution. Latent variable
models are also commonly used for dimensionality reduction of high-dimensional
numeric data. An important example is the factor analysis model, in which the
observed data is interpreted as a noisy linear transformation of a small number
of latent dimensions. While it is quite common to refer to latent class analysis
as a “categorical data analogue to factor analysis” [5][1, Chapter 13], it seems
that this correspondence has not been fully exploited for clustering applications,
or put into the context of multi-clustering, via the combined use of multiple
latent variables, and special assumptions on the conditional distribution of the
observed features.</p>
      <p>In this paper we propose a probabilistic latent variable model for multiple
clusterings. As in factor analysis, we interpret the observed (discrete) data as a
noisy transformation of underlying, discrete latent dimensions. The linear
mapping of factor analysis is replaced by a log-linear logistic regression model. The
latent dimensions then define clustering s that can be seen as independent factors
that determine the distribution of the observed features.</p>
      <p>In contrast with several other multiple clustering methods (e.g., [4, 8]) our
method is not based on an association of different clusterings with different
feature subsets, even though such associations can emerge.</p>
      <p>Our approach is partly motivated by applications to biogeographical data.
Specifically, we are investigating plant distribution data. Segmentations of
geographic units into oflristic regions based on similarity of plant species
composition were already undertaken in the 19th century. An early application of formal
methods of clustering in this context is [9]. We apply our method to distribution
data for 2398 plant species in Switzerland. The goal of factorial clustering for
this type of data will be to obtain multiple clusterings, each of which could
correspond to one of several underlying environmental, geographical, or historical
factors, which jointly inuflence the vegetation.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Latent Variable Models for Clustering</title>
      <p>Latent variable models are routinely used for clustering, both for single and
multiple clustering. However, they can be used in several, slightly different ways.
In order to more clearly explain our approach, we briefly review in this section
possible approaches to using latent variable models for clusterings.</p>
      <p>Throughout, we assume that the observable data X consists of n observations
of k attributes, i.e. X is an n × k matrix. A latent variable model contains m
additional unobserved variables, and we denote with L the n × m matrix of
the latent variables in the n observations. We note that when we assume that
in the n observations both the observable and latent variables are identically
and independently sampled, it will be simpler and more natural to describe
the model in terms of vectors X, L of length n and m, respectively. However,
in some applications, especially segmentation of time sequences or images, the
latent variables are not independent at different data points.</p>
      <p>A latent variable model, then, consists of a joint distribution for X and L,
which can be written as</p>
      <p>
        P (X | L, θX|L)P (L | θL).
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
In hierarchical models, this might be extended by a distribution over θX|L, θL
parametrized by hyperparameters λ .
      </p>
      <p>
        The perhaps most common use of model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) for clustering is to perform
two steps [13]: rfist, tfi the parameters θX|L, θL by maximizing the marginal
likelihood of the observed data X = x:
(θX∗|L, θL∗) := arg max
θX|L,θL l
      </p>
      <p>
        P (X = x | L = l, θX|L)P (L = l | θL).
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
This step is usually performed using the EM algorithm. Then, compute the most
probable values of L given X = x:
l∗ = arg max P (L = l | X = x, θX∗|L, θL∗)
      </p>
      <p>l</p>
      <p>In multiple clustering, a joint congfiuration of the latent variables denfies
multiple cluster indices. For simplicity we may assume for now that each latent
variable defines its own clustering, and that therefore the membership of the ith
data item in the jth clustering is given by li∗,j. However, in the multi-cluster case,
the second step can also take a slightly different form, and the most probable
latent variable values be computed component-wise. Denoting by lj the jth
column of l (i.e., l = (l1, . . .l m,)), this can be written as
lj∗ = arg max
lj
l1,...l,j−1,lj+1,lm</p>
      <p>P (L = l | X = x, θX∗|L, θL∗).</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
This is the (hard) clustering rule used, e.g., in [13, 14]. The clusterings obtained
from (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) can differ.
      </p>
      <p>
        If the ultimate goal is only to compute a most probable congfiuration of L,
then one may also try to simplify the combination of (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) and (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) into a single
optimization:
l∗ := arg max max P (X = x | L = l, θX|L)P (L = l | θL).
      </p>
      <p>
        l θX|L,θL
This rule can be justiefid by a Bayesian interpretation, for example: it amounts to
finding the jointly most probably values of l, θX|L, θL, given the data X = x, and
assuming a uniform prior for θX|L, θL. Rule (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) may be still further simpliefid,
if one assumes the model for the latent variables to be fixed, and not subject to
optimization, i.e., P (L = l | θL) = P (L = l | θL∗) for fixed parameters θL∗, and
the parameter optimization is only for θX|L. If, furthermore, P (L = l | θL∗) is
assumed uniform, then (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) reduces to
l∗ := arg max max P (X = x | L = l, θX|L).
      </p>
      <p>
        l θX|L
Whether it is justified to assume a xfied distribution P (L | θL∗) can depend on
two considerations: first, assuming that (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) actually represents the generative
process for the data, one might have sufficient background knowledge to identify
the distribution of L a-priori. L being an unobserved variable, whose existence
is essentially hypothesized, and for which it is typically even unclear how many
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
states it has, this is a rather unlikely case in practice, however. Second, clustering
being an exploratory data-analysis tool, one may also consider what settings of
P (L | θ∗ ) may lead via (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) to interesting insights into the data, regardless of
      </p>
      <p>L
whether the underlying probabilistic model is accurate as a generative model.</p>
      <p>
        For example, in the single clustering case, when the data is generated by a
mixture model where one mixture component has a much higher prior
probability than the others, then clustering via (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) can easily lead to only obtaining
a single cluster. If, on the other hand, one eliminates the influence of the prior
distribution by assuming (incorrectly) a uniform distribution over the mixture
components, then clustering via (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) can reveal the mixture structure of the data.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>The Factorial Logistic Model</title>
      <p>
        In the factor analysis model, both X and L are numerical, the rows in X and
L are iid, and the model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is given by distribution
      </p>
      <p>P (Li) ∼ N (0,Σ L)</p>
      <p>P (Xi | Li) ∼ N (W Li + μ,Σ X )
where Σ L is an arbitrary covariance matrix, W is a k × m matrix, μ a
mdimensional mean vector, and Σ X a diagonal covariance matrix. Thus, data
is assumed to be generated by sampling from a lower (k) dimensional
Gaussian distribution, linearly mapped into the higher (m) dimensional space, and
independent Gaussian noise added to each coordinate.</p>
      <p>
        The logistic regression model for the distribution of a binary variable X
conditional on numeric latent variables L is given by
log P (X = 1 | L)/P (X = 0 | L) = w0 + wL,
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
where w = (w1, . . . ,kw)is a k-vector of real weights. We write X ∼ LR(w0,wL)
if X follows (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ). This model also applies when the latent variables L are ordinal,
i.e. each Lj codes by an integer {0, . . . j, −r 1} one of rj different, ordered
categories. To accommodate nominal predictor variables (i.e., unordered categorical
variables) in the logistic regression model, one encodes a nominal variable Lj
with r states by binary indicator variables Lj,1, . . . ,j,Lr, i.e. Lj,h = 1, Lj,h = 0
(h = h) means that Lj is in its hth state.
      </p>
      <p>
        We will consider both ordinal and nominal latent variables for clustering.
An ordinal latent variable defines an ordered clustering, i.e. the cluster indices
define an ordering of the clusters. Whether such an ordering is meaningful and
interpretable is application dependent. For biogeographical data ordinal latent
variables and ordered clusterings are often natural, since data patterns are often
determined by underlying continuous variables. We will, thus, assume that L is
a vector of m latent variables that define c different clusterings. Furthermore, we
assume that one of the following two cases applies: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) all Lj in L are ordinal;
in this case c = m, and the jth clustering consists of rj distinct cluster. (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
L is an encoding by binary indicator variables of c distinct nominal variables
with r1, . . . c, rdistinct states, respectively. In this case m = ic=1 ri. We refer
to model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) as the (r1o, . . . k,or) model, and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) as the (r1n, . . . c,nr) model.
One could also consider models combining ordinal and nominal latent variables,
but we will here focus on “pure” models.
      </p>
      <p>
        As in the factor analysis model, we assume that P (X | L) ∼ in=1 P (X i |
Li) ∼ in=1 jk=1 P (X i,j | Li). Assuming that each Xi,j follows a logistic
regression model (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) with parameters wj,0,wj , one obtains the model for the ith
data item:
      </p>
      <p>P (Xi | Li) ∼
k
j=1</p>
      <p>LR(wj,0,wj Li).</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
      </p>
      <p>
        This conditional model for X may be combined with various models for
P (L), with or without an iid assumption for the rows of L. We refer to multiple
clustering based on (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) as factorial logistic (FL) clustering.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Learning</title>
      <p>
        We apply the simple learning rule (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) for clustering with the logistic regression
model. Thus, we assume that L is uniformly distributed, which implies, in
particular, independence over rows: P (L) ∼ i P (Li). In case of L encoding nominal
variables, the uniform distribution, of course, is conditional on “legal” states of
L, i.e. at most one indicator variable for any particular nominal variable being
equal to 1.
      </p>
      <p>
        For the optimization of (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) we then use the obvious iterative procedure, where
after a random initialization L := l0 two steps are alternated:
i θX|Lt := arg maxθX|L P (X = x | L = lt, θX|L)
ii lt+1 := arg maxl P (X = x | L = l, θX|Lt)
      </p>
      <p>
        Step i is performed in our implementation using the SPSS method of fitting
logistic regression models, which supports both ordinal and nominal predictor
variables. Due to the factorization (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ), the optimization reduces to k independent
optimizations for the parameters (wj,0,wj ) (j = 1, . . . ,).kIt is thus linear in k.
It also is linear in n, since the likelihood only depends on the counts | {i | Xi,j =
1,Li = ˆl} | for xfied congfiurations ˆl of the latent variables.
      </p>
      <p>For step ii we have P (X = x | L = l, θX|Lt) = i P (Xi = xi | Li =
li, θX|Lt), so that the problem decomposes into n distinct optimizations for the
li. It can be naively performed by computing P (Xi = xi | Li = li, θX|Lt) for
each candidate li, which gives a procedure that is still linear in n and k, but
exponential in c.</p>
      <p>Overall, we obtain a learning method that is linear in the number of data
items and the observable attributes, and exponential in the number of
clusterings.
We apply FL-clustering to geobotanical data. In our experiments we use the
source data for the “Swiss Web Flora” 3 [11]. The dataset contains information
on the distribution of 2697 plant species in Switzerland, which has been divided
into 565 mapping areas. We reduced slightly more detailed species abundance
information in the original data to simple binary presence/absence data. We
also in this process deleted plants with a very sparse and uncertain distribution.
This left us with 2398 species in our data.4 We view each plant species as an
observable attribute, and the mapping areas as independent observations. Thus,
n = 565 and k = 2398 in the notation of Section 2. Figure 1 shows the division
of Switzerland into the mapping areas. Apart from the species occurrence data,
only a single additional variable is recorded for each area: a binary variable that
indicates whether the area is a mountain area (above timberline), or a valley
area (below timberline). The value of this variable is shown if Figure 1 by a
green color for valley, and grey color for mountain areas.</p>
      <p>Conventional (single-) clusterings of the data lead to a segmentation of
Switzerland into floristic regions. Figure 1 (b) shows a result obtained by
agglomerative hierarchical clustering of the valley areas only [12] (thus, the white
part of the gfiure does not correspond to a computed cluster; it comprises areas
not included in the clustering).
In order to obtain an initial evaluation of the feasibility of our approach, we rfist
conduct an experiment with synthetic data. For this we constructed two artificial
segmentations of Switzerland based on the same mapping regions as in the real
3 www.wsl.ch/land/products/webflora/welcome-en.ehtml
4 The data is available at http://www.wsl.ch/info/mitarbeitende/wohlgemu/lehre EN/
data. These segmentations are shown in Figure 2 (top), and henceforth referred
to as “vertical” and “horizontal” segmentation, respectively. For each
combination of a vertical and a horizontal segment, we defined a species distribution type
by a nominal logistic regression model that expresses a preference of the species
for the selected vertical and horizontal segment. The logistic regression weights
were adjusted so as to obtain conditional probability distributions for the
presence of a species of the following form (here showing the case of preference for
the rfist segment in both segmentations):</p>
      <p>According to each distribution type we created 15 synthetic plant species,
and randomly sampled an occurrence variable for the species at each of the
mapping areas.</p>
      <p>We then performed FL clustering based on the 90 synthetic species using the
(3o,2o) model (it is not our ambition at this point to detect the “right” number
of segmentations and segments per segmentation). In approximately 1 out of
3 random restarts the algorithm terminated with the correct segmentations of
Figure 2, or solutions that differed from the correct one in cluster assignments for
2-3 regions. In the remaining restarts the algorithm terminated at local optima,
a representative example of which is shown in Figure 2 (bottom). However, the
(almost) correct solutions were identified by higher log-likelihood scores (between
-19912 and -19783) than that of the wrong solutions (between -23474 and
21677).</p>
      <p>
        For comparison, we also performed an experiment where the logistic
regression model for P (X | L) was replaced by a full multinomial model, i.e. for each
species we fit a conditional probability table of the form (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) with 6 independent
parameters. In this case, almost all restarts terminated with wrong solutions as in
Figure 2, and, more importantly, the correct solutions could not be distinguished
by a higher likelihood score: in the multinomial model, any pair of
segmentations whose combination identifies the 6 different combinations of vertical and
horizontal segments achieves the same, optimal, likelihood score.
      </p>
      <p>We also use this synthetic data experiment to demonstrate that in
FLclustering there is not necessarily a correlation between clusterings and
featuresubsets. Figure 3 (a) shows for each of the 90 synthetic species the mutual
information between the species occurrence feature and the two clusterings of
Figure 2 (top). The plot shows that there is no strong association of individual
species features with one or the other of the two segmentations.
5.2</p>
      <p>
        Real Data
We now perform experiments with the real data consisting of the actual 2398
species. Again, we do not try at this point to automatically detect an appropriate
number of segmentations, or segments per segmentation. We run the learning
algorithm with a few selected ordinal and nominal logistic models. In all cases
we perform 20 runs of the algorithm with different random initializations of the
latent variables L. The results shown in the following are the segmentations that
achieved the highest likelihood score (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) within the 20 restarts.
      </p>
      <p>Figure 4 shows the result of clustering with the (3o,3o) and (3n,3n) logistic
models. We use different colors to represents segments computed by nominal
logistic models, and greyscale values for ordinal logistic models. The greyscale
values then show the ordering of the segments according to their (ordinal) index.
One rfist observes that both models hav e produced one segmentation in which
the mountain areas are identified as one segment: there is an almost perfect
correspondence between the mountain attribute illustrated in Figure 1, and the
dark grey, respectively yellow, segments in the rfist segmentations of Figure 4
(note that our method does not entail an ordering of the different segmentations;
in particular, in Figure 4 we have just for convenience vertically aligned similar
segmentations, and arbitrarily put the ones containing the mountain segment
rfist).</p>
      <p>Apart from the mountain/valley attribute our data does not contain “hidden
class variables” that could be used for int erpreting the segmentations, and
therefore one has to look for additional, external data sources, and expert knowledge.
As previously mentioned, we expect that the different segmentations to some
extent correspond to ecological factors that determine plant growth. A difficulty
we now encounter is that many such candidate factors (e.g., average annual
temperature, average precipitation) are highly correlated with the mountain/valley
division, and often show a secondary gradient in north-south direction. The
second segmentations of Figure 4 are somewhat dominated by a north-south
stratification, and also exhibit some of the patterns visible in Figure 1 (b). However,
it seems impossible to identify these north-south segmentations with any
particular ecological factor. Instead, it can only be taken as aggregating the
northsouth dependency of several factors. Moreover, whereas one clustering showing
the mountain/valley division was quite consistently produced in the random
restarts, there were larger variations observed in the north-south clustering.</p>
      <p>The range of likelihood values obtained in 20 restarts was −288 · 103 to
−278·103 for (3o,3o) clustering, and −308·103 to −296·103 for (3n,3n) clustering
(since the former model fits more independent parameters, higher likelihood
scores are to be expected).</p>
      <p>Figure 3 shows the mutual information values for the plant features and
the (3o,3o) segmentation of Figure 4. This plot shows a relatively strong
correlation of some species with the mountain/valley clustering, and a somewhat
less pronounced primary correlation of some other species with the north/south
segmentation. The large number of species with very small mutual information
values for either segmentation is largely made up of species that occur in only a
few areas.</p>
      <p>In analogy to the experiment with synthetic data, we also perform with the
real data an experiment with full multinomial species distribution models instead
of the logistic ones. The result is shown in Figure 5. While the mountain/valley
pattern is also partly visible in some of the segments, there is no single segment
or segmentation corresponding to this division, and the overall segmentation
result is clearly less useful than the one obtained with the logistic models.</p>
      <p>The poor performance of the multinomial model may in part be due to this
model’s inability to isolate in its different clusterings several independent
explanatory factors, as illustrated by the synthetic data experiments. In addition,
the multinomial model suffered from severe problems of convergence to local
optima: even though the global likelihood maximum of the multinomial model
must be at least as high as the logistic optimum, the likelihood values found
in 20 restarts were significantly lower for the multinomial than for the logistic
models (range −433 · 103 to −405 · 103).</p>
      <p>The average time consumption of a single run (restart) of (3o,3o) or (3n,3n)
clustering was approximately 3 hours, with an average of approximately 15
iterations until convergence. This increased to approximately 6 hours for (3o,3o,3o)
or (3n,3n,3n) clusterings. The time is consumed almost entirely in tfiting in each
iteration the 2398 logistic regression models for all the plants. For comparison, a
single run with the multinomial model (taking approximately 8 iterations on
average until convergence) takes only about 1 minute, since the multinomial model
is easily fit by taking simple counts.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Discussion and Future Work</title>
      <p>Our experiments have shown that using FL-clustering we can find multiple
meaningful clusterings of categorical data. The objective in our approach is
explanatory (identify underlying factors that determine the overall data patterns) rather
than descriptive (provide the user with multiple views of the data).</p>
      <p>For our purpose, it is clearly essential to use a conditional model P (X | L) of
a restricted functional form, rather than an unconstrained multinomial model.
Logistic regression models are a canonical choice, and can be seen as a categorical
data analogue to the linear mappings between latent and observed dimensions
in the factor analysis model.</p>
      <p>
        A common objective in multiple clustering is that different clusterings are in
some sense orthogonal or complementary. We are not yet able to say in which
sense, or to what extent, FL-clustering satisfies such an objective. Empirically, a
bias towards learning complementary clusterings was difficult to verify with our
data, since most natural candidate segmentations based on hidden
environmental variables would exhibit rather similar patterns (and not at all resemble the
segmentations in Figure 2). Theoretically, one can note that a multi-clustering
L = l in which two clusterings are identical can not be a local maximum of the
likelihood (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) (except for some degenerate, noise-free, data sets). FL-clustering,
thus, is biased away from returning multiple identical clusterings. How this can
be strengthened into a formal result linking likelihood gain and complementarity
of different clusterings is a subject for future work.
      </p>
      <p>In our experiments we have used data with a spatial structure on the data
instances. Within this paper, we have used the spatial structure only for the
visualization of the clustering (i.e., segmentation) results. The model can equally
be used for other categorical data, and is especially suited for high-dimensional
binary data (such as text document data).</p>
      <p>
        On the other hand, our work was also specifically motivated by spatial data,
and the relationship in this case of multiple clustering with factorial hidden
Markov models [3] and factorial Markov random efilds [7]. For spatial data one
can impose a Markov random efild structure on the latent variables L, i.e.,
the assumption of a uniform distribution for L which we used to derive (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
is replaced, e.g., by the assumption that P (L = l | θ∗ ) is a Gibbs distribution
L
with fixed parameters θ∗ . Learning in such a setting proceeds in the same way as
      </p>
      <p>L
described in Section 4, only that P (L = l | θ∗ ) has to be added as a likelihood
L
factor. The optimization in step ii will then usually not be possible precisely,
and require an approximate solution. In this paper we did not employ a Markov
random efild model, since this would usually be used to enforce some smoothness
and contiguity properties of the learned segments, which, for our data, seems
unwarranted (considering, e.g., the rugged outline of the mountain areas).</p>
      <p>In this paper we focused on the core of a probabilistic (multi-) clustering
model, i.e., the joint distribution of latent and observable variables. In this model,
the number of clusterings, and the number of clusters in each clustering is fixed.
We remark, however, that either model selection techniques like BIC or MDL
scoring, or a nonparametric Bayesian ’wrapper’ around the core model can be
used to also learn the model structure.</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>We proposed a latent variable model for multiple clustering of categorical data
based on a logistic regression model for the conditional distribution of the
observed features. We believe that in analogy to successful techniques for
dimensionality reduction, a restricted distributional form for the noisy transformation
between the latent and the observed features can be instrumental for revealing
relevant patterns in the latent feature space.</p>
      <p>For clustering based on a latent variable model we have suggested a simple
optimization of the conditional likelihood of the data given the latent variables,
with a fixed marginal distribution for the latent variables. This leads to a
learning procedure that is linear in the number of observed features, and enables us
to experiment with high-dimensional biogeographical data. Our preliminary
results from these experiments demonstrate the ability of the method to discover
clusterings that represent meaningful explanatory factors for the data. However,
further work is needed to consolidate the results returned for this data, and to
investigate their potential biological meaning.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Agresti</surname>
          </string-name>
          .
          <article-title>Categorical Data Analysis</article-title>
          . Wiley,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Liu,
          <string-name>
            <given-names>K. M.</given-names>
            <surname>Poon</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Model-based multidimensional clustering of categorical data</article-title>
          .
          <source>Artificial Intelligence</source>
          ,
          <year>2011</year>
          . To appear.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ghahramani</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Jordan</surname>
          </string-name>
          .
          <article-title>Factorial hidden markov models</article-title>
          .
          <source>Machine Learning</source>
          ,
          <volume>29</volume>
          :
          <fpage>2452</fpage>
          -
          <lpage>73</lpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Guan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. G.</given-names>
            <surname>Dy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Niu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ghahramani</surname>
          </string-name>
          .
          <article-title>Variational inference for nonparametric multiple clustering</article-title>
          .
          <source>In KDD10 Workshop on Discovering, Summarizing and Using Multiple Clusterings</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Hagenaars</surname>
          </string-name>
          .
          <source>Loglinear Models with Latent Variables. Number 94 in Quantitative Applications in the Social Sciences. Sage Publications</source>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>P.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Meka</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Dhillon.</surname>
          </string-name>
          <article-title>Simultaneous unsupervised learning of disparate clusterings</article-title>
          .
          <source>In SIAM Int. Conf. on Data Mining</source>
          , pages
          <fpage>8588</fpage>
          -
          <lpage>69</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Zabih</surname>
          </string-name>
          .
          <article-title>Factorial markov random fields</article-title>
          .
          <source>In Proc. of ECCV</source>
          <year>2002</year>
          ,
          <article-title>number</article-title>
          2352 in LNCS, pages
          <fpage>3213</fpage>
          -
          <lpage>34</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>D.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. G.</given-names>
            <surname>Dy</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. I.</given-names>
            <surname>Jordan</surname>
          </string-name>
          .
          <article-title>Multiple non-redundant spectral clustering views</article-title>
          .
          <source>In Proc. of the 27th Int. Conf. on Machine Learning (ICML-10)</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>L.</given-names>
            <surname>Orloci</surname>
          </string-name>
          .
          <article-title>An agglomerative method for classification of plant communities</article-title>
          .
          <source>The Journal of Ecology</source>
          ,
          <volume>55</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1932</fpage>
          -
          <lpage>06</lpage>
          ,
          <year>1967</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. H.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Shan</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Banerjee</surname>
          </string-name>
          .
          <article-title>Bayesian cluster ensembles</article-title>
          .
          <source>Statistical Analysis and Data Mining</source>
          ,
          <volume>4</volume>
          (
          <issue>1</issue>
          ):
          <fpage>547</fpage>
          -
          <lpage>0</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>T.</given-names>
            <surname>Wohlgemuth</surname>
          </string-name>
          .
          <article-title>Biogeographical regionalization of switzerland based on floristic data: How many species are needed?</article-title>
          <source>Biodiversity Letters</source>
          ,
          <volume>3</volume>
          (
          <issue>6</issue>
          ):
          <fpage>1801</fpage>
          -
          <lpage>91</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>T.</given-names>
            <surname>Wohlgemuth</surname>
          </string-name>
          .
          <article-title>Ein floristischer ansatz zur biogeographischen gliederung der schweiz</article-title>
          .
          <source>Botanica Helvetica</source>
          ,
          <volume>106</volume>
          :
          <fpage>2272</fpage>
          -
          <lpage>60</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>N. L. Zhang.</surname>
          </string-name>
          <article-title>Hierarchical latent class models for cluster analysis</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>5</volume>
          :
          <fpage>6977</fpage>
          -
          <lpage>23</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>N. L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Discovery of latent structures: Experience with the COIL challenge 2000 data set</article-title>
          .
          <source>Journal of Systems Science and Complexity</source>
          ,
          <volume>21</volume>
          :
          <fpage>1721</fpage>
          -
          <lpage>83</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>