ch
Feedback
Data Science & Machine Learning

Data Science & Machine Learning

前往频道在 Telegram

The first channel on Telegram that offers exciting questions, answers, and tests in data science, artificial intelligence, machine learning, and programming languages. For promotions: @love_data

显示更多

📈 Telegram 频道 Data Science & Machine Learning 的分析概览

频道 Data Science & Machine Learning (@datascienceinterviews) 英语 语言赛道中的 是活跃参与者。目前社区聚集了 27 265 名订阅者,在 教育 类别中位列第 7 190,并在 印度 地区排名第 15 948

📊 受众指标与增长动态

невідомо 创建以来,项目保持高速增长,吸引了 27 265 名订阅者。

根据 14 六月, 2026 的最新数据,频道保持稳定运转。过去 30 天订阅人数变化为 142,过去 24 小时变化为 10,整体触达仍然可观。

  • 认证状态: 未认证
  • 互动率 (ER): 平均受众互动率为 0.56%。内容发布后 24 小时内通常能获得 0.53% 的反应,占订阅者总量。
  • 帖子覆盖: 每篇帖子平均可获得 152 次浏览,首日通常累积 144 次浏览。
  • 互动与反馈: 受众积极参与,单帖平均反应数为 1
  • 主题关注点: 内容集中在 insidead, mining, pinix, learning, neo 等核心主题上。

📝 描述与内容策略

作者将该频道定位为表达主观观点的平台:
The first channel on Telegram that offers exciting questions, answers, and tests in data science, artificial intelligence, machine learning, and programming languages. For promotions: @love_data

凭借高频更新(最新数据采集于 15 六月, 2026),频道始终保持新鲜度与高覆盖。分析显示受众积极互动,使其成为 教育 类别中的关键影响点。

27 265
订阅者
+1024 小时
+407
+14230
帖子存档
Q.   How can outlier values be treated? A.  An outlier is an observation in a dataset that differs significantly from the rest of the data. This signifies that an outlier is much larger or smaller than the rest of the data. Given are some of the methods of treating the outliers: Trimming or removing the outlier, Quantile based flooring and capping, Mean/Median imputation. Q.   What is root cause analysis? A.  A root cause is a component that contributed to a nonconformance and should be eradicated permanently through process improvement. The root cause is the most fundamental problem—the most fundamental reason—that puts in motion the entire cause-and-effect chain that leads to the problem (s). Root cause analysis (RCA) is a word that refers to a variety of approaches, tools, and procedures used to identify the root causes of problems. Some RCA approaches are more directed toward uncovering actual root causes than others, while others are more general problem-solving procedures, and yet others just provide support for the root cause analysis core activity. Q.  What is bias and variance in Data Science? A.  The model's simplifying assumptions simplify the target function, making it easier to estimate. Bias is the difference between the Predicted Value and the Expected Value in its most basic form. Variance refers to how much the target function's estimate will fluctuate as a result of varied training data. In contrast to bias, variance occurs when the model takes into account the data's fluctuations, or noise. Q.  What is a confusion matrix? A.   A confusion matrix is a method of summarising a classification algorithm's performance. Calculating a confusion matrix can help you understand what your classification model is getting right and where it is going wrong. This gives us the following: "True positive" for event values that were successfully predicted. "False positive" for event values that were mistakenly predicted. For successfully anticipated no-event values, "true negative" is used. "False negative" for no-event values that were mistakenly predicted.

Data Science Interview Questions.pdf2.36 MB

Data scientists spend 80% of their time working on the data. Books spend 80% of their time talking about algorithms. Today, there's a large gap between academia and reality. Between what they say is important, and what really is. Better data is better than better models.

1. How Are Weights Initialized in a Neural network? Ans: There are two methods here: we can either initialize the weights to zero or assign them randomly. Initializing all weights to 0: This makes your model similar to a linear model. All the neurons and every layer perform the same operation, giving the same output and making the deep net useless. Initializing all weights randomly: Here, the weights are assigned randomly by initializing them very close to 0. It gives better accuracy to the model since every neuron performs different computations. This is the most commonly used method. 2. What are the variants of Gradient descent? Ans: Stochastic Gradient Descent: We use only a single training example for calculation of gradient and update parameters. Batch Gradient Descent: We calculate the gradient for the whole dataset and perform the update at each iteration. Mini-batch Gradient Descent: It’s one of the most popular optimization algorithms. It’s a variant of Stochastic Gradient Descent and here instead of single training example, mini-batch of samples is used. 3. What are the feature selection methods used to select the right variables? Ans: There are two main methods for feature selection: Filter Methods This involves: • Linear discrimination analysis • ANOVA • Chi-Square The best analogy for selecting features is "bad data in, bad answer out." When we're limiting or selecting the features, it's all about selecting the useful feature. Wrapper Methods This involves: • Forward Selection: We test one feature at a time and keep adding them until we get a good fit • Backward Selection: We test all the features and start removing them to see what works better • Recursive Feature Elimination: Recursively looks through all the different features and how they pair together. Wrapper methods are very labor-intensive, and high-end computers are needed if a lot of data analysis is performed with the wrapper method. 4.  What is joint sampling and separate sampling? Ans: · Joint sampling is done when there are equal number of events and non-events. Not appropriate for imbalanced data · Separate sampling is done for imbalanced data. For rare event, all observations are kept when target = 1 and only few observations are kept when target = 0.

26. Big Data and Spark with Python.zip223.77 MB

25. Neural Nets and Deep Learning - Part 04.zip143.03 MB

25. Neural Nets and Deep Learning - Part 03.zip561.97 MB

25. Neural Nets and Deep Learning - Part 02.zip578.69 MB

25. Neural Nets and Deep Learning - Part 01.zip574.62 MB

24. Natural Language Processing.zip154.40 MB

23. Recommender Systems.zip64.58 MB

22. Principal Component Analysis.zip41.72 MB

21. K Means Clustering.zip82.38 MB

20. Support Vector Machines.zip80.98 MB

19. Decision Trees and Random Forests.zip106.22 MB

18. K Nearest Neighbors.zip99.89 MB

17. Logistic Regression.zip124.29 MB

16. Cross Validation and Bias-Variance Trade-Off.zip10.26 MB

15. Linear Regression.zip105.10 MB

14. Introduction to Machine Learning.zip166.80 MB