Search icon
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
KNIME Essentials

You're reading from  KNIME Essentials

Product type Book
Published in Oct 2013
Publisher Packt
ISBN-13 9781849699211
Pages 148 pages
Edition 1st Edition
Languages
Author (1):
Gábor Bakos Gábor Bakos
Profile icon Gábor Bakos

Distance matrix


The distance matrix is used not just for visualization, but for learning algorithms too. You can think of them as a column of collections, where each cell contains the difference between the previous rows.

The supported distance functions are the following:

  • Real distances

    • Euclidean()
    • Manhattan ()
    • Cosine ()
  • Bitvector distances

    • Tanimoto ()
    • Dice ()
    • Bitvector cosine ()
  • Distance vector (assuming you already have a distance vector, you can transform it to a distance matrix when there are row order changes or filtering)

  • Molecule distances (from extensions)

The distance matrix feature can be used together with the hierarchical clustering, which also provides a node to view it; this is the main reason we introduced them in this chapter.

You can generate distances using the Distance Matrix Calculate node (just select the function, the numeric columns, and set the name. The chunk size is just for fine tuning larger tables), but you can also load that information with the Distance Matrix...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime}