Skip to content

clustering - Kmeans, Agglomerative, and DBSCAN #147

@ivywze

Description

@ivywze

Troubleshooting

Describe basic

  • Which chapter of book?: Ch 17

Describe your question

For a data set with 100 records, for all K value in 1<= K <= 100, the K-means clustering algorithm returns only one non-empty cluster. Incremental version of K-means returns exact same result. How is this possible?

And would single link and DBSCAN handle such data?

Describe the efforts you have spent on this issue

For each data points with same distance to all other points clearly doesn’t work here. Besides all data points with no distance (100 of them at exact one position), is there any other possibilities?

Have you Google/ Stackover flow anything?

Nothing found.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions