diff options
author | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2019-12-12 17:22:37 +0100 |
---|---|---|
committer | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2019-12-12 17:22:37 +0100 |
commit | aa93957d37a1f8e0a2d25af27ad87eb6b8eb84c3 (patch) | |
tree | def7b983f30ec5e357744c5e02981fb2e6ce7b94 /src/python/doc/representations.rst | |
parent | 0474f6a62622608b96eac3a553a081e148cbcabc (diff) | |
parent | 2607200636eb01e4df5735ec311d3a69db5ed589 (diff) |
Merge branch 'master' into exact_alpha_complex_python_version
Diffstat (limited to 'src/python/doc/representations.rst')
-rw-r--r-- | src/python/doc/representations.rst | 26 |
1 files changed, 25 insertions, 1 deletions
diff --git a/src/python/doc/representations.rst b/src/python/doc/representations.rst index b3131a25..11dcbcf9 100644 --- a/src/python/doc/representations.rst +++ b/src/python/doc/representations.rst @@ -8,7 +8,7 @@ Representations manual .. include:: representations_sum.inc -This module, originally named sklearn_tda, aims at bridging the gap between persistence diagrams and machine learning tools, in particular scikit-learn. It provides tools, using the scikit-learn standard interface, to compute distances and kernels on diagrams, and to convert diagrams into vectors. +This module, originally available at https://github.com/MathieuCarriere/sklearn-tda and named sklearn_tda, aims at bridging the gap between persistence diagrams and machine learning, by providing implementations of most of the vector representations for persistence diagrams in the literature, in a scikit-learn format. More specifically, it provides tools, using the scikit-learn standard interface, to compute distances and kernels on persistence diagrams, and to convert these diagrams into vectors in Euclidean space. A diagram is represented as a numpy array of shape (n,2), as can be obtained from :func:`~gudhi.SimplexTree.persistence_intervals_in_dimension` for instance. Points at infinity are represented as a numpy array of shape (n,1), storing only the birth time. @@ -46,3 +46,27 @@ Metrics :members: :special-members: :show-inheritance: + +Basic example +------------- + +This example computes the first two Landscapes associated to a persistence diagram with four points. The landscapes are evaluated on ten samples, leading to two vectors with ten coordinates each, that are eventually concatenated in order to produce a single vector representation. + +.. testcode:: + + import numpy as np + from gudhi.representations import Landscape + # A single diagram with 4 points + D = np.array([[0.,4.],[1.,2.],[3.,8.],[6.,8.]]) + diags = [D] + l=Landscape(num_landscapes=2,resolution=10).fit_transform(diags) + print(l) + +The output is: + +.. testoutput:: + + [[1.02851895 2.05703791 2.57129739 1.54277843 0.89995409 1.92847304 + 2.95699199 3.08555686 2.05703791 1.02851895 0. 0.64282435 + 0. 0. 0.51425948 0. 0. 0. + 0.77138922 1.02851895]] |