Question-15

For a clustering problem with \(n\) data-points and \(k\) clusters, what is the maximum number of cluster assignments possible?

• \(k^n\)

• \(n^k\)

• \(nk\)

• \(n + k\)

Hint

Answer

• \(k^n\)

• \(n^k\)

• \(nk\)

• \(n + k\)

Solution

Each data-point can belong to one of the \(k\) clusters. Therefore, we have:

\[ k \times \cdots \times k = k^{n} \]