S-TREE: Self-Organizing Trees for Data Clustering and Online Vector Quantization

This paper introduces S-TREE (Self-Organizing Tree), a family of models that use unsupervised learning to construct hierarchical representations of data and online tree-structured vector quantizers. The S-TREE1 model, which features a new tree-building algorithm, can be implemented with various cost functions. An alternative implementation, S-TREE2, which uses a new double-path search procedure, is also developed. S-TREE2 implements an online procedure that approximates an optimal (unstructured) clustering solution while imposing a tree-structure constraint. The performance of the S-TREE algorithms is illustrated with data clustering and vector quantization examples, including a Gauss-Markov source benchmark and an image compression application. S-TREE performance on these tasks is compared with the standard tree-structured vector quantizer (TSVQ) and the generalized Lloyd algorithm (GLA). The image reconstruction quality with S-TREE2 approaches that of GLA while taking less than 10% of computer time. S-TREE1 and S-TREE2 also compare favorably with the standard TSVQ in both the time needed to create the codebook and the quality of image reconstruction.Office of Naval Research (N00014-95-10409, N00014-95-0G57

Nonparametric Hierarchical Clustering of Functional Data

In this paper, we deal with the problem of curves clustering. We propose a nonparametric method which partitions the curves into clusters and discretizes the dimensions of the curve points into intervals. The cross-product of these partitions forms a data-grid which is obtained using a Bayesian model selection approach while making no assumptions regarding the curves. Finally, a post-processing technique, aiming at reducing the number of clusters in order to improve the interpretability of the clustering, is proposed. It consists in optimally merging the clusters step by step, which corresponds to an agglomerative hierarchical classification whose dissimilarity measure is the variation of the criterion. Interestingly this measure is none other than the sum of the Kullback-Leibler divergences between clusters distributions before and after the merges. The practical interest of the approach for functional data exploratory analysis is presented and compared with an alternative approach on an artificial and a real world data set

Mobility, fitness collection, and the breakdown of cooperation

The spatial arrangement of individuals is thought to overcome the dilemma of cooperation: When cooperators engage in clusters, they might share the benefit of cooperation while being more protected against noncooperating individuals, who benefit from cooperation but save the cost of cooperation. This is paradigmatically shown by the spatial prisoner's dilemma model. Here, we study this model in one and two spatial dimensions, but explicitly take into account that in biological setups, fitness collection and selection are separated processes occurring mostly on vastly different time scales. This separation is particularly important to understand the impact of mobility on the evolution of cooperation. We find that even small diffusive mobility strongly restricts cooperation since it enables noncooperative individuals to invade cooperative clusters. Thus, in most biological scenarios, where the mobility of competing individuals is an irrefutable fact, the spatial prisoner's dilemma alone cannot explain stable cooperation, but additional mechanisms are necessary for spatial structure to promote the evolution of cooperation. The breakdown of cooperation is analyzed in detail. We confirm the existence of a phase transition, here controlled by mobility and costs, which distinguishes between purely cooperative and noncooperative absorbing states. While in one dimension the model is in the class of the voter model, it belongs to the directed percolation universality class in two dimensions. DOI: 10.1103/PhysRevE.87.04271