The clustering of data into physically meaningful subsets often requires assumptions regarding the number, size, or shape of the subgroups. Here, we present a new method, simultaneous coherent structure coloring (sCSC), which accomplishes the task of unsupervised clustering without a priori guidance regarding the underlying structure of the data. sCSC performs a sequence of binary splittings on the dataset such that the most dissimilar data points are required to be in separate clusters. To achieve this, we obtain a set of orthogonal coordinates along which dissimilarity in the dataset is maximized from a generalized eigenvalue problem based on the pairwise dissimilarity between the data points to be clustered. This sequence of bifurcations...
The advent of high-throughput technologies and the concurrent advances in information sciences have ...
Abstract. Clustering constitutes an ubiquitous problem when dealing with huge data sets for data com...
Given a set of points, the goal of data clustering is to group them into clusters, such that the int...
The clustering of data into physically meaningful subsets often requires assumptions regarding the n...
Partitioning a data set and extracting hidden structure from the data arises in different applicatio...
We study a novel clustering problem in which the pairwise relations between objects are categorical....
Many real-life datasets, such as those produced by gene expression studies, exhibit complex substruc...
We present a method for identifying the coherent structures associated with individual Lagrangian fl...
An effective visualization of the global behavior of a dynamical system or a fluid simulation inevit...
<div><p>The advent of high-throughput technologies and the concurrent advances in information scienc...
Clustering algorithms aim, by definition, at partitioning a given set of objects into a set of clust...
International audienceIn this paper, we propose a new time-aware dissimilarity measure that takes in...
AbstractWe formulate a discrete optimization problem that leads to a simple and informative derivati...
Abstract. We consider the problem of clustering data into k ≥ 2clusters given complex relations — go...
We herein introduce a new method of interpretable clustering that uses unsu-pervised binary trees. I...
The advent of high-throughput technologies and the concurrent advances in information sciences have ...
Abstract. Clustering constitutes an ubiquitous problem when dealing with huge data sets for data com...
Given a set of points, the goal of data clustering is to group them into clusters, such that the int...
The clustering of data into physically meaningful subsets often requires assumptions regarding the n...
Partitioning a data set and extracting hidden structure from the data arises in different applicatio...
We study a novel clustering problem in which the pairwise relations between objects are categorical....
Many real-life datasets, such as those produced by gene expression studies, exhibit complex substruc...
We present a method for identifying the coherent structures associated with individual Lagrangian fl...
An effective visualization of the global behavior of a dynamical system or a fluid simulation inevit...
<div><p>The advent of high-throughput technologies and the concurrent advances in information scienc...
Clustering algorithms aim, by definition, at partitioning a given set of objects into a set of clust...
International audienceIn this paper, we propose a new time-aware dissimilarity measure that takes in...
AbstractWe formulate a discrete optimization problem that leads to a simple and informative derivati...
Abstract. We consider the problem of clustering data into k ≥ 2clusters given complex relations — go...
We herein introduce a new method of interpretable clustering that uses unsu-pervised binary trees. I...
The advent of high-throughput technologies and the concurrent advances in information sciences have ...
Abstract. Clustering constitutes an ubiquitous problem when dealing with huge data sets for data com...
Given a set of points, the goal of data clustering is to group them into clusters, such that the int...