Icon

JKISeasor2-29_​tomljh_​ver2

There has been no title set for this workflow's metadata.

Challenge 29: Table Tennis Tournament

Challenge 29: Table Tennis TournamentLevel: MediumDescription: You work for a Berlin startup and it's Friday night. A table tennis tournamentwith your colleagues is due! The following problem comes up: how to randomly split allyour co-workers in random teams of two players, and then randomly define the directelimination matches as a dendrogram? Hint: You can use the Hierarchical ClusterAssigner in this challenge.Author: Paolo Tamagnini 挑战29：乒乓球比赛水平： 中等描述：你在柏林的一家创业公司工作，现在是星期五晚上。与您的同事一起举办乒乓球比赛！出现了以下问题：如何将所有同事随机分成两个玩家的随机团队，然后将直接淘汰赛随机定义为树状图？提示：您可以在此质询中使用分层集群分配器。作者： Paolo Tamagnini Methd 1: using 'Score' as the distance Methd 2:Use 'counter' as the distance Note: 'counter' is a set of sequential numbers that are uniformdistribution. Read DataUsing Euclidean distanceShuffle Row1.Using Euclidean distance2.Use 'counter' as the distanceShow match mapsSet the number of clusters = 20 teams / 2 =10Refers to the table of the first round of matches,the same category represents a competition. CSV Reader Distance MatrixCalculate Hierarchical Clustering(DistMatrix) HierarchicalCluster View Shuffle Counter Generation Distance MatrixCalculate Hierarchical Clustering(DistMatrix) HierarchicalCluster View RowID HierarchicalCluster Assigner Challenge 29: Table Tennis TournamentLevel: MediumDescription: You work for a Berlin startup and it's Friday night. A table tennis tournamentwith your colleagues is due! The following problem comes up: how to randomly split allyour co-workers in random teams of two players, and then randomly define the directelimination matches as a dendrogram? Hint: You can use the Hierarchical ClusterAssigner in this challenge.Author: Paolo Tamagnini 挑战29：乒乓球比赛水平： 中等描述：你在柏林的一家创业公司工作，现在是星期五晚上。与您的同事一起举办乒乓球比赛！出现了以下问题：如何将所有同事随机分成两个玩家的随机团队，然后将直接淘汰赛随机定义为树状图？提示：您可以在此质询中使用分层集群分配器。作者： Paolo Tamagnini Methd 1: using 'Score' as the distance Methd 2:Use 'counter' as the distance Note: 'counter' is a set of sequential numbers that are uniformdistribution. Read DataUsing Euclidean distanceShuffle Row1.Using Euclidean distance2.Use 'counter' as the distanceShow match mapsSet the number of clusters = 20 teams / 2 =10Refers to the table of the first round of matches,the same category represents a competition. CSV Reader Distance MatrixCalculate Hierarchical Clustering(DistMatrix) HierarchicalCluster View Shuffle Counter Generation Distance MatrixCalculate Hierarchical Clustering(DistMatrix) HierarchicalCluster View RowID HierarchicalCluster Assigner

Nodes

Extensions

Links

Download

To use this workflow in KNIME, download it from the below URL and open it in KNIME:

Download Workflow
Created by: Admin
Created at: 2023-10-11
On NodePit since: 2023-10-13
Last update: 2024-04-26
Created with KNIME version: v5.1.1
Tags: JKISeason2-29

Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.

Try NodePit Runner!