Endi mavjud! Telegram Tadqiqoti 2025 — yilning asosiy insaytlari 
Data Science & Machine Learning
Kanalga Telegram’da o‘tish
Join this channel to learn data science, artificial intelligence and machine learning with funny quizzes, interesting projects and amazing resources for free For collaborations: @love_data
Ko'proq ko'rsatish📈 Telegram kanali Data Science & Machine Learning analitikasi
Data Science & Machine Learning (@datasciencefun) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 75 933 obunachidan iborat bo'lib, Taʼlim toifasida 2 103-o'rinni va Hindiston mintaqasida 4 204-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 75 933 obunachiga ega bo‘ldi.
23 Iyun, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni 731 ga, so‘nggi 24 soatda esa 33 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya o‘rtacha 2.95% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.86% ini tashkil etuvchi reaksiyalarni to‘playdi.
- Post qamrovi: Har bir post o‘rtacha 2 239 marta ko‘riladi; birinchi sutkada odatda 650 ta ko‘rish yig‘iladi.
- Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 3 ta reaksiya keladi.
- Tematik yo‘nalishlar: Kontent learning, accuracy, distribution, panda, dataset kabi asosiy mavzularga jamlangan.
📝 Tavsif va kontent siyosati
Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“Join this channel to learn data science, artificial intelligence and machine learning with funny quizzes, interesting projects and amazing resources for free
For collaborations: @love_data”
Yuqori yangilanish chastotasi (oxirgi ma’lumot 24 Iyun, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Taʼlim toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.
75 933
Obunachilar
+3324 soatlar
+587 kunlar
+73130 kunlar
Postlar arxiv
Machine_Learning_with_Python_Cookbook_Practical_Solutions_from_Preprocessing.pdf4.59 MB
HOLD & EARN
We are providing our community a tremendous amount of interest and high value's simply and easily, We are continually evolving to make ourselves better.
We are 4k+ now 😊
All credits to this person for supporting us a lot and being a part of us.
We wish we get his/her support forever.
SHARE AND SUPPORT US❤️
Hands_On_Machine_Learning_with_Scikit_Learn,_Keras,_and_TensorFlow.pdf72.75 MB
Data Science - John D. Kelleher, Brendan Tierney (The MIT Press, 2018)
Python 3 for Machine Learning - Oswald Campesato (Mercury Learning, 2020)
Artificial Intelligence - An Illustrated History - From Medieval Robots to Neural Networks - Clifford A. Pickover (Sterling, 2019)
How to set the learning rate?
There is no straightforward way of finding an optimum learning rate for a model. It involves a lot of hit and trial. Usually starting with a small values such as 0.01 is a good starting point for setting a learning rate and further tweaking it so that it doesn't overshoot or converge too slowly.
What happens when the learning rate is too large? Too small?
A large learning rate can accelerate the training. However, it is possible that we "shoot" too far and miss the minimum of the function that we want to optimize, which will not result in the best solution. On the other hand, training with a small learning rate takes more time but it is possible to find a more precise minimum. The downside can be that the solution is stuck in a local minimum, and the weights won't update even if it is not the best possible global solution.
What’s the learning rate?
The learning rate is an important hyperparameter that controls how quickly the model is adapted to the problem during the training. It can be seen as the "step width" during the parameter updates, i.e. how far the weights are moved into the direction of the minimum of our optimization problem.
How do we use SGD (stochastic gradient descent) for training a neural net?
SGD approximates the expectation with few randomly selected samples (instead of the full data). In comparison to batch gradient descent, we can efficiently approximate the expectation in large data sets using SGD. For neural networks this reduces the training time a lot even considering that it will converge later as the random sampling adds noise to the gradient descent.
Which optimization techniques for training neural nets do you know?
Gradient Descent
Stochastic Gradient Descent
Mini-Batch Gradient Descent(best among gradient descents)
Nesterov Accelerated Gradient
Momentum
Adagrad
AdaDelta
Adam(best one. less time, more efficient)
What is backpropagation? How does it work? Why do we need it?
The Backpropagation algorithm looks for the minimum value of the error function in weight space using a technique called the delta rule or gradient descent. The weights that minimize the error function is then considered to be a solution to the learning problem.
We need backpropogation because,
Calculate the error – How far is your model output from the actual output.
Minimum Error – Check whether the error is minimized or not.
Update the parameters – If the error is huge then, update the parameters (weights and biases). After that again check the error.
Repeat the process until the error becomes minimum.
Model is ready to make a prediction – Once the error becomes minimum, you can feed some inputs to your model and it will produce the output.
What if we set all the weights of a neural network to 0?
If all the weights of a neural network are set to zero, the output of each connection is same (W*x = 0). This means the gradients which are backpropagated to each connection in a layer is same. This means all the connections/weights learn the same thing, and the model never converges.
How we can initialize the weights of a neural network?
Proper initialization of weight matrix in neural network is very necessary. Simply we can say there are two ways for initializtions.
Initializing weights with zeroes. Setting weights to zero makes your network no better than a linear model. It is important to note that setting biases to 0 will not create any troubles as non zero weights take care of breaking the symmetry and even if bias is 0, the values in every neuron are still different.
Initializing weights randomly. Assigning random values to weights is better than just 0 assignment.
a) If weights are initialized with very high values the term np.dot(W,X)+b becomes significantly higher and if an activation function like sigmoid() is applied, the function maps its value near to 1 where the slope of gradient changes slowly and learning takes a lot of time.
b) If weights are initialized with low values it gets mapped to 0, where the case is the same as above. This problem is often referred to as the vanishing gradient.
What is ReLU? How is it better than sigmoid or tanh?
ReLU is an abbreviation for Rectified Linear Unit. It is an activation function which has the value 0 for all negative values and the value f(x) = x for all positive values. The ReLU has a simple activation function which makes it fast to compute and while the sigmoid and tanh activation functions saturate at higher values, the ReLU has a potentially infinite activation, which addresses the problem of vanishing gradients.
How do you select the number of trees in the gradient boosting model?
Most implementations of gradient boosting are configured by default with a relatively small number of trees, such as hundreds or thousands. Using scikit-learn we can perform a grid search of the n_estimators model parameter
