initial candidates - Hamed

Nikronic / K-MCI

This is an implementation of K-MCI algorithm in python.

Apache License 2.0

4 stars 0 forks source link

initial candidates - Hamed #1

Closed hamed-faraji closed 6 years ago

hamed-faraji commented 6 years ago

Is D fixed?(D is the amount of each cluster )

Nikronic commented 6 years ago

You solved!

hamed-faraji commented 6 years ago

Explanation: D is fixed. For example, in wine dataset D is equal to 13.that mean we have 13 features that must be clustered. If we have 3 cluster so, 13 x 3 = 39 is our candidate's array's length. While dataset has 178 different values.