Kedis ku xidhan hagaha · Dhexdhexaad Heerka
Kediska Dhimista cabbirka
Dib u eeg daboolida cabbirka sare, kala duwanaanshaha PCA-ga iyo saadaasha toosan, khariidadaha xaafadaha, yoolalka isku dhafka ah, garaafyada UMAP, udub dhexaadka, iyo xaddidaadaha cufnaanta.
Su'aal 1 ee 8
Which data-coverage challenge is associated with increasing dimension in the curse of dimensionality?
Horudhac su'aal kasta8 su'aalo
Jawaabaha iyo sharraxaadaha waxay soo baxayaan markaad qaadanayso kediska.
- Which data-coverage challenge is associated with increasing dimension in the curse of dimensionality?
- Every added coordinate necessarily improves every model
- All high-dimensional distances are identical by definition
- A much larger space can require many more observations to cover densely
- Every model becomes faster without changing its computation
- Which directions does PCA prioritize when selecting principal components of centered input data?
- Directions guaranteed to have the greatest target-label accuracy
- Directions of high input variance
- Directions chosen only from column names
- Directions of minimum variance in every setup
- Waa maxay sababta PCA-ga loogu yeero habka 'linear'?
- Waxa kaliya oo ay ku shaqeysaa xogta loo qoondeeyay sida khadadka toosan
- Waxay u yarayn kartaa xogta hal cabbir oo keliya
- Waxay u baahan tahay in xogta la kala saaro marka hore
- Waxay isku daraysaa sifooyin iyadoo adeegsanaysa wadaryo miisaan leh (isku-dar toosan)
- Which aspect of data do t-SNE and UMAP commonly emphasize in exploratory low-dimensional embeddings?
- Neighborhood relationships
- A guarantee of all original pairwise distances
- An exact encryption of every input file
- A proof that every visible group is a true category
- Why might a team evaluate a smaller representation before fitting a downstream model?
- To guarantee that no useful information is ever lost
- To compare computational cost and predictive behavior with fewer coordinates
- To eliminate the need for held-out evaluation
- To prove that every discarded component is noise
- Which structure does UMAP use when constructing its representation of nearby input observations?
- A required list of supervised document labels
- A file-format encryption key
- A neighborhood graph
- A guarantee that all cluster densities are preserved
- By default, how does the stated scikit-learn PCA transformation preprocess feature means and scales?
- It centers features but does not scale each to unit variance
- It both centers and scales every feature to unit variance automatically
- It scales each feature to unit variance but leaves its mean unchanged
- It divides every feature by its range without centering
- Why should visual compactness in an ordinary UMAP plot not be treated as proof of original-space cluster density?
- UMAP guarantees exact preservation of every original density ratio
- Plot compactness is automatically calibrated to population frequency
- The projection preserves every original pairwise distance exactly
- UMAP does not reliably preserve density in its ordinary embedding