Q3 - Info Vis

The ___ is a simple algorithm that splits the data into nodes by class purity (information gain for categorical and MSE for numeric target variable).

• Tree

• Binary Tree

• Tree Viewer

• Random Forest

The ___ is an ensemble learning method used for classification, regression and other tasks.

• Random Forest

• Tree

• Tree Viewer

• Predictions

This is a versatile widget with 2-D visualization of classification and regression trees. The user can select a node, instructing the widget to output the data associated with the node, thus enabling explorative data analysis.

• Tree Viewer

• Tree

• Random Forest

• Pivot Table

The __ are plane fractals that can be used to depict general tree hierarchies

• Pythagorean Tree

• Pythagorean Forest

• Tree

• Tree Viewer

PCA transforms the data into a dataset with uncorrelated variables. What is PCA?

• Principal Component Analysis

• Principal Common Analysis

• Previous Component Analysis

• Previous Correlated Analysis

The widget computes ___ of arbitrary types of objects from a matrix of distances and shows a corresponding dendrogram. Distances can be computed with the Distances widget

• Hierarchal Clustering

• Clustering

• Subgrouping

• Ranking

It computes the distance between the closest elements of the two clusters

• Single Linkage

• Average Linkage

• Weighted Linkage

• Complete Linkgage

It computes the average distance between elements of the two clusters

• Average Linkage

• Single Linkage

• Ward Linkage

• Weighted Linkage

It computes the distance between the clusters' most distant elements

• Complete Linkage

• Single Linkage

• Average Linkage

• Ward Linkage

Hierarchical Clustering requires distance matrix on the input. We compute it with Distances, where we use the ___ distance metric.

• Euclidean

• Manhattan

• Spearman

• Pearson