Skip to content

Commit

Permalink
Update preprocessing.py
Browse files Browse the repository at this point in the history
  • Loading branch information
agosztolai authored Aug 19, 2024
1 parent bfda425 commit 56040d6
Showing 1 changed file with 9 additions and 3 deletions.
12 changes: 9 additions & 3 deletions MARBLE/preprocessing.py
Original file line number Diff line number Diff line change
Expand Up @@ -24,6 +24,7 @@ def construct_dataset(
local_gauges=False,
seed=None,
metric="euclidean",
eigendecomposition=True
):
"""Construct PyG dataset from node positions and features.
Expand All @@ -44,6 +45,8 @@ def construct_dataset(
embedding dimension is > 2 or dim embedding is not dim of manifold)
seed: Specify for reproducibility in the furthest point sampling.
The default is None, which means a random starting vertex.
metric: metric used to fit proximity graph
eigendecomposition: perform eigendecomposition (needed for diffusion).
"""

anchor = [torch.tensor(a).float() for a in utils.to_list(anchor)]
Expand Down Expand Up @@ -112,6 +115,7 @@ def construct_dataset(
local_gauges=local_gauges,
n_geodesic_nb=k * frac_geodesic_nb,
var_explained=var_explained,
eigendecomposition=eigendecomposition
)


Expand All @@ -120,6 +124,7 @@ def _compute_geometric_objects(
n_geodesic_nb=10,
var_explained=0.9,
local_gauges=False,
eigendecomposition=True
):
"""
Compute geometric objects used later: local gauges, Levi-Civita connections
Expand Down Expand Up @@ -189,9 +194,10 @@ def _compute_geometric_objects(
kernels = g.gradient_op(data.pos, data.edge_index, gauges)
Lc = None

print("\n---- Computing eigendecomposition ... ", end="")
L = g.compute_eigendecomposition(L)
Lc = g.compute_eigendecomposition(Lc)
if eigendecomposition:
print("\n---- Computing eigendecomposition ... ", end="")
L = g.compute_eigendecomposition(L)
Lc = g.compute_eigendecomposition(Lc)

data.kernels = [
utils.to_SparseTensor(K.coalesce().indices(), value=K.coalesce().values()) for K in kernels
Expand Down

0 comments on commit 56040d6

Please sign in to comment.