Kvíz spojený s průvodcem · Střední úroveň
DBSCAN Clustering Quiz
Rozlišujte jádro DBSCAN, hraniční a šumové body a zhodnoťte, jak výsledky epsilon, minimální vzorky, vzdálenost a tvar měřítka.
Otázka 1 z 8
Co podle konvence scikit-learn kvalifikuje bod jako hlavní bod?
Náhled každé otázky8 otázky
Odpovědi a vysvětlení se zobrazují, jak budete v kvízu.
- Co podle konvence scikit-learn kvalifikuje bod jako hlavní bod?
- Its epsilon neighborhood contains at least min_samples, including itself
- It is the closest point to a centroid
- It has no neighbors within epsilon
- It lies outside every dense region
- Jak může hraniční bod patřit do shluku, aniž by byl jádrem?
- It has more neighbors than every core point
- It is reachable from a core point but lacks enough neighbors itself
- It is assigned to the nearest centroid
- It has a zero distance to every sample
- Co znamená označení šumu DBSCAN?
- The point cannot belong to a cluster under any settings
- The record is definitely erroneous
- The point was not assigned under the chosen metric and parameters
- The prediction probability is zero
- Co se může stát, když je epsilon nastaven příliš velký?
- A too-large radius can split one connected dense region into separate groups
- Increasing the radius can make previously core points non-core
- Epsilon no longer affects which observations are neighbors
- Nearby dense groups may merge
- Proč mohou nekonzistentní jednotky funkcí zkreslovat výsledky DBSCAN?
- They change the number of neighbors required for a point to be core
- A large-scale feature can dominate distance calculations
- They make epsilon independent of measurement units
- They affect cluster labels only after the neighborhood graph is fixed
- A compact cluster is found while a diffuse group becomes noise under one epsilon. What limitation is illustrated?
- Core points cannot connect
- DBSCAN requires a predetermined cluster count
- One global density threshold may not suit clusters with different densities
- The metric no longer affects neighborhoods
- How does DBSCAN differ from k-means regarding cluster count?
- Both require a count known from labels
- DBSCAN always creates exactly two clusters
- K-means selects arbitrary-shaped regions without centroids
- DBSCAN does not require the number of clusters as an input
- Why is assigning future points to DBSCAN clusters not automatic in the basic procedure?
- The method clusters the fitted sample and has no inherent new-point rule in its basic form
- New points are assigned to the nearest cluster centroid by definition
- The noise label is a calibrated probability that a point is an outlier
- Every new point is assigned to the most common existing cluster