Skip to content

Task 6#39

Open
bhadauria-harish wants to merge 32 commits intoHackSlashNITP:mainfrom
bhadauria-harish:main
Open

Task 6#39
bhadauria-harish wants to merge 32 commits intoHackSlashNITP:mainfrom
bhadauria-harish:main

Conversation

@bhadauria-harish
Copy link
Contributor

@bhadauria-harish bhadauria-harish commented Nov 10, 2025

Description

Description

  • In this notebook I performs an analysis of credit card customer data. The workflow includes data exploration, cleaning, feature scaling, and clustering. Using unsupervised learning (primarily K-Means clustering).
  • Part 2: I apply PCA on the Iris dataset to reduce its dimensionality and visualize the data in principal component space.
  • Part 3: I work with the Digits dataset, applying PCA to reduce the number of features while retaining most of the data variance. I experiment with different numbers of components to find a sweet spot that balances dimensionality.

Notes for the reviewer

  • How can we determine which cluster corresponds to which type of customer or payment behavior ? in Part 1
  • I was unable to find the sweet spot that balances dimensionality and explained variance.

bhadauria-harish and others added 30 commits May 29, 2025 17:35
Design functions to calculate the euclidean, Manhattan and cosine distances and  angles between the vectors.
Updating the notebook
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants