| mrsaeeddev/free-ai-resources |
466 |
|
0 |
0 |
over 2 years ago |
0 |
|
16 |
mit |
|
| 🚀 FREE AI Resources - 🎓 Courses, 👷 Jobs, 📝 Blogs, 🔬 AI Research, and many more - for everyone! |
| madhug-nadig/Machine-Learning-Algorithms-from-Scratch |
312 |
|
0 |
0 |
over 4 years ago |
0 |
|
2 |
|
Python |
| Implementing machine learning algorithms from scratch. |
| milaan9/Clustering_Algorithms_from_Scratch |
170 |
|
0 |
0 |
over 3 years ago |
0 |
|
0 |
mit |
Jupyter Notebook |
| Implementing Clustering Algorithms from scratch in MATLAB and Python |
| christopherjenness/ML-lib |
101 |
|
0 |
0 |
almost 8 years ago |
0 |
|
7 |
mit |
Python |
| An extensive machine learning library, made from scratch (Python). |
| hukenovs/coursera_ml_da_specialization |
53 |
|
0 |
0 |
almost 4 years ago |
0 |
|
0 |
|
Jupyter Notebook |
| Coursera Specialization: Machine Learning and Data Analysis (Yandex & MIPT) |
| CarsonScott/HSOM |
36 |
|
0 |
0 |
over 6 years ago |
0 |
|
1 |
|
Python |
| Hierarchical self-organizing maps for unsupervised pattern recognition |
| ML-AI-Community/ml-ai |
32 |
|
0 |
0 |
over 3 years ago |
0 |
|
1 |
mit |
Jupyter Notebook |
| ML-AI Community | Open Source | Built in Bharat for the World | Data science problem statements and solutions |
| LuisScoccola/persistable |
31 |
|
0 |
0 |
over 2 years ago |
24 |
September 22, 2023 |
0 |
bsd-3-clause |
Python |
| density-based clustering for exploratory data analysis based on multi-parameter persistence |
| reddyprasade/Machine-Learning-with-Scikit-Learn-Python-3.x |
27 |
|
0 |
0 |
almost 5 years ago |
0 |
|
0 |
mit |
Jupyter Notebook |
| In general, a learning problem considers a set of n samples of data and then tries to predict properties of unknown data. If each sample is more than a single number and, for instance, a multi-dimensional entry (aka multivariate data), it is said to have several attributes or features. Learning problems fall into a few categories: supervised learning, in which the data comes with additional attributes that we want to predict (Click here to go to the scikit-learn supervised learning page).This problem can be either: classification: samples belong to two or more classes and we want to learn from already labeled data how to predict the class of unlabeled data. An example of a classification problem would be handwritten digit recognition, in which the aim is to assign each input vector to one of a finite number of discrete categories. Another way to think of classification is as a discrete (as opposed to continuous) form of supervised learning where one has a limited number of categories and for each of the n samples provided, one is to try to label them with the correct category or class. regression: if the desired output consists of one or more continuous variables, then the task is called regression. An example of a regression problem would be the prediction of the length of a salmon as a function of its age and weight. unsupervised learning, in which the training data consists of a set of input vectors x without any corresponding target values. The goal in such problems may be to discover groups of similar examples within the data, where it is called clustering, or to determine the distribution of data within the input space, known as density estimation, or to project the data from a high-dimensional space down to two or three dimensions for the purpose of visualization (Click here to go to the Scikit-Learn unsupervised learning page). |
| nitsuga1986/machine-learning-nd-portfolio |
25 |
|
0 |
0 |
about 3 years ago |
0 |
|
26 |
|
Jupyter Notebook |
| Machine Learning Engineer Nanodegree portfolio, which includes projects and their notebooks/reports. |
