mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2026-09-24 15:00:31 +08:00
chore: sync content to repo
This commit is contained in:
committed by
Kamran Ahmed
parent
ba1e5a58b5
commit
b605fd6337
+2
-2
@@ -4,7 +4,7 @@ Probability is a way to quantify the likelihood of an event occurring. It provid
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@book@Probability and Statistics: The Science of Uncertainty](https://utstat.utoronto.ca/mikevans/jeffrosenthal/book.pdf)
|
||||
- [@article@Probability](https://en.wikipedia.org/wiki/Probability)
|
||||
- [@article@Probability](https://www.mathsisfun.com/data/probability.html)
|
||||
- [@video@Probability Bootcamp](https://www.youtube.com/playlist?list=PLMrJAkhIeNNR3sNYvfgiKgcStwuPSts9V)
|
||||
- [@book@Probability and Statistics: The Science of Uncertainty](https://utstat.utoronto.ca/mikevans/jeffrosenthal/book.pdf)
|
||||
- [@video@Probability Bootcamp](https://www.youtube.com/playlist?list=PLMrJAkhIeNNR3sNYvfgiKgcStwuPSts9V)
|
||||
@@ -4,6 +4,6 @@ Calculus is a branch of mathematics that deals with continuous change. It provid
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Calculus](https://en.wikipedia.org/wiki/Calculus)
|
||||
- [@book@Calculus Online Textbook](https://ocw.mit.edu/courses/res-18-001-calculus-fall-2023/pages/textbook/)
|
||||
- [@article@Calculus](https://en.wikipedia.org/wiki/Calculus)
|
||||
- [@video@Calculus](https://www.youtube.com/playlist?list=PLybg94GvOJ9ELZEe9s2NXTKr41Yedbw7M)
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
# Chain Rule of Derivation
|
||||
|
||||
The chain rule is a formula for finding the derivative of a composite function. If you have a function that's made up of one function inside another (like sin(x²) ), the chain rule lets you break down the differentiation process. It states that the derivative of the composite function is the derivative of the outer function evaluated at the inner function, multiplied by the derivative of the inner function.
|
||||
The chain rule is a formula for finding the derivative of a composite function. If you have a function that's made up of one function inside another (like sin(x²) ), the chain rule lets you break down the differentiation process. It states that the derivative of the composite function is the derivative of the outer function evaluated at the inner function, multiplied by the derivative of the inner function.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
@@ -4,6 +4,6 @@ Classification is a type of supervised learning where the goal is to assign data
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@course@Classification - Google Crash Course](https://developers.google.com/machine-learning/crash-course/classification)
|
||||
- [@article@What is Classification in Machine Learning?](https://www.ibm.com/think/topics/classification-machine-learning)
|
||||
- [@article@Classification in Machine Learning: A Guide for Beginners](https://www.datacamp.com/blog/classification-machine-learning)
|
||||
- [@course@Classification - Google Crash Course](https://developers.google.com/machine-learning/crash-course/classification)
|
||||
- [@article@Classification in Machine Learning: A Guide for Beginners](https://www.datacamp.com/blog/classification-machine-learning)
|
||||
@@ -1,6 +1,6 @@
|
||||
# Conditionals
|
||||
|
||||
Conditional statements in Python allow you to execute different blocks of code based on whether a certain condition is true or false. The most common conditional statements are `if`, `elif` (else if), and `else`. An `if` statement checks a condition, and if it's true, the code block under it runs. `elif` allows you to check additional conditions if the initial `if` condition is false. Finally, `else` provides a block of code to execute if none of the preceding `if` or `elif` conditions are true. These statements enable programs to make decisions and respond differently to various inputs or situations.
|
||||
Conditional statements in Python allow you to execute different blocks of code based on whether a certain condition is true or false. The most common conditional statements are `if`, `elif` (else if), and `else`. An `if` statement checks a condition, and if it's true, the code block under it runs. `elif` allows you to check additional conditions if the initial `if` condition is false. Finally, `else` provides a block of code to execute if none of the preceding `if` or `elif` conditions are true. These statements enable programs to make decisions and respond differently to various inputs or situations.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
# Convolution
|
||||
|
||||
Convolution is a mathematical operation that involves sliding a filter (also known as a kernel) over an input image or feature map. At each location, the filter performs element-wise multiplication with the corresponding part of the input, and then sums the results. This sum becomes a single value in the output feature map. By sliding the filter across the entire input, the convolution operation extracts features and patterns present in the image, such as edges, textures, or shapes.
|
||||
Convolution is a mathematical operation that involves sliding a filter (also known as a kernel) over an input image or feature map. At each location, the filter performs element-wise multiplication with the corresponding part of the input, and then sums the results. This sum becomes a single value in the output feature map. By sliding the filter across the entire input, the convolution operation extracts features and patterns present in the image, such as edges, textures, or shapes.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
# Deep Q-Networks (DQN)
|
||||
|
||||
Deep Q-Networks (DQNs) are a type of reinforcement learning algorithm that combines Q-learning with deep neural networks. Instead of using a traditional Q-table to store Q-values (which represent the expected reward for taking a specific action in a specific state), DQNs use a neural network to approximate the Q-function. This allows DQNs to handle environments with large or continuous state spaces where a Q-table would be impractical. The neural network takes the state as input and outputs the Q-values for each possible action, enabling the agent to learn optimal policies through trial and error.
|
||||
Deep Q-Networks (DQNs) are a type of reinforcement learning algorithm that combines Q-learning with deep neural networks. Instead of using a traditional Q-table to store Q-values (which represent the expected reward for taking a specific action in a specific state), DQNs use a neural network to approximate the Q-function. This allows DQNs to handle environments with large or continuous state spaces where a Q-table would be impractical. The neural network takes the state as input and outputs the Q-values for each possible action, enabling the agent to learn optimal policies through trial and error.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
+1
-1
@@ -5,6 +5,6 @@ Eigenvalues are special numbers associated with a square matrix that, when multi
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Eigenvalues and eigenvectors](https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors)
|
||||
- [@video@Finding Eigenvalues and Eigenvectors](https://www.youtube.com/watch?v=TQvxWaQnrqI)
|
||||
- [@article@Matrix Diagonalization](https://www.statlect.com/matrix-algebra/matrix-diagonalization)
|
||||
- [@video@Finding Eigenvalues and Eigenvectors](https://www.youtube.com/watch?v=TQvxWaQnrqI)
|
||||
- [@video@Diagonalization](https://www.youtube.com/watch?v=WTLl03D4TNA)
|
||||
+1
-1
@@ -4,7 +4,7 @@ Generative Adversarial Networks (GANs) are a type of neural network architecture
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@course@GANs | Google](https://developers.google.com/machine-learning/gan)
|
||||
- [@article@What is a GAN? | AWS](https://aws.amazon.com/what-is/gan/)
|
||||
- [@article@Generative Adversarial Networks | HuggingFace](https://huggingface.co/learn/computer-vision-course/en/unit5/generative-models/gans)
|
||||
- [@course@GANs | Google](https://developers.google.com/machine-learning/gan)
|
||||
- [@video@What are GANs (Generative Adversarial Networks)?](https://www.youtube.com/watch?v=TpMIssRdhco)
|
||||
@@ -2,9 +2,9 @@
|
||||
|
||||
The Internet of Things (IoT) refers to the network of physical devices, vehicles, home appliances, and other items embedded with electronics, software, sensors, and actuators that enable these objects to connect and exchange data. These devices continuously generate vast amounts of data reflecting their status, environment, and interactions. This data can include sensor readings like temperature, pressure, humidity, location, and images or video streams.
|
||||
|
||||
- [@article@What is the Internet of Things (IoT)?](https://www.ibm.com/think/topics/internet-of-things)
|
||||
- [@article@Internet of Things](https://en.wikipedia.org/wiki/Internet_of_things)
|
||||
- [@video@What is IoT (Internet of Things)? An Introduction](https://www.youtube.com/watch?v=4FxU-xpuCww)
|
||||
* [@article@What is the Internet of Things (IoT)?](https://www.ibm.com/think/topics/internet-of-things)
|
||||
* [@article@Internet of Things](https://en.wikipedia.org/wiki/Internet_of_things)
|
||||
* [@video@What is IoT (Internet of Things)? An Introduction](https://www.youtube.com/watch?v=4FxU-xpuCww)
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
# K-Fold Cross Validation
|
||||
|
||||
K-Fold Cross Validation is a technique used to assess how well a machine learning model will generalize to an independent dataset. It works by dividing the available data into *k* equally sized folds or subsets. The model is then trained *k* times, each time using *k-1* folds as the training set and the remaining fold as the validation set. The performance metrics from each of the *k* iterations are then averaged to provide an overall estimate of the model's performance.
|
||||
K-Fold Cross Validation is a technique used to assess how well a machine learning model will generalize to an independent dataset. It works by dividing the available data into _k_ equally sized folds or subsets. The model is then trained _k_ times, each time using _k-1_ folds as the training set and the remaining fold as the validation set. The performance metrics from each of the _k_ iterations are then averaged to provide an overall estimate of the model's performance.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
@@ -4,7 +4,7 @@ Keras is a high-level, user-friendly neural networks API written in Python. It a
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@course@Getting Familiar with Keras](https://towardsdatascience.com/getting-familiar-with-keras-dd17a110652d/)
|
||||
- [@official@Keras](https://keras.io/)
|
||||
- [@opensource@Keras](https://github.com/keras-team/keras)
|
||||
- [@course@Getting Familiar with Keras](https://towardsdatascience.com/getting-familiar-with-keras-dd17a110652d/)
|
||||
- [@article@Keras Crash Course | Deep Learning, Image Modelling, RNNs and More](https://www.youtube.com/watch?v=a8op1jBG7oM)
|
||||
@@ -4,6 +4,6 @@ Linear algebra is a branch of mathematics that deals with vector spaces and line
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@book@Linear algebra for data science](http://mitran-lab.amath.unc.edu/courses/MATH347DS/textbook.pdf)
|
||||
- [@article@How I learned Linear Algebra, Probability and Statistics for Data Science](https://towardsdatascience.com/how-i-learned-linear-algebra-probability-and-statistics-for-data-science-b9d1c34dfa56/)
|
||||
- [@video@Linear Algebra for Machine Learning](https://www.youtube.com/watch?v=QCPJ0VdpM00)
|
||||
- [@book@Linear algebra for data science](http://mitran-lab.amath.unc.edu/courses/MATH347DS/textbook.pdf)
|
||||
- [@video@Linear Algebra for Machine Learning](https://www.youtube.com/watch?v=QCPJ0VdpM00)
|
||||
+2
-2
@@ -4,7 +4,7 @@ Natural Language Processing (NLP) is a field focused on enabling computers to un
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@book@Natural Language Processing with Python](https://tjzhifei.github.io/resources/NLTK.pdf)
|
||||
- [@article@Natural Language Processing](https://www.deeplearning.ai/resources/natural-language-processing/)
|
||||
- [@article@What is Natural Language Processing (NLP)? | AWS](https://aws.amazon.com/what-is/nlp/)
|
||||
- [@video@Stanford’s Natural Language Processing with Deep Learning](https://www.youtube.com/playlist?list=PLoROMvodv4rMFqRtEuo6SGjY4XbRIVRd4)
|
||||
- [@book@Natural Language Processing with Python](https://tjzhifei.github.io/resources/NLTK.pdf)
|
||||
- [@video@Stanford’s Natural Language Processing with Deep Learning](https://www.youtube.com/playlist?list=PLoROMvodv4rMFqRtEuo6SGjY4XbRIVRd4)
|
||||
+2
-2
@@ -4,5 +4,5 @@ A neural network is a computational model inspired by the structure and function
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@video@Neural Networks Explained in 5 minutes](https://www.youtube.com/watch?v=jmmW0F0biz0)
|
||||
- [@course@Practical Deep Learning](https://course.fast.ai/)
|
||||
- [@course@Practical Deep Learning](https://course.fast.ai/)
|
||||
- [@video@Neural Networks Explained in 5 minutes](https://www.youtube.com/watch?v=jmmW0F0biz0)
|
||||
+1
-1
@@ -5,6 +5,6 @@ In Python, object-oriented Programming (OOPs) is a programming paradigm that use
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Object Oriented Programming in Python](https://realpython.com/python3-object-oriented-programming/)
|
||||
- [@article@https://www.youtube.com/watch?v=Ej_02ICOIgs](https://www.youtube.com/watch?v=Ej_02ICOIgs)
|
||||
- [@video@Object Oriented Programming (OOP) In Python - Beginner Crash Course](https://www.youtube.com/watch?v=-pEs-Bss8Wc/)
|
||||
- [@video@OOP in Python One Shot]](https://www.youtube.com/watch?v=Ej_02ICOIgs)
|
||||
- [@video@Python OOP Tutorial](https://www.youtube.com/watch?v=IbMDCwVm63M)
|
||||
@@ -1,6 +1,6 @@
|
||||
# Overlapping Clustering
|
||||
|
||||
Overlapping clustering allows data points to belong to multiple clusters simultaneously. Unlike traditional "hard" clustering where each point is assigned to only one cluster, overlapping clustering acknowledges that data points can exhibit characteristics of several groups. This is particularly useful when dealing with complex datasets where boundaries between clusters are not well-defined. One algorithm that implements overlapping clustering is the *Fuzzy C-Means (FCM)* algorithm. FCM assigns a membership degree to each data point for each cluster, representing the probability of belonging to that cluster. A data point can have non-zero membership degrees for multiple clusters, indicating its partial membership in each.
|
||||
Overlapping clustering allows data points to belong to multiple clusters simultaneously. Unlike traditional "hard" clustering where each point is assigned to only one cluster, overlapping clustering acknowledges that data points can exhibit characteristics of several groups. This is particularly useful when dealing with complex datasets where boundaries between clusters are not well-defined. One algorithm that implements overlapping clustering is the _Fuzzy C-Means (FCM)_ algorithm. FCM assigns a membership degree to each data point for each cluster, representing the probability of belonging to that cluster. A data point can have non-zero membership degrees for multiple clusters, indicating its partial membership in each.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
@@ -4,6 +4,6 @@ Linear algebra is a branch of mathematics that deals with vector spaces and line
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@book@Linear algebra for data science](http://mitran-lab.amath.unc.edu/courses/MATH347DS/textbook.pdf)
|
||||
- [@article@How I learned Linear Algebra, Probability and Statistics for Data Science](https://towardsdatascience.com/how-i-learned-linear-algebra-probability-and-statistics-for-data-science-b9d1c34dfa56/)
|
||||
- [@video@Linear Algebra for Machine Learning](https://www.youtube.com/watch?v=QCPJ0VdpM00)
|
||||
- [@book@Linear algebra for data science](http://mitran-lab.amath.unc.edu/courses/MATH347DS/textbook.pdf)
|
||||
- [@video@Linear Algebra for Machine Learning](https://www.youtube.com/watch?v=QCPJ0VdpM00)
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
# Random Variables and Probability Density Functions
|
||||
|
||||
A random variable is a variable whose value is a numerical outcome of a random phenomenon. It can be discrete (taking on a finite or countably infinite number of values) or continuous (taking on any value within a given range).
|
||||
A random variable is a variable whose value is a numerical outcome of a random phenomenon. It can be discrete (taking on a finite or countably infinite number of values) or continuous (taking on any value within a given range).
|
||||
|
||||
The probability density function (PDF) describes the relative likelihood for a continuous random variable to take on a given value. It's important to note that the value of the PDF at any given point is not a probability itself, but rather the area under the PDF curve over a given interval represents the probability of the random variable falling within that interval.
|
||||
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
# Recall
|
||||
|
||||
Recall measures how well a model identifies all the actual positive cases. It answers the question: "Of all the actual positive instances, how many did the model correctly predict as positive?". A high recall means the model is good at minimizing false negatives. The formula for recall is: `Recall = True Positives / (True Positives + False Negatives)`.
|
||||
Recall measures how well a model identifies all the actual positive cases. It answers the question: "Of all the actual positive instances, how many did the model correctly predict as positive?". A high recall means the model is good at minimizing false negatives. The formula for recall is: `Recall = True Positives / (True Positives + False Negatives)`.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
+1
-1
@@ -6,5 +6,5 @@ Visit the following resources to learn more:
|
||||
|
||||
- [@article@What is reinforcement learning?](https://online.york.ac.uk/resources/what-is-reinforcement-learning/)
|
||||
- [@article@Resources to Learn Reinforcement Learning](https://towardsdatascience.com/best-free-courses-and-resources-to-learn-reinforcement-learning-ed6633608cb2/)
|
||||
- [@course@Deep Reinforcement Learning Course by HuggingFace]](https://huggingface.co/learn/deep-rl-course/unit0/introduction)
|
||||
- [@article@https://huggingface.co/learn/deep-rl-course/unit0/introduction](https://huggingface.co/learn/deep-rl-course/unit0/introduction)
|
||||
- [@article@Reinforcement Learning in 3 Hours | Full Course using Python](https://www.youtube.com/watch?v=Mut_u40Sqz4)
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
# Semi-Supervised Learning
|
||||
|
||||
Semi-supervised learning is a type of machine learning where the training data contains both labeled and unlabeled examples. The goal is to leverage the information from the unlabeled data to improve the performance of a model that would otherwise be trained solely on the labeled data. This approach is particularly useful when obtaining labels is expensive or time-consuming, but unlabeled data is readily available.
|
||||
Semi-supervised learning is a type of machine learning where the training data contains both labeled and unlabeled examples. The goal is to leverage the information from the unlabeled data to improve the performance of a model that would otherwise be trained solely on the labeled data. This approach is particularly useful when obtaining labels is expensive or time-consuming, but unlabeled data is readily available.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
|
||||
+2
-2
@@ -4,6 +4,6 @@ Singular Value Decomposition (SVD) is a matrix factorization technique that deco
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@book@Singular Value Decomposition](https://www.cs.cmu.edu/~venkatg/teaching/CStheory-infoage/book-chapter-4.pdf)
|
||||
- [@article@Singular Value Decomposition](https://en.wikipedia.org/wiki/Singular_value_decomposition)
|
||||
- [@video@Singular Value Decomposition (SVD): Overview](https://www.youtube.com/watch?v=gXbThCXjZFM)
|
||||
- [@book@Singular Value Decomposition](https://www.cs.cmu.edu/~venkatg/teaching/CStheory-infoage/book-chapter-4.pdf)
|
||||
- [@video@Singular Value Decomposition (SVD): Overview](https://www.youtube.com/watch?v=gXbThCXjZFM)
|
||||
@@ -4,6 +4,6 @@ Statistics is the science of collecting, analyzing, interpreting, presenting, an
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Introduction to Statistics](https://imp.i384100.net/3eRv4v)
|
||||
- [@book@Introductory Statistics](https://assets.openstax.org/oscms-prodcms/media/documents/IntroductoryStatistics-OP_i6tAI7e.pdf)
|
||||
- [@article@Introduction to Statistics](https://imp.i384100.net/3eRv4v)
|
||||
- [@video@Statistics - A Full University Course on Data Science Basics](https://www.youtube.com/watch?v=xxpc-HPKN28)
|
||||
@@ -4,7 +4,7 @@ Transformers are a type of neural network architecture that rely on attention me
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@course@LLM Course | HuggingFace](https://huggingface.co/learn/llm-course/chapter1/1)
|
||||
- [@article@What is a Transformer Model?](https://www.ibm.com/think/topics/transformer-model)
|
||||
- [@article@How Transformers Work: A Detailed Exploration of Transformer Architecture](https://www.datacamp.com/tutorial/how-transformers-work)
|
||||
- [@course@LLM Course | HuggingFace](https://huggingface.co/learn/llm-course/chapter1/1)
|
||||
- [@video@Transformers, explained: Understand the model behind GPT, BERT, and T5](https://www.youtube.com/watch?v=SZorAJ4I-sA&t)
|
||||
+2
-2
@@ -4,7 +4,7 @@ Machine learning is a field of computer science that focuses on enabling compute
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@book@Machine Learning: The Basics](https://alexjungaalto.github.io/MLBasicsBook.pdf)
|
||||
- [@article@What is Machine Learning (ML)?](https://www.ibm.com/topics/machine-learning)
|
||||
- [@video@What is Machine Learning?](https://www.youtube.com/watch?v=9gGnTQTYNaE)
|
||||
- [@video@Complete Machine Learning in One Video | Machine Learning Tutorial For Beginners 2025 | Simplilearn](https://www.youtube.com/watch?v=PtYRUoJRE9s)
|
||||
- [@book@Machine Learning: The Basics](https://alexjungaalto.github.io/MLBasicsBook.pdf)
|
||||
- [@video@Complete Machine Learning in One Video | Machine Learning Tutorial For Beginners 2025 | Simplilearn](https://www.youtube.com/watch?v=PtYRUoJRE9s)
|
||||
+1
-1
@@ -6,5 +6,5 @@ Visit the following resources to learn more:
|
||||
|
||||
- [@article@What is reinforcement learning?](https://online.york.ac.uk/resources/what-is-reinforcement-learning/)
|
||||
- [@article@Resources to Learn Reinforcement Learning](https://towardsdatascience.com/best-free-courses-and-resources-to-learn-reinforcement-learning-ed6633608cb2/)
|
||||
- [@course@Deep Reinforcement Learning Course by HuggingFace]](https://huggingface.co/learn/deep-rl-course/unit0/introduction)
|
||||
- [@article@https://huggingface.co/learn/deep-rl-course/unit0/introduction](https://huggingface.co/learn/deep-rl-course/unit0/introduction)
|
||||
- [@video@Reinforcement Learning in 3 Hours | Full Course using Python](https://www.youtube.com/watch?v=Mut_u40Sqz4)
|
||||
Reference in New Issue
Block a user