Estimación del top-$k$

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.

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

Country

Spain

Related Organizations

University of Barcelona
Spain

Keywords

Data processing, Bachelor's thesis, Bachelor's theses, Algorismes computacionals, Teoria de l'estimació, Treballs de fi de grau, Mineria de dades, Computer algorithms, Estimation theory, Data mining, Processament de dades

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average