Annoy VS WEKA

Annoy

Annoy is a C++ library with Python bindings to search for points in space that are close to a given query point.

WEKA

WEKA is a set of powerful data mining tools that run on Java.

Landing page //
2023-10-10

Landing page //
2018-09-29

WEKA

Website: tools.cms.waikato.ac.nz

Edit details

Annoy videos

+ Add

Does Asking for Reviews Annoy My Customers?

WEKA videos

+ Add

Review of Feature Selection in Weka

Category Popularity

0-100% (relative to Annoy and WEKA)

WEKA

Search Engine

100 100%

Search Engine

0% 0

Data Science And Machine Learning

5 5%

Data Science And Machine Learning

95% 95

Utilities

100 100%

Utilities

0% 0

Data Science Tools

0 0%

Data Science Tools

100% 100

User comments

Share your experience with using Annoy and WEKA. For example, how are they different and which one is better?

Reviews

These are some of the external sources and on-site user reviews we've used to compare Annoy and WEKA

Annoy Reviews

We have no reviews of Annoy yet.
Be the first one to post

WEKA Reviews

15 data science tools to consider using in 2021

Weka is free software licensed under the GNU General Public License. It was developed at the University of Waikato in New Zealand starting in 1992; an initial version was rewritten in Java to create the current workbench, which was first released in 1999. Weka stands for the Waikato Environment for Knowledge Analysis and is also the name of a flightless bird native to New...

Source: searchbusinessanalytics.techtarget.com

Social recommendations and mentions

Based on our record, Annoy seems to be more popular. It has been mentiond 35 times since March 2021. We are tracking product recommendations and mentions on various public social media platforms and blogs. They can help you identify which product is more popular and what people think of it.

Annoy mentions (35)

Do we think about vector dbs wrong?
The focus on the top 10 in vector search is a product of wanting to prove value over keyword search. Keyword search is going to miss some conceptual matches. You can try to work around that with tokenization and complex queries with all variations but it's not easy. Vector search isn't all that new a concept. For example, the annoy library (https://github.com/spotify/annoy), an open source embeddings database. - Source: Hacker News / 10 months ago
Vector Databases 101
If you want to go larger you could still use some simple setup in conjunction with faiss, annoy or hnsw. Source: 12 months ago
Calculating document similarity in a special domain
I then use annoy to compare them. Annoy can use different measures for distance, like cosine, euclidean and more. Source: about 1 year ago
Can Parquet file format index string columns?
Yes you can do this for equality predicates if your row groups are sorted . This blog post (that I didn't write) might add more color. You can't do this for any kind of text searching. If you need to do this with file based storage I'd recommend using a vector based text search and utilize a ANN index library like Annoy. Source: about 1 year ago
[D]: Best nearest neighbour search for high dimensions
If you need large scale (1000+ dimension, millions+ source points, >1000 queries per second) and accept imperfect results / approximate nearest neighbors, then other people have already mentioned some of the best libraries (FAISS, Annoy). Source: about 1 year ago