Skip to content

Navigation Menu

Sign in

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Bugs of subgraph augmentation #24

New issue
Copy link
New issue
Copy link
Closed
Closed
Bugs of subgraph augmentation#24
Copy link
@hyp1231

Description

@hyp1231
hyp1231
opened on May 11, 2021
Issue body actions

Hi,
when browsing the code, I found there might be bugs in the subgraph augmentation.

In Python 3.7+, the union operation is not an inplace operation, so that idx_neigh will not be updated properly. In this situation, only 1-hop subgraph of a random centor node will be generated.

Some examples:

GraphCL/semisupervised_TU/pre-training/tu_dataset.py

Line 251 in e9e598d

idx_neigh.union(set([n for n in edge_index[1][edge_index[0]==idx_sub[-1]]]))

GraphCL/unsupervised_TU/aug.py

Line 371 in e9e598d

idx_neigh.union(set([n for n in edge_index[1][edge_index[0]==idx_sub[-1]]]))

GraphCL/transferLearning_MoleculeNet_PPI/bio/loader.py

Line 310 in e9e598d

idx_neigh.union(set([n for n in edge_index[1][edge_index[0]==idx_sub[-1]]]))

GraphCL/transferLearning_MoleculeNet_PPI/chem/loader.py

Line 844 in e9e598d

idx_neigh.union(set([n for n in edge_index[1][edge_index[0]==idx_sub[-1]]]))

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions
      Morty Proxy This is a proxified and sanitized view of the page, visit original site.