Answer the following in the context of the Adaboost algorith…

Answer the following in the context of the Adaboost algorithm. (No formulas, only language description). (a) (4) Which points are given higher/lower weights after learning each weak-classifier?   (b) (4) How is the weight for each data point used by the algorithm?   (c) (4) How do we assign weights to weak classifiers for their contribution to the global decision?

Consider the following three data vectors. D1: (4, 6, 7, 9),…

Consider the following three data vectors. D1: (4, 6, 7, 9), D2:(6, 9, 10, 14), and D3: (4, 6, 2, 1). (a) (3) What are the Manhattan distances for the data-point pairs: D1-D2: D1-D3: D2-D3: (b) (5) What are the cosine similarities for the data-point pairs: D1-D2: D1-D3: D2-D3: (c) (2) Which two pints are the closest as per the Manhattan distance?   (d) (2) Which two points are the closest as per the Cosine similarity?