Representing Data by a Mixture of Activated Simplices

12/12/2014
by   Chunyu Wang, et al.
0

We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our method requires that the data are unit normalized (and thus lie on the unit sphere). We show that under this restriction, building a model with simplices amounts to constructing a convex hull inside the sphere whose boundary facets is close to the data. We call the boundary facets of the convex hull that are close to the data Activated Simplices. While the total number of bases used to build the simplices is a parameter of the model, the dimensions of the individual activated simplices are learned from the data. Simplices can have different dimensions, which facilitates modeling of inhomogeneous data sources. The simplicial structure is bounded --- this is appropriate for modeling data with constraints, such as human elbows can not bend more than 180 degrees. The simplices are easy to interpret and extremes within the data can be discovered among the vertices. The method provides good reconstruction and regularization. It supports good nearest neighbor classification and it allows realistic generative models to be constructed. It achieves state-of-the-art results on benchmark datasets, including 3D poses and digits.

READ FULL TEXT

page 4

page 6

page 8

page 10

page 11

page 12

page 13

page 14

research
11/07/2021

Parallel Nearest Neighbors in Low Dimensions with Batch Updates

We present a set of parallel algorithms for computing exact k-nearest ne...
research
09/09/2020

KNN-DBSCAN: a DBSCAN in high dimensions

Clustering is a fundamental task in machine learning. One of the most su...
research
03/14/2023

Canonical Sphere Bases for Simplicial and Cubical Complexes

Sphere-bases are constructed for the ℤ_2 vector space formed by the k-di...
research
03/15/2018

Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon

We present an efficient dynamic data structure that supports geodesic ne...
research
02/10/2020

Testing for complete spatial randomness on three dimensional bounded convex shapes

There is currently a gap in theory for point patterns that lie on the su...
research
02/26/2020

Sphere tangencies, line incidences, and Lie's line-sphere correspondence

Two spheres with centers p and q and signed radii r and s are said to be...

Please sign up or login with your details

Forgot password? Click here to reset