Dear all, I would like to ask you a question: How can we represent a cluster in density-based algorithms? In other words, in prototype-based algorithms the clusters represent by centroids and number of data points, in model-based represent by centroids and variance, in grid-based represent by length, height, and a number of data points in each grid. So, what about the density-based algorithms, how would we represent the summary of clusters?
you can keep all the border points of the cluster
https://en.wikipedia.org/wiki/DBSCAN
Dear Vikas,
I would like to thank you for this answer.
Please, I just want to know how to represent the summary of output clusters form density-based algorithms like DBSCAN.
Kind regards
Ammar
Dear Felipe,
I would like to thank you for this answer.
Please, I just want to know how to represent the summary of output clusters form density-based algorithms like DBSCAN.
Kind regards
Ammar
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Algorithms