BDA 2

In a decision tree, each internal node represents a ___________.

The purpose of the ___________ in a decision tree is to classify or predict the target variable.

A decision tree is constructed by recursively partitioning the data based on the ___________ that maximizes information gain or Gini impurity reduction.

The process of selecting the best feature to split the data at each node involves evaluating criteria such as ___________.

K-means is a widely used ______________ algorithm.

K-means partitions data into ______________ clusters.

Each cluster in K-means is represented by its ______________.

The K-means algorithm aims to minimize the ______________.

K-means is commonly employed in ______________ to identify customer segments.

Image compression often utilizes ______________ for reducing file sizes.