-
When using a clustering algorithm, what differences occur between clustering a set of data (no edges, just sets of points in euclidean coordinate space) versus clustering a graph consisting of vertice…
-
@masongallo @lemonsoup
Hi Kate,
I looked at your slides Movie.DatabasePicture.pdf and code Final_Project.ipynb.
I liked the slides in the presentation. A lot of good graphs/visuals makes it easy to…
-
Efficient approximate kNN-graph construction, and efficient approximate kNN search using such a graph would be of significant potential benefit for scikit-learn. Such methods are independent of data d…
-
Shouldn't the correct trait bound be `Clone`? Using `Copy` is incredibly restrictive and not possible for many types. If the reason if for performance, then I would counter by saying that Rc is `Clone…
-
IEEE pages: https://ieeexplore.ieee.org/document/9046288
IEEE pages for Concordia: https://ieeexplore-ieee-org.lib-ezproxy.concordia.ca/document/9046288
PDF: https://ieeexplore-ieee-org.lib-ezproxy.co…
-
I've seen the [milestones](https://github.com/tedsteiner/OpenStreetMap.jl/milestones/), and think it's worth laying out what I think is left, for present and future contributors, before we release (th…
-
This is part of [openjournals/joss-reviews#1843](https://github.com/openjournals/joss-reviews/issues/1843). This post is about code implementation.
The author implements a coloring algorithm based…
-
Currently KOMB relies on [igraph](https://igraph.org/c/) for k-core decomposition. Hence, although all the adjacency information for the graph construction is done in the functions `Kgraph::readSAM`, …
-
I previously already implemented an insertion-ordered immutable map for another open-source project. The goal is to backport this implementation to capsule and integrate them into capsule's API.
-
## New `geo::algorithm` module to calculate shortest path between two given points based on given `MultiLineString` struct.
### Let's implement it in two separate steps for two separate features.
…