RCOMM Challenge 3: Fibonacci Numbers (Improved live solution)

Created: 2010-09-17 08:56:32      Last updated: 2010-09-17 08:56:33

At the RComm 2010 (www.rcomm2010.org), an unusual competition was held. Titled "Who Wants to Be a Data Miner", three challenges were issued to the participants of the conference. In all challenges, participants had to design RapidMiner processes as quickly as possible. This is the winning process of Challenge 2: "Fibonacci Numbers" by Matko Bošnjak. This was the task:

The n-th Fibonacci number is F(n)=F(n-1)+F(n-2), and F(0)=0, F(1)=1. Create a process that creates an example set with F(n) rows where n can be defined as a macro of the process.

This solution does even more than the intended result: It creates an example set where row i contains F(i).

Information Preview

Information Run

Not available

Information Workflow Components


Information Workflow Type


Information Uploader

Information License

All versions of this Workflow are licensed under:

Information Version 1 (of 1)

Information Credits (0)



Information Attributions (0)



Information Tags (0)


Log in to add Tags

Information Shared with Groups (0)


Information Featured In Packs (1)

Log in to add to one of your Packs

Information Attributed By (0)



Information Favourited By (0)

No one

Information Statistics


Citations (0)


Version History

In chronological order:

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.