Machine Learning | DBSCAN

Density-based spatial clustering of applications with noise (DBSCAN) is a well-known data clustering algorithm that is commonly used in data mining and machine learning. #MachineLearning #DBSCAN
Implementation: github.com/ranjiGT/dbscan-met...
Machine Learning 👉 • Machine Learning
Artificial Intelligence 👉 • Artificial Intelligenc...
Cloud Computing 👉 • Cloud Computing Tutorials
Wireless Technology 👉 • Wireless Technology Tu...
Data Mining 👉 • Data Mining & Business...
Simulation Modeling 👉 • Simulation Modeling Tu...
Big Data 👉 • Big Data Anaytics
Blockchain 👉 • Blockchain Technology
IOT 👉 • Internet Of Things
Follow me on Instagram 👉 / ngnieredteacher
Visit my Profile 👉 / reng99
Support my work on Patreon 👉 / ranjiraj

[@RanjiRaj18]

For notes👉 github.com/ranjiGT/ML-latex-amendments

[@AmitVerma-yg8pp]

Thank you for the great explanation. You explained DBSCAN very well, and I got it in one go.

[@heavendiver9598]

Nice! finally a example on DBSCAN

[@sahilgarg7284]

The cross table was very helpful! Thanks! 😊

[@lastency]

u saved my life, my lecture slides has no shit on example for DBSCAN

[@matbasica]

That's great. You help me a lot !!!

[@2minutesawareness276]

Thank You for such an educative video.

[@amritajoshi8729]

can you please tell us which book you prefer in machine learning.

[@nawshinmannanproma9421]

how can i apply pca before dbscan clustering?

[@akashpb4179]

Prof se kafi accha samjhaya atleast .. Thanks!!!

[@nageshsundar8766]

Thank you,very nice explanation

[@sibamarcel9428]

Thanks a lot. you help me too much

[@elt1zygaming192]

Is DB Scan use for Prediction?

[@kulakburunbox]

thank you so much!!!1

[@hananxh]

thank you soo much

[@venugopalkunapareddy6857]

Great Explanation !

[@mianaliasjad]

When you are marking a point as border point what condition you consider? Its distance from the core point < ε OR

[@RanjiRaj18]

Lesser than epsilon

[@Twilight2595]

@@RanjiRaj18 i dont understand... ε is 1.5, u marked C as border point on the basis that C-E was 1.4...is that so?

[@kaushalendrakumar5166]

@@Twilight2595 Also one condition about the min point coming under the circle drawn from C as centre, it is less than minimum point condition

[@pujabhakta8408]

I have send a graph pic how it possible plz reply that graph i can not solve clustering problem

[@subarnodey9114]

Sir after this course pls make videos on data scince..

[@aditiiyer5398]

how did you take C as border point and by what means??? is it because E and C both have 1.4?

[@RanjiRaj18]

Since C lies in the neighbourhood of E (

[@aditiiyer5398]

Thankyou

[@Krishnapriyabilakanti]

Sir will they give us that table!? Or do we need to construct that?

[@saadmann3366]

The explanation is very nice. Why do we want to travel from one cluster to another? Or why we try to connect them/ reach them ?

[@RanjiRaj18]

To make sure similar points within the same cluster are accessible.

[@saadmann3366]

Yeah makes sense. Thank you for your reply.

[@Prajwal_KV]

@RANJI RAJ Sir,can you tell me how to choose the min value and epsilon value?

[@RanjiRaj18]

Great question, but cannot give a satisfying answer though, because both these are hyper parameters and decided based upon the application where you want to apply DBSCAN.

[@Prajwal_KV]

@@RanjiRaj18 Thank you for the instant response sir

[@YoussefAhmed-uv7ti]

If p belongs to q epsilon Neighborhood.. then q also belongs to the p epsilon Neighborhood.. hence p now is a border point because of it has q which is a core point so what is the difference between a border point and a directly density reachable noisy point? and thank you

[@kaushalendrakumar5166]

directly density reachable point would be never a noisy point. A noisy point will be away from a core point altogether. It might belong to the neighborhood of a boundary/border point thus it can be just density reachable point

[@Raja-tt4ll]

Nice Video

[@mennagamea4634]

why did we count the distance from the point to itself when we want to decide whether it's core or not? I think we should not do this and count only the other neighbour?

[@kaushalendrakumar5166]

Well it a density based algorithm so you need to see how much points are present in a given space so you also need to include the centre as well since it is part of that space too

[@adinathkankekar62]

how to plot multiple points in dbscan
?

[@RanjiRaj18]

Use R- statistical tool

[@mohammed.dawood_]

👍🏻

[@lapujain]

Your explaination is good but you cover the whole white board while explaining and that makes it really hard to interpret what you are saying.

[@saikiran-ws2oc]

No clarity brother

[@RanjiRaj18]

Try changing the resolution of the video while watching

[@mohammadmujtabaakhtar5814]

bhai sahab kaahe ratta maar kar padh rahe ho..... chhhatro kaaa jevan barbaad sankat mein hai