Answer / Abhishek Kumar Verma

Pseudocode for k-Nearest Neighbors (k-NN) algorithm: n1. Input training data set X and labels Y.n2. Input test data set X_test.n3. For each point in X_test:n a. Calculate distances between the point and all points in X.n b. Find k nearest neighbors.n c. Majority vote from k neighbors to predict the label.

Which language is best for deep learning?

1 Answers  

---

How will you know which machine learning algorithm to choose for your classification problem?

1 Answers  

---

Which library would you prefer for plotting in Python language: Seaborn or Matplotlib or Bokeh?

1 Answers  

---

Give me an examples of nosql architecture?

1 Answers  

---

What is batch size machine learning?

1 Answers  

---

Explain the steps in making a decision tree.

1 Answers  

---

Do you know what's the “kernel trick” and how is it useful?

1 Answers  

---

What is ensemble learning?

1 Answers  

---

Tell us when will you use classification over regression?

1 Answers  

---

Explain the Algorithm of Probabilistic networks in Machine Learning?

1 Answers  

---

What is a bayesian model?

1 Answers  

---

If a highly positively skewed variable has missing values and we replace them with mean, do we underestimate or overestimate the values?

1 Answers  

---