Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Support cases where NxM > memory #3

Open
ytoren opened this issue Aug 27, 2020 · 0 comments
Open

Support cases where NxM > memory #3

ytoren opened this issue Aug 27, 2020 · 0 comments
Assignees

Comments

@ytoren
Copy link
Owner

ytoren commented Aug 27, 2020

For the supported built in metrics (where matrix multiplication is possible) we support breaking down the caclulation to [row or block 1xN or nxM] %*% [full NxM matrix] similarity caclulations and stack the similarity matrix row-wise. This works only if the entire feature matrix (NxM) to fit in memory.

For cases where $NxM$ > memory we want to allow the matrix multiplication work "block against block". This means we will stack the similarity matrix both row wise (as we do today) and column wise.

  • Figure out the math (as long as we don't have to break $M$ this should still work)
  • Introduce a second range parameter (or a row-range couplet) which defaults to (1, nrow(X)) (which is the current calculation)
  • Figure out the vertical stacking (block matrix construction?)
@ytoren ytoren self-assigned this Aug 27, 2020
@ytoren ytoren changed the title Support cases where $N$ > memory Support cases where NxM > memory Aug 27, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant