1. Home
  2. Workflows
  3. Odkrywanie reguł asocjacyjnych za pomocą algorytmu FP-Growth

Odkrywanie reguł asocjacyjnych za pomocą algorytmu FP-Growth

Created: 2011-03-30 23:00:22      Last updated: 2011-03-30 23:03:13

Proces pokazuje wykorzystanie algorytmu FP-Growth do odkrywania reguÅ‚ asocjacyjnych. Należy zwrócić uwagÄ™ na to, że implementacja algorytmu FP-Growth akceptuje jedynie atrybuty binominalne, zatem zachodzi konieczność zamiany wszystkich atrybutów numerycznych i nominalnych na binominalne.

Information Preview

Medium

Download as scalable diagram (SVG)

Information Run

Not available


Information Workflow Components

Unavailable

Information Workflow Type

RapidMiner

Information Uploader

2640?size=60x60 Pl Mikolaj Morzy

Information License

All versions of this Workflow are licensed under:

Information Version 1 (of 1)

Information Credits (0)

(People/Groups)

None

Information Attributions (0)

(Workflows/Files)

None

Information Tags (0)

None

Log in to add Tags

Information Shared with Groups (0)

None

Information Featured In Packs (0)

None

Log in to add to one of your Packs

Information Attributed By (0)

(Workflows/Files)

None

Information Favourited By (0)

No one

Information Statistics

768 viewings

711 downloads

[ see breakdown ]

More
 

Citations (0)

None


Version History

In chronological order:

  1. Odkrywanie reguł asocjacyjnych za pomocą algorytmu FP-Growth

    Created by Mikolaj Morzy on Wednesday 30 March 2011 23:00:21 (UTC)

    Last edited by Mikolaj Morzy on Wednesday 30 March 2011 23:03:13 (UTC)



Reviews Reviews (0)

No reviews yet

Be the first to review!



Comments Comments (0)

No comments yet

Log in to make a comment




Workflow Other workflows that use similar services (0)

There are no workflows in myExperiment that use similar services to this Workflow.

Funded by: BioVeL, EPSRC, JISC, Microsoft

Affiliates: myGrid, Taverna, BioCatalogue
About | Privacy | Publications | Contact / Feedback | Mailing List
Icons: Silk icon set 1.3

Copyright © 2007 – 2018 The University of Manchester and University of Southampton