GithubHelp home page GithubHelp logo

Comments (4)

SamGG avatar SamGG commented on May 27, 2024

The annoy recall is definitively not the same.
Did you set the seed in order to tend to be reproducible?

from uwot.

summerghw avatar summerghw commented on May 27, 2024

yes, I set the seed
my.seed <- 202106L

from uwot.

jlmelville avatar jlmelville commented on May 27, 2024

There is no connection to the internet required. No network communication of any kind should be happening.

I assume the various github actions for testing R packages make use of containers, so there shouldn't be a problem with using uwot with docker. All I can think of with the information provided is:

  1. The nearest neighbor search needs to be able to read and write the Annoy index to temporary disk space (as the message Writing NN index file to temp file /tmp/ indicates). Are you sure that both hosts are set up to provide this storage in the same way (e.g. same permissions, same amount of space)? There could be failures here where I have failed to detect these states and not provided an appropriate error message. In my own experience with getting containers to read and write data to host storage (albeit unrelated to uwot or R), I had to be quite careful with user permissions and matching user and group ids between host and container. But that was a few years ago.
  2. If you look at the Annoy issues, making it work with docker seems to be a rich source of problems. Usually these seem to be down to using compilation flags that only work on the machine where annoy was compiled, and the restrictions that CRAN puts on such flags should make us immune to that. But do you know if the machine on which uwot/the container was built has the same architecture as the two machines you are running the container on? Even very small changes seem to cause problems.

As an aside, the recall value you get (0.2) in the first case where things seem to be working might be a bit worrying: it means that for 80% of the observations in your dataset, they fail to find themselves as their own nearest neighbor. Either the nearest neighbor search is failing (could be due to not enough trees or too low a search_k value) or you have a lot duplicates. If you aren't expecting duplicates in your data, it's worth investigating that before proceeding.

from uwot.

summerghw avatar summerghw commented on May 27, 2024

@jlmelville thank you for reply.

from uwot.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.