Select the correct order of the DBSCAN algorithm.
I. Recursively find all density-connected points and assign them to the same cluster as the core point.
II. Find all neighbour points within eps and identify the core points with more than MinPts neighbours.
III. Iterate through the remaining unvisited points in the dataset.
IV. For each core point, if it is not already assigned to a cluster, create a new cluster.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. II, IV, I, III
Explanation
Find core points → start a cluster for an unassigned core → expand it through density-connected points → move on to the remaining unvisited points.More Database Management Systems questions
- Which relational algebra query computes the sids of sailors with age over 20 who have not reserved a red boat?
- Which query/queries compute the names of sailors who have reserved a red boat? Q1: πsname((σcolor='red' Boats) ⋈ Reserves ⋈ Sailors) Q2: πs…
- Which query/queries compute the names of sailors who have reserved boat 103? Q1: πsname((σbid=103 Boats) ⋈ Sailors) Q2: πsname(σbid=103(Res…
- Which query computes the names of sailors who have reserved all boats?
- Which query computes the names of sailors who have reserved a red and a green boat?
- Let R(ABCDEFGH) be a relation schema and F = {A → B, ABCD → E, EF → G, EF → H, ACDF → EG} the set of dependencies. The minimal cover of F is