-
MERLIN algorithm is for anomaly detection in long time series data `T`. It is initially proposed in paper [MERLIN](https://www.cs.ucr.edu/~eamonn/MERLIN_Long_version_for_website.pdf).
In this issu…
-
I would like to get the `k` nearest points that are not the querying points when using the same data for building the tree and querying it. Is it possible to do this with the `skip` function? The `ski…
-
**_n_closest_** is a required input for the **_plg.spatial.get_closest_points_to_point_** function. I would suggest to make it optional since the number of neighbouring stations might be irrelevant fo…
-
### Contact Details
robit.alec@gmail.com, luc.guindon@nrcan-rncan.gc.ca
### Dataset description
I am assisting the data owner, Luc Guindon, with this data suggestion for the community data catalog.…
-
In this use case I plan to use the perceval twitter backend to collect data from Twitter and then use machine learning algorithms to show interesting facts. The idea is to use Python for the developme…
-
There are multiple implementations of spatial index trees in Julia: SortTileRecursiveTree, SpatialIndexing, LibSpatialIndex. The problem lies in that there is no single API to query any of these. Th…
-
Hello,
I would like to save a trained model using pickle and then use the predict method on new data points to predict the cluster membership probabilities for each new data point. So far, I found on…
-
While reading the messages by Pyroevil on the forum, I noticed that he wanted to replace KD-Tree with Octree. Octree can be faster.
@OmidGhotbi do you know if Octree will be faster than KD-Tree? Wi…
-
It'd be interesting to analyze the research of Turing Award winners and ACM Fellows. For example, we can scrape their publications, compute embeddings for their papers, and cluster them.
First step…
-
Dear all,
I'm trying to reproduce the code from the example **sklearn: automated learning method selection and tuning** from here http://optunity.readthedocs.io/en/latest/notebooks/notebooks/sklear…
unnir updated
7 years ago