Search repeated news (using Bloom filter) and similar news (using MinHash) from a news api.

This project was developed under the Probability Methods for Informatics Engineering course of University of Aveiro.

A Bloom filter is a data structure designed to tell, memory-efficiently, whether an element is present in a set.

Bloom filter is a probabilistic data structure: it tells us that the element either definitely is not in the set or may be in the set.

MinHash is a technique for quickly estimating how similar two sets are.

• Eduardo Santos: eduardosantoshf
• Pedro Bastos: bastos-01