[amp_mcq option1=”in distance calculation it will give the same weights for all features” option2=”you always get the same clusters. if you use or dont use feature scaling” option3=”in manhattan distance it is an important step but in euclidian it is not” option4=”none of these” correct=”option1″]<\/p>\n
The correct answer is: A. in distance calculation it will give the same weights for all features<\/strong>.<\/p>\n Feature scaling is the process of normalizing the features of a dataset so that they have a similar scale. This is done by subtracting the mean of each feature and then dividing by the standard deviation of each feature.<\/p>\n The reason why feature scaling is important is because the K-means algorithm works by finding clusters of data points that are close to each other. If the features are not scaled, then the algorithm will be biased towards features that have a large range of values. This is because the distance between two data points will be larger if the features have a large range of values.<\/p>\n By scaling the features, we can ensure that the algorithm is not biased towards any particular feature. This will result in more accurate clusters.<\/p>\n Here is a brief explanation of each option:<\/p>\n [amp_mcq option1=”in distance calculation it will give the same weights for all features” option2=”you always get the same clusters. if you use or dont use feature scaling” option3=”in manhattan distance it is an important step but in euclidian it is not” option4=”none of these” correct=”option1″]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[729],"tags":[],"class_list":["post-46323","post","type-post","status-publish","format-standard","hentry","category-machine-learning","no-featured-image-padding"],"yoast_head":"\n\n