गाइड से जुड़ी प्रश्नोत्तरी · मध्यम स्तर
DBSCAN क्लस्टरिंग प्रश्नोत्तरी
DBSCAN कोर, सीमा और शोर बिंदुओं को अलग करें, और मूल्यांकन करें कि ईपीएसलॉन, न्यूनतम नमूने, दूरी और स्केलिंग आकार कैसे परिणाम देते हैं।
प्रश्न 1 का 8
Under scikit-learn's convention, what qualifies a point as a core point?
प्रत्येक प्रश्न का पूर्वावलोकन करें8 प्रश्न
जैसे ही आप प्रश्नोत्तरी लेते हैं उत्तर और स्पष्टीकरण दिखाई देते हैं।
- Under scikit-learn's convention, what qualifies a point as a core point?
- 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
- How can a border point belong to a cluster without being core?
- 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
- What does a DBSCAN noise label mean?
- 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
- What may happen when epsilon is set too large?
- 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
- Why can inconsistent feature units distort DBSCAN results?
- 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