All content

RCOMM 2012 Sudoku Challenge: 0 - Get Data (1)

• Download

Process from the http://rcomm2012.org live data mining challenge. The task was to partially solve a Sudoku puzzle by solving three subtasks. Processes 1-3 in this pack are the solutions to the actual tasks, process 0 loads the required data into your repository and process 4 is the bonus that solves the entire puzzle. This process loads the two required data sets from rapid-i.com and stores them in your repository. The first data set contains the numbers 1 to 9 and the second contains the pr...

Created: 2012-09-04

RCOMM 2011 Challenge 3: RapidDraw (1)

• Download

This is a solution for Challenge 3 of the a live data mining process design competition "Who Wants to be a Data Miner" held at RCOMM 2011 in Dublin. The task was to generate a dataset that looks like a spiral when viewed in an appropriate plotter. This process opens a file with three initial data points and subsequently adds more points to the data set in a loop, using macros to extract data values of the predecessors and a "Generate Attributes" operator to add new data points. To view the...

Created: 2011-11-02

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 2011 Challenge 1: Hobbit Genealogy (1)

• Download

This is a solution for Challenge 1 of the a live data mining process design competition "Who Wants to be a Data Miner" held at RCOMM 2011 in Dublin. As you certainly know, Balbo Baggins is the common ancestor of Balbo and Frodo Baggins. The file opened by the operator "Open Ancestor" contains a table with details about parentship in the Baggins family (insert a breakpoint after read CSV). Each example contains a parent and a child. Of course, the same parent can be contai...

Created: 2011-11-02 | Last updated: 2011-11-02

View Download

RapidAnalytics Video Series Demo Processes

Created: 2011-11-02 15:02:21 | Last updated: 2011-11-02 18:00:41

3 items in this pack

Comments: 0 | Viewed: 152 times | Downloaded: 73 times

POSTing CSV file to RapidAnalytics Web ser... (1)

• Download

This is the second demo process used in the RapidAnalytics video on creating Web services. This process is the actual scoring process and used the model generated by the first process. The first input must be a CSV blob in the repository. Once the process is exposed as a Web service in RapidAnalytics, this input will be replaced by the body of the HTTP POST request.

Created: 2011-11-02 | Last updated: 2011-11-02

POSTing CSV file to RapidAnalytics Web ser... (1)

• Download

This is the first demo used in the RapidAnalytics video on creating Web services. It downloads three data sets provided by data.gov.uk and generates a regression model and stores it as "RegressionTree" in the repository.

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

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