PersistenceFisherDistance | R Documentation |
Computes the persistence Fisher distance matrix from a list of persistence diagrams. The persistence Fisher distance is obtained by computing the original Fisher distance between the probability distributions associated to the persistence diagrams given by convolving them with a Gaussian kernel. See http://papers.nips.cc/paper/8205-persistence-fisher-kernel-a-riemannian-manifold-kernel-for-persistence-diagrams for more details.
rgudhi::PythonClass
-> rgudhi::SKLearnClass
-> rgudhi::MetricStep
-> PersistenceFisherDistance
new()
The PersistenceFisherDistance
constructor.
PersistenceFisherDistance$new(bandwidth = 1, kernel_approx = NULL, n_jobs = 1)
bandwidth
A numeric value specifying the bandwidth of the Gaussian
kernel applied to the persistence Fisher distance. Defaults to 1.0
.
kernel_approx
A Python class specifying the kernel approximation
class used to speed up computation. Defaults to NULL
. Common kernel
approximations classes can be found in the scikit-learn library
(such as RBFSampler
for instance).
n_jobs
An integer value specifying the number of jobs to use for
the computation. Defaults to 1L
.
An object of class PersistenceFisherDistance
.
clone()
The objects of this class are cloneable with this method.
PersistenceFisherDistance$clone(deep = FALSE)
deep
Whether to make a deep clone.
Mathieu Carrière
X <- seq_circle(10)
ac <- AlphaComplex$new(points = X)
st <- ac$create_simplex_tree()
dgm <- st$compute_persistence()$persistence_intervals_in_dimension(0)
ds <- DiagramSelector$new(use = TRUE)
dgm <- ds$apply(dgm)
dis <- PersistenceFisherDistance$new()
dis$apply(dgm, dgm)
dis$fit_transform(list(dgm))
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.