Workflow-based data analysis with KNIME

Recommended Reading

The point of the exercise is to recommend articles that are closest to the reader's preferences. For example, if the reader is particularly interested in hardware and security, it would be a good idea to suggest articles from these categories – or even articles that are in both categories at the same time. The current workflow has already explored the extent to which a certain reader has a preference for each category, and the result is available in the form of a vector (Figure 5).

You can create a very similar vector for each article, where the columns of those categories contain a 1, to which the article is assigned. Category columns without connection to the article, on the other hand, contain a 0. The One-to-Many node makes this possible: The transformation of the article-heading assignments (Table 2) into a representation by a binary vector per article (Figure 10).

Table 2

Categories Table

Article ID


Article 11


Article 11


Article 31


Figure 10: Output table of the one-to-many node.

Once the two vector types have been created, the Similarity Search node can simply determine a distance between the vector of a reader (which represents its preferences) and the vector of an article (which indicates to which columns it is assigned). The smaller the distance, the more the reader's preference corresponds to the categories in which the article is classified.

From all articles that a certain reader has not yet read (see Row Reference Filter node), it is now easy to determine the article that has the shortest distance to the reader's preferences. This article is finally recommended for reading.

A loop (consisting of the Chunk Loop Start and Loop End nodes) corresponds to a For loop across all rows of the table. The loop determines the smallest distance of the vectors for each reader. The overall result with one article recommendation per reader (Figure 11) could then be written back to a database with the help of the Database Writer node.

Figure 11: The content of the meta node for article recommendations.


This article only covers a fraction of the nearly 2,000 nodes available for KNIME. Other exciting KNIME features include flow variables, the Workflow Coach, streaming, nodes for processing texts, and Deep Learning capabilities.

You can get an idea of the KNIME Analytics Platform by downloading and testing the software. Check out the documentation [3] and node guide [4] at the KNIME website for more on working with KNIME, or bring your questions to the KNIME Forum [5].


  1. KNIME:
  2. D3.js framework:
  3. KNIME Documentation:
  4. KNIME Node Guide:
  5. KNIME Forum:

The Author

Alexander Fillbrunn is a PhD student at the Department of Bioinformatics and Information Mining at the University of Konstanz. He is particularly interested in the development of machine learning algorithms.

Martin Horn is a postdoc at the Department of Bioinformatics and Information Mining at the University of Konstanz, where he studies data analysis – of course using KNIME.

Buy Linux Magazine

Get it on Google Play

US / Canada

Get it on Google Play

UK / Australia

Related content


    Iptables gives admins the ability to set up clusters and distribute the load. But what about failover?

  • Getting Started with HPC Clusters

    Starting out in the HPC world requires learning to write parallel applications and learning to administer and manage clusters. We take a look at some ways to get started.

  • Hadoop

    Experience the power of supercomputing and the big data revolution with Apache Hadoop.

  • Samba for Clusters

    Samba Version 3.3 and the CTDB lock manager provide full cluster support.

  • Tutorials – Minetest

    Minetest is much more than a clone of a certain popular proprietary game. It offers infinite customization that allows you to create blocks, objects, fun educational exercises, and even games within the game, dishing up features well beyond those of any other closed source alternative.

comments powered by Disqus

Direct Download

Read full article as PDF:

Price $0.00