Log In Sign Up

Rank-one partitioning: formalization, illustrative examples, and a new cluster enhancing strategy

by   Charlotte Laclau, et al.

In this paper, we introduce and formalize a rank-one partitioning learning paradigm that unifies partitioning methods that proceed by summarizing a data set using a single vector that is further used to derive the final clustering partition. Using this unification as a starting point, we propose a novel algorithmic solution for the partitioning problem based on rank-one matrix factorization and denoising of piecewise constant signals. Finally, we propose an empirical demonstration of our findings and demonstrate the robustness of the proposed denoising step. We believe that our work provides a new point of view for several unsupervised learning techniques that helps to gain a deeper understanding about the general mechanisms of data partitioning.


page 1

page 2

page 3

page 4


Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising

Factorization of matrices where the rank of the two factors diverges lin...

Generalized Low Rank Models

Principal components analysis (PCA) is a well-known technique for approx...

Compact Factorization of Matrices Using Generalized Round-Rank

Matrix factorization is a well-studied task in machine learning for comp...

Erdös-Szekeres Partitioning Problem

In this note, we present a substantial improvement on the computational ...

A Ptolemaic Partitioning Mechanism

For many years, exact metric search relied upon the property of triangle...

Seed-Point Based Geometric Partitioning of Nuclei Clumps

When applying automatic analysis of fluorescence or histopathological im...

Sesquickselect: One and a half pivots for cache-efficient selection

Because of unmatched improvements in CPU performance, memory transfers h...