FP-growth-algoritmi

Tässä tutkielmassa tutkitaan FP-growth-algoritmia, joka on yksi tiedonlouhinnan assosiaatio-menetelmän assosiaatiosääntöalgoritmi. Assosiaatiosääntöalgoritmi etsii usein esiintyvät alkiojoukot ja muodostaa niistä assosiaatiosäännöt. Assosiaatiosääntöjä käytetään yleisesti markkinakorianalyysissä, jo...

Täydet tiedot

Bibliografiset tiedot
Päätekijä: Virtanen, Otto
Muut tekijät: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, Jyväskylän yliopisto, University of Jyväskylä
Aineistotyyppi: Kandityö
Kieli:fin
Julkaistu: 2021
Aiheet:
Linkit: https://jyx.jyu.fi/handle/123456789/74994
_version_ 1828193204032241664
author Virtanen, Otto
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Virtanen, Otto Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Virtanen, Otto Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Virtanen, Otto
datasource_str_mv jyx
description Tässä tutkielmassa tutkitaan FP-growth-algoritmia, joka on yksi tiedonlouhinnan assosiaatio-menetelmän assosiaatiosääntöalgoritmi. Assosiaatiosääntöalgoritmi etsii usein esiintyvät alkiojoukot ja muodostaa niistä assosiaatiosäännöt. Assosiaatiosääntöjä käytetään yleisesti markkinakorianalyysissä, jossa analysoidaan asiakkaiden ostokäyttäytymistä. Lisäksi tutkielmassa verrataan FP-growth-algoritmin nopeutta Apriori-algoritmiin. This bachelor's thesis studies FP-growth-algorithm, which is one of the association rule algorithm of data mining association method. Association rule algorithm finds the frequent itemsets and generates association rules based on those frequent itemsets. Association rules are generally used in the market basket analysis, which analyzes customer's purchasing behavior. In addition in the bachelor's thesis compares FP-growth-algorithm speed to Apriori-algorith.
first_indexed 2021-04-09T20:01:49Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "Lakanen, Antti-Jussi", "language": "", "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "Virtanen, Otto", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2021-04-09T06:09:07Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2021-04-09T06:09:07Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2021", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/74994", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "T\u00e4ss\u00e4 tutkielmassa tutkitaan FP-growth-algoritmia, joka on yksi tiedonlouhinnan assosiaatio-menetelm\u00e4n assosiaatios\u00e4\u00e4nt\u00f6algoritmi. Assosiaatios\u00e4\u00e4nt\u00f6algoritmi etsii usein esiintyv\u00e4t alkiojoukot ja muodostaa niist\u00e4 assosiaatios\u00e4\u00e4nn\u00f6t. Assosiaatios\u00e4\u00e4nt\u00f6j\u00e4 k\u00e4ytet\u00e4\u00e4n yleisesti markkinakorianalyysiss\u00e4, jossa analysoidaan asiakkaiden ostok\u00e4ytt\u00e4ytymist\u00e4. Lis\u00e4ksi tutkielmassa verrataan FP-growth-algoritmin nopeutta Apriori-algoritmiin.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "This bachelor's thesis studies FP-growth-algorithm, which is one of the association rule algorithm of data mining association method. Association rule algorithm finds the frequent itemsets and generates association rules based on those frequent itemsets. Association rules are generally used in the market basket analysis, which analyzes customer's purchasing behavior. In addition in the bachelor's thesis compares FP-growth-algorithm speed to Apriori-algorith.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Paivi Vuorio (paelvuor@jyu.fi) on 2021-04-09T06:09:07Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2021-04-09T06:09:07Z (GMT). No. of bitstreams: 0\n Previous issue date: 2021", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "19", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "assosiaatios\u00e4\u00e4nt\u00f6algoritmi", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "fp-growth", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "markkinakorianalyysi", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "FP-growth-algoritmi", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-202104092308", "language": "", "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatinty\u00f6", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "yvv.contractresearch.funding", "value": "0", "language": "", "element": "contractresearch", "qualifier": "funding", "schema": "yvv"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.subject.oppiainekoodi", "value": "602", "language": "", "element": "subject", "qualifier": "oppiainekoodi", "schema": "dc"}, {"key": "dc.subject.yso", "value": "algoritmit", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "tiedonlouhinta", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_74994
language fin
last_indexed 2025-03-31T20:01:36Z
main_date 2021-01-01T00:00:00Z
main_date_str 2021
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/b934101b-3508-4a61-a0e5-3b42a80cb855\/download","text":"URN:NBN:fi:jyu-202104092308.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2021
record_format qdc
source_str_mv jyx
spellingShingle Virtanen, Otto FP-growth-algoritmi assosiaatiosääntöalgoritmi fp-growth markkinakorianalyysi Tietotekniikka Mathematical Information Technology 602 algoritmit tiedonlouhinta
title FP-growth-algoritmi
title_full FP-growth-algoritmi
title_fullStr FP-growth-algoritmi FP-growth-algoritmi
title_full_unstemmed FP-growth-algoritmi FP-growth-algoritmi
title_short FP-growth-algoritmi
title_sort fp growth algoritmi
title_txtP FP-growth-algoritmi
topic assosiaatiosääntöalgoritmi fp-growth markkinakorianalyysi Tietotekniikka Mathematical Information Technology 602 algoritmit tiedonlouhinta
topic_facet 602 Mathematical Information Technology Tietotekniikka algoritmit assosiaatiosääntöalgoritmi fp-growth markkinakorianalyysi tiedonlouhinta
url https://jyx.jyu.fi/handle/123456789/74994 http://www.urn.fi/URN:NBN:fi:jyu-202104092308
work_keys_str_mv AT virtanenotto fpgrowthalgoritmi