Skip to content
#

heirarchical-clustering

Here are 19 public repositories matching this topic...

In this work, we propose a deterministic version of Local Interpretable Model Agnostic Explanations (LIME) and the experimental results on three different medical datasets shows the superiority for Deterministic Local Interpretable Model-Agnostic Explanations (DLIME).

  • Updated Nov 25, 2019
  • Python

SUPERVISED LEARNING: REGRESSION: Linear - Polynomial - Ridge/Lasso CLASSIFICATION: K-NN - Naïve Bayes - Decision Tree - Logistic Regression - Confusion Matrix - SVM TIME SERIES ANALYSIS: Linear & Logistic Regr. - Autoregressive Model - ARIMA - Naïve - Smoothing Technique UNSUPERVISED LEARNING: CLUSTERING: K-Means - Agglomerative - Mean-Shift - Fuzzy C-Mean - DBSCAN - Hierarchical - Canopy DIMENSION REDUCTION: PCA - LSA - SVD - LDA - t-SNE PATTERN SEARCH: Apriori - FP-Growth - Euclat RECOMMENDATION ENGINE: Association Rules - Market Basket Analysis - Apriori Algorithm - Real Rating Matrix - IBCF - (Item) - User-Based Collaborative Filtering UBCF - Method & Model ENSEMBLE METHODS: BOOSTING: AdaBoost - XG Boost - LightGBM - CatBoost. BAGGING: Random Forest STACKING

  • Updated May 8, 2020
  • Jupyter Notebook

A Shopping mall has certain no. of clients having membership cards, having purchase history of each client. We group clients as per there annual income and spending score(as per purchase history). So they will send promotional notification accordingly.

  • Updated May 23, 2019
  • Python

Improve this page

Add a description, image, and links to the heirarchical-clustering 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 heirarchical-clustering topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.