An important research topic of the recent years has been to understand and analyze data collections for clustering and classification applications. In many data analysis problems, the data sets at hand have an intrinsically low-dimensional structure and admit a manifold model. Most state-of-the-art clustering methods developed for data of non-linear and low-dimensional structure are based on local linearity assumptions. However, clustering algorithms based on locally linear representations can tolerate difficult sampling conditions only to some extent, and may fail for scarcely sampled data manifolds or at high-curvature regions. In this thesis, we consider a setting where each cluster is concentrated around a manifold and propose a manifol...
Manifold clustering aims to partition a set of input data into several clusters each of which contai...
It is a challenging problem to cluster multi- and high-dimensional data with complex intrinsic prope...
In many practical situations data may be characterized by nonlinearly separable clusters. Classical ...
An important research topic of the recent years has been to understand and analyze manifold-modeled ...
In real-world pattern recognition tasks, the data with multiple manifolds structure is ubiquitous an...
One of the fundamental tasks of unsupervised learning is dataset clustering, to partition the input ...
Abstract. Manifold clustering, which regards clusters as groups of points around compact manifolds, ...
Because of variable dependence, high dimensional data typically have much lower intrinsic dimensiona...
Classical clustering algorithms are based on the concept that a cluster center is a single point. Cl...
Part 5: Classification - ClusteringInternational audienceIn many cases of high dimensional data anal...
This thesis introduces geometric representations relevant to the analysis of datasets of random vect...
This work studies the application of topological analysis to non-linear manifold clustering. A novel...
Manifold learning and finding low-dimensional structure in data is an important task. Many algorithm...
We consider the problem of analyzing data for which no straight forward and meaningful Euclidean rep...
The problem of multiple surface clustering is a challenging task, particularly when the surfaces int...
Manifold clustering aims to partition a set of input data into several clusters each of which contai...
It is a challenging problem to cluster multi- and high-dimensional data with complex intrinsic prope...
In many practical situations data may be characterized by nonlinearly separable clusters. Classical ...
An important research topic of the recent years has been to understand and analyze manifold-modeled ...
In real-world pattern recognition tasks, the data with multiple manifolds structure is ubiquitous an...
One of the fundamental tasks of unsupervised learning is dataset clustering, to partition the input ...
Abstract. Manifold clustering, which regards clusters as groups of points around compact manifolds, ...
Because of variable dependence, high dimensional data typically have much lower intrinsic dimensiona...
Classical clustering algorithms are based on the concept that a cluster center is a single point. Cl...
Part 5: Classification - ClusteringInternational audienceIn many cases of high dimensional data anal...
This thesis introduces geometric representations relevant to the analysis of datasets of random vect...
This work studies the application of topological analysis to non-linear manifold clustering. A novel...
Manifold learning and finding low-dimensional structure in data is an important task. Many algorithm...
We consider the problem of analyzing data for which no straight forward and meaningful Euclidean rep...
The problem of multiple surface clustering is a challenging task, particularly when the surfaces int...
Manifold clustering aims to partition a set of input data into several clusters each of which contai...
It is a challenging problem to cluster multi- and high-dimensional data with complex intrinsic prope...
In many practical situations data may be characterized by nonlinearly separable clusters. Classical ...