Skip to content
#

min-max-scaler

Here are 13 public repositories matching this topic...

Perform Clustering (Hierarchical, K Means Clustering and DBSCAN) for the airlines and crime data to obtain optimum number of clusters. Draw the inferences from the clusters obtained.

  • Updated Dec 28, 2022
  • Jupyter Notebook

EDA (Exploratory Data Analysis) -1: Loading the Datasets, Data type conversions,Removing duplicate entries, Dropping the column, Renaming the column, Outlier Detection, Missing Values and Imputation (Numerical and Categorical), Scatter plot and Correlation analysis, Transformations, Automatic EDA Methods (Pandas Profiling and Sweetviz).

  • Updated May 28, 2021
  • Jupyter Notebook
Finding-Donors-for-Charity-using-Machine-Learning

Perform Principal component analysis and perform clustering using first 3 principal component scores both Heirarchial and K Means Clustering and obtain optimum number of clusters and check whether we have obtained same number of clusters with the original data.

  • Updated Dec 30, 2022
  • Jupyter Notebook

News channel CNBE wants to analyze recent elections. This survey was conducted on 1525 voters with 9 variables. Model is built to predict which party a voter will vote for on the basis of the given information, to create an exit poll that will help in predicting overall win and seats covered by a particular party.

  • Updated Jul 18, 2024

Improve this page

Add a description, image, and links to the min-max-scaler topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the min-max-scaler topic, visit your repo's landing page and select "manage topics."

Learn more