question b1 only IN STEP 1 GIVE THE INTRODUCTION OF THE CONCEPT AND GIVE ANSWER FOR EACH PART OF THE QUESTION IN EACH DIFFERENT STEP WITH CLEAR EXPLANATION AND IN THE FINAL STEP GIVE THE WHOLE FINAL ANSWER IN JUST VERY FEW SENTENCES AND MOREOVER I NEED COMPLETE AND CLEAR ANSWER at last explain what we did in each step in just few sentencesAgninst the built decision tree snd mngom forest classifies. Problem B (Practice only. No submission required): Solve al the questions using Python. Use Pandas, Seabom, Sklear, etc. libraries for all the analysis. Consider the data already given in CSV file HW4_DataA and data description is given in Table 1 Do the following tasks (in exact sequence): B-1. Discuss in concise words the difference between each of the following: ) Good clustering and bad clustering b) Internal clustering measures and external clustering measures B-2. What does it mean to say that the Silhouette score is -1 or close to -17 B-3. Read and display the data given in HW4_DataA. Refer to Table-1 for the data description. Display the unique values for the categorical columns. Drop the SdID and Concentration (the ground truth) columns from the Data and store the modified data frame with the name newDF. B~4. Draw the dendrogram for the data in newDF. How many clusters can you identify? B-5. Execute the K-means and the Agglomerative clustering algorithms (from scikit-leam) considering the following: a) Use the first 120 records of the data for fitting and the remaining for testing b) Fit each clustering algorithm on the training data for values of k between 2 to 8 (inclusive) and plot the internal and external measures for each value of K. ©) Report the performance of the two algorithms on the testing data for k=4. Use both the internal sad external clustering sasssumen
Question:
question b1 only
IN STEP 1 GIVE THE INTRODUCTION OF THE CONCEPT AND GIVE ANSWER FOR EACH PART OF THE QUESTION IN EACH DIFFERENT STEP WITH CLEAR EXPLANATION AND IN THE FINAL STEP GIVE THE WHOLE FINAL ANSWER IN JUST VERY FEW SENTENCES AND MOREOVER I NEED COMPLETE AND CLEAR ANSWER
at last explain what we did in each step in just few sentences
Agninst the built decision tree snd mngom forest classifies.
Problem B (Practice only. No submission required): Solve al the questions using Python. Use Pandas,
Seabom, Sklear, etc. libraries for all the analysis. Consider the data already given in CSV file
HW4_DataA and data description is given in Table 1
Do the following tasks (in exact sequence):
B-1. Discuss in concise words the difference between each of the following:
) Good clustering and bad clustering
b) Internal clustering measures and external clustering measures
B-2. What does it mean to say that the Silhouette score is -1 or close to -17
B-3. Read and display the data given in HW4_DataA. Refer to Table-1 for the data description. Display
the unique values for the categorical columns. Drop the SdID and Concentration (the ground truth)
columns from the Data and store the modified data frame with the name newDF.
B~4. Draw the dendrogram for the data in newDF. How many clusters can you identify?
B-5. Execute the K-means and the Agglomerative clustering algorithms (from scikit-leam) considering
the following:
a) Use the first 120 records of the data for fitting and the remaining for testing
b) Fit each clustering algorithm on the training data for values of k between 2 to 8 (inclusive) and
plot the internal and external measures for each value of K.
©) Report the performance of the two algorithms on the testing data for k=4. Use both the internal
sad external clustering sasssumen
Asked by: Test User 100081
Created at: 2025-05-08 14:01:31
Final Answer:
📢 Instructions:
- Ask anything relatd to above question only.
- For new Question goto :
VIPSolutions