DBSCAN ALgorithm

DBSCAN ALgorithm

University

10 Qs

quiz-placeholder

Similar activities

Bayesian Intro UPJNVJ

Bayesian Intro UPJNVJ

University

10 Qs

Comandos de Kali Linux

Comandos de Kali Linux

University

10 Qs

HTML Quiz 1

HTML Quiz 1

University

10 Qs

HTML

HTML

University

15 Qs

typing practise 3

typing practise 3

12th Grade - University

10 Qs

Compiler Design Quiz

Compiler Design Quiz

University

15 Qs

HTML -znaczniki 1

HTML -znaczniki 1

7th Grade - University

15 Qs

ISDS 361A Midterm 1 Review

ISDS 361A Midterm 1 Review

University

14 Qs

DBSCAN ALgorithm

DBSCAN ALgorithm

Assessment

Quiz

Computers

University

Easy

Created by

Rafeeque PC

Used 52+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following statement about DBSCAN algorithm is false?

Can find arbitrarily shaped clusters

No need to specify number of clusters

Robust to outliers

Not sensitive to parameters

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A point is said to be core point if

the ϵ\epsilon neighbourhood of the point contain more than or equal minpts

the \epsilon neighbourhood of the point contain less than minpts

the \epsilon neighbourhood contain less than minpts but is in neighbourhood of a core point

None

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A point is said to be Border point  if

the ϵ\epsilon neighbourhood of the point contain more than or equlal  minpts

the \epsilon neighbourhood of the point contain less than minpts

the \epsilon neighbourhood contain less than minpts but is in neighbourhood of a core point

None

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

Given the the Radius (R) as marked in the figure and the minpts = 6. Then the red point in the figure is a ___________

Core point

Border point

Neither core nor border point

Can't say

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following statement is false?

A point q is directly reachable from p , if q is distance ϵ\epsilon from the core point p

A point q is directly reachable from p , if q is distance \epsilon from any point p

Points are only said to be directly reachable from core points

A point q is reachable from p, if there is a path p1,p2,p3....pn, where p1 = p, pn = q and p(i+1)p_{\left(i+1\right)} directly reachable from pip_i

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following informations are used by OPTICS algorithm to store the cluster ordering

Core distance and Reachability distance

Core distance and Radius

Core distance and Minpts

Reachability distance and Radius

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

From the given figure identify the core distance of point p. Given the value of  ϵ \epsilon^{'\ }  = 3mm

3 mm

6 mm

 dist(p,q1)dist\left(p,q_1\right)  

None

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?