Unsupervised Features Learning for Sampled Vector Fields

11/22/2019
by   Mateusz Juda, et al.
0

In this paper we introduce a new approach to computing hidden features of sampled vector fields. The basic idea is to convert the vector field data to a graph structure and use tools designed for automatic, unsupervised analysis of graphs. Using a few data sets we show that the collected features of the vector fields are correlated with the dynamics known for analytic models which generates the data. In particular the method may be useful in analysis of data sets where the analytic model is poorly understood or not known.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2011

Vector Diffusion Maps and the Connection Laplacian

We introduce vector diffusion maps (VDM), a new mathematical framework ...
research
01/24/2022

Analytic torsion for graphs

Analytic torsion is a functional on graphs which only needs linear algeb...
research
07/02/2023

A new approach to integrals of discretizations by polarization

Recently, a family of unconventional integrators for ODEs with polynomia...
research
05/15/2023

Numerical implementation of generalized V-line transforms on 2D vector fields and their inversions

The paper discusses numerical implementations of various inversion schem...
research
07/13/2012

Verifying an algorithm computing Discrete Vector Fields for digital imaging

In this paper, we present a formalization of an algorithm to construct a...
research
06/17/2022

Representational Multiplicity Should Be Exposed, Not Eliminated

It is prevalent and well-observed, but poorly understood, that two machi...
research
05/18/2008

Symmetry in Data Mining and Analysis: A Unifying View based on Hierarchy

Data analysis and data mining are concerned with unsupervised pattern fi...

Please sign up or login with your details

Forgot password? Click here to reset