Quiz collegato alla guida · Medio Livello
Quiz sulla riduzione della dimensionalità
Esamina la copertura ad alta dimensione, la varianza PCA e le proiezioni lineari, le mappe dei quartieri, gli obiettivi di compressione, i grafici UMAP, la centratura e i limiti di densità.
Domanda 1 di 8
Which data-coverage challenge is associated with increasing dimension in the curse of dimensionality?
Anteprima di ogni domanda8 domande
Le risposte e le spiegazioni vengono visualizzate mentre rispondi al quiz.
- 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
- Perché la PCA è chiamata metodo "lineare"?
- Funziona solo su dati tracciati come linee rette
- Può solo ridurre i dati esattamente a una dimensione
- Richiede che i dati vengano prima ordinati
- Combina caratteristiche utilizzando somme ponderate (combinazioni lineari)
- 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