Estimación del top-$k$

dc.contributor.advisorVives i Santa Eulàlia, Josep, 1963-
dc.contributor.advisorNebrera, Jaime
dc.contributor.authorMartínez López, Carlos
dc.date.accessioned2016-01-22T09:31:42Z
dc.date.available2016-01-22T09:31:42Z
dc.date.issued2015-06-30
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2015, Director: Jaime Nebrera i Josep Vives i Santa Eulàliaca
dc.description.abstractThe 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.ca
dc.format.extent46 p.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/2445/68943
dc.language.isospaca
dc.rightscc-by-nc-nd (c) Carlos Martínez López, 2015
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques
dc.subject.classificationAlgorismes computacionals
dc.subject.classificationTreballs de fi de grau
dc.subject.classificationProcessament de dadesca
dc.subject.classificationTeoria de l'estimacióca
dc.subject.classificationMineria de dadesca
dc.subject.otherComputer algorithms
dc.subject.otherBachelor's theses
dc.subject.otherData processingeng
dc.subject.otherEstimation theoryeng
dc.subject.otherData miningeng
dc.titleEstimación del top-$k$ca
dc.typeinfo:eu-repo/semantics/bachelorThesisca

Fitxers

Paquet original

Mostrant 1 - 2 de 2
Carregant...
Miniatura
Nom:
memoria.pdf
Mida:
1.13 MB
Format:
Adobe Portable Document Format
Descripció:
Memòria
Carregant...
Miniatura
Nom:
codi_font.zip
Mida:
1.3 MB
Format:
ZIP file
Descripció:
Codi font