We introduce a novel algorithm for factorial learning, motivated by segmentation problems in computational vision, in which the underlying factors correspond to clusters of highly correlated input features. The algorithm derives from a new kind of competitive clustering model, in which the cluster generators compete to explain each feature of the data set and cooperate to explain each input example, rather than competing for examples and cooperating on features, as in traditional clustering algorithms. A natural extension of the algorithm recovers hierarchical models of data generated from multiple unknown categories, each with a different, multiple causal structure. Several simulations demonstrate the power of this approach.
[1]
Radford M. Neal.
A new view of the EM algorithm that justifies incremental and other variants
,
1993
.
[2]
Rose,et al.
Statistical mechanics and phase transitions in clustering.
,
1990,
Physical review letters.
[3]
R. Zemel,et al.
Learning sparse multiple cause models
,
2000,
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.
[4]
Geoffrey E. Hinton,et al.
Autoencoders, Minimum Description Length and Helmholtz Free Energy
,
1993,
NIPS.
[5]
Eric Saund,et al.
A Multiple Cause Mixture Model for Unsupervised Learning
,
1995,
Neural Computation.