Hello Sir - excellent explanation of DBSCAN you have presented here, including computer science concepts of computational complexity, *thank you*. I am really looking forward to your next lecture on DBSCAN parameter control for Epsilon and MinPoints; because that is an important area for DBSCAN performance and effectivenesss, as you note (and there is relatively little information available on this!).
@c.v.shankarshankar87745 жыл бұрын
Thanks sir. It's quite simple but very effective explanation.
@hARRYnhariprasathnallasamy5 жыл бұрын
neatly explained sir! thanks
@rodguinea5 жыл бұрын
This video is great! Thanks
@pred99904 жыл бұрын
much more understandable and structured than indian guys explanation)
@PandemicGameplay5 жыл бұрын
Nice explanation
@psychorameses5 жыл бұрын
Based on this explanation, what's the difference between density-reachable and density-connected? Density-connected is defined as a point o such that both p and q are density-reachable from o, which means there exists two chains of points p1, p2, ..., o and o, ..., q2, q1 that are both fully directly density-reachable, which means p1, p2, ..., o, ..., q2, q1 is also a fully directly density reachable chain. Wouldn't this mean density-connected is essentially the same as density-reachable? Something's off here.
@MachineLearningTV5 жыл бұрын
Dear friend, the definition of the point type in DBSCAN is a little confusing. Search in Google and you Will find good texts that complement this video. I also suggest you to watch part 2 of this video.