Workflows

Transaction Analysis Demo from RM 5 Intro Day (1)

• Download

This is the demo process presented at the RapidMiner 5 Intro Day. It combines customer segmentation with direct mailing. It loads some transaction data, aggregates and pivotes the data so it can be used by a clustering to perform a customer segmentation. Then, additional data is joined with the clustered data. First, response/no-response data is joined, and them some additional information about the users is added. Finally, customers are classified into response/no-response classes. The dat...

Created: 2010-04-30 | Last updated: 2010-05-05

RCOMM Challenge 2: Broken Iris (1)

• Download

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: "Broken Iris" by Nico Piatkowski. This was the task: You are given a decision tree model (M) designed on the well-known Iris data set and unlabelled data (U) on which the model is t...

Created: 2010-09-17

Stacking (1)

• Download

RapidMiner supports Meta Learning by embedding one or several basic learners as children into a parent meta learning operator. Here, we use a three base learners inside the stacking operator: decision tree induction, linear regression, and a nearest neighbours classifier. Finally, a Naive Bayes learner is used as a stacking learner which uses the predictions of the preceeding three learners to make a combined prediction.

Created: 2010-04-29

RCOMM 2011 Challenge 2: Vodka or President? (1)

• Download

This is a solution for Challenge 2 of the a live data mining process design competition "Who Wants to be a Data Miner" held at RCOMM 2011 in Dublin. Those of you who loved "You Don't Know Jack" will remember this task: To tell whether a certain word is the name of a vodka or the name of a leader of the Soviet Union. The RapidMiner process was allowed to download data from Wikipedia to make this decision. One input file contains a list of words for which two attributes "Vodka" or "Leader" wi...

Created: 2011-11-02

RCOMM Challenge 3: Fibonacci Numbers (Inte... (1)

• Download

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 original solution I had in mind for Challenge 2: "Fibonacci Numbers". It defines a macro n, recurses by applying itself using an "Embed Process" operator on n-1 and n-2, appends the results (so the length is F(n-1)...

Created: 2010-09-17 | Last updated: 2010-09-17

RCOMM Challenge 3: Fibonacci Numbers (Impr... (1)

• Download

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)...

Created: 2010-09-17 | Last updated: 2010-09-17

Crossvalidation with SVM (1)

• Download

Performs a crossvalidation on a given data set with nominal label, using a Support Vector Machine as a learning algorithm. Inside the cross validation, the first subprocess generates an SVM model, and the second subprocess evaluates it. applying it on a so-far unused subset of the data and counting the misclassifications.

Created: 2010-04-29

RCOMM Challenge 1: 99 bottles of beer (1)

• Download

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 1: "99 bottles of beer" by Sebastian Land. This was the task: Design a process that produces an example set the rows of which form the lyrics of the well-known song "99 bottles of beer...

Created: 2010-09-17

Cross tabulation via aggregation and pivoting (1)

• Download

Creates a contingency table using the Aggregate and Pivot operators.

Created: 2010-08-25 | Last updated: 2010-08-25