# metadata.dc.description[].value
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2015, Director: Jaime Nebrera i Josep Vives i Santa Eulàlia

# metadata.dc.description.abstract[].value
The large amount of data stored in the last two decades makes us to create new algorithms that can treat this information and elicit the desired statistical analysis. In this paper we study the algorithms that find the most common elements k, top-k in a dataset or in a Data Stream.
The algorithms must make a minimum memory usage, so the results will be an estimate, trying to minimize possible error. At the end of this work will be expose own implementation.

# metadata.dc.rights[].value
cc-by-nc-nd (c) Carlos Martínez López, 2015

# metadata.dc.source[].value
Treballs Finals de Grau (TFG) - Matemàtiques