[WIP] Add two feature sampling methods for graphs #337
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Deploy preview for rerf ready! Built with commit b5839d1 |
|
Not quite sure how to deal with different sized tabs cause tabs in C++ files vary in size. Can be 8 spaces or 4 or 2.... |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
These are two methods for graph valued data.
Graph-Edge-MORF randomly takes one row of the adjacency matrices, then randomly samples some number of elements of that row based on
patch_height_minandpatch_height_max. The sum of the selected elements is the new feature for that graph.Graph-Node-MORF randomly samples n \in [patch_height_min, patch_height_max] integers between
[1, image_height]. You take the rows and cols based on the sampled integers, and sum the values in that small square. This is the new feature for that graph.