Assuming the node index starts at 1, what is the out-degree of node 3 in the adjacency
Refer to the exhibit.
What are two visualization tools used for trivariate data?
A. Scatter plot matrix
B. Hexbin plot and heatmap
C. Scatter plot matrix and density plot
D. Scatter plot matrix and heatmap
Why would a company decide to use HBase to replace an existing relational database?
A. It is required for performing ad-hoc queries.
B. Varying formats of input data requires columns to be added in real time.
C. The company’s employees are already fluent in SQL.
D. Existing SQL code will run unchanged on HBase.
How does Latent Dinchlet Allocation (LDA) interpret a document?
A. As a single-predefined topic
B. As a mixture of pre-defined topics
C. As having a mixture of sentiments
D. As having a single pre-defined sentiment
Which HDFS feature protects against user errors causing accidental loss of data?
C. Namenode federation
What is an ideal use case for HDFS?
A. Storing files that are updated frequently
B. Storing files that are written once and read many times
C. Storing results between Map steps and Reduce steps
D. Storing application files in memory
What is a property of a good color model for ordinal data?
A. Uses a rainbow-like color map for distinction of categories
B. Uses a rainbow-like color map for ease of display and printing
C. Uses perceptually ordinal colors with just-noticeable increments
D. Uses perceptually ordinal colors with linear, perceptual increments
The naive Bayer classifier is trained over 1600 movie reviews and then tested over 400 reviews.
Here is the resulting confusion matrix:
190 (TP) 10(FN)
80 (FP) 120(TN)
What are the precision, recall, and the F1-score values?
A. Precision0.95; Recall: 0704; F1-score: 0.809
B. Precision 0.613, Recall: 0.95, F1-score: 0.745
C. Precision 0.704, Recall: 0.95; F1-score: 0.809
D. Precision 0.95; Recall: 0.613; F1-score: 0.745
Which metric would be most helpful in identifying a node that may cause network disruption if the node were removed?
In a connected, undirected graph of 5 nodes with 10 edges, how many more edges need to be added to make the clustering coefficient of every node equal 1?