Alternatives and similar repositories for Cost-sensitive-Boosting-Tutorial

Users that are interested in Cost-sensitive-Boosting-Tutorial are comparing it to the libraries listed below

• albahnsen / CostSensitiveClassification
  CostSensitiveClassification Library in Python
  ☆205Updated 5 years ago
• danielhomola / mifs
  Parallelized Mutual Information based Feature Selection module.
  ☆285Updated 4 years ago
• david-cortes / costsensitive
  (Python, R) Cost-sensitive multiclass classification (Weighted-All-Pairs, Filter-Tree & others)
  ☆49Updated 8 months ago
• NaegleLab / OpenEnsembles
  Code for ensemble clustering
  ☆103Updated 8 months ago
• hlin117 / mdlp-discretization
  An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad
  ☆104Updated 2 years ago
• rk2900 / DRSA
  Deep Recurrent Survival Analysis, an auto-regressive deep model for time-to-event data analysis with censorship handling. An implementati…
  ☆145Updated 4 years ago
• OpenIDEA-YunanUniversity / ycimpute
  A missing value imputation library based on machine learning. It's implementation missForest, simple edition of MICE(R pacakge), knn, EM,…
  ☆108Updated last year
• padilha / biclustlib
  A Python library of biclustering algorithms, evaluation measures and datasets.
  ☆54Updated 5 years ago
• scikit-learn-contrib / stability-selection
  scikit-learn compatible implementation of stability selection.
  ☆214Updated 2 years ago
• yngvem / group-lasso
  Group Lasso implementation following the scikit-learn API
  ☆107Updated last year
• neurodata / SPORF
  This is the implementation of Sparse Projection Oblique Randomer Forest
  ☆102Updated last year
• minepy / minepy
  minepy - Maximal Information-based Nonparametric Exploration
  ☆230Updated last year
• sramirez / fast-mRMR
  An improved implementation of the classical feature selection method: minimum Redundancy and Maximum Relevance (mRMR).
  ☆83Updated 3 years ago
• minepy / mictools
  A practical tool for Maximal Information Coefficient (MIC) analysis
  ☆140Updated last year
• danilkolikov / fsfc
  Feature Selection for Clustering
  ☆96Updated 7 years ago
• Jianbo-Lab / CCM
  ☆74Updated 7 years ago
• riken-aip / pyHSICLasso
  Versatile Nonlinear Feature Selection Algorithm for High-dimensional Data
  ☆188Updated 4 years ago
• cangermueller / ppca
  Probabilistic Principal Component Analysis
  ☆64Updated 8 years ago
• CVxTz / DeepTabular
  ☆37Updated 5 years ago
• thuijskens / scikit-hyperband
  A scikit-learn compatible implementation of hyperband
  ☆77Updated 6 years ago
• paul-english / predictive_imputer
  Predictive imputation of missing values with sklearn interface. This is a simple implementation of the idea presented in the MissForest R…
  ☆42Updated 3 years ago
• davidhallac / TVGL
  ☆55Updated 8 years ago
• bsharchilev / influence_boosting
  Supporting code for the paper "Finding Influential Training Samples for Gradient Boosted Decision Trees"
  ☆68Updated last year
• Treers / MetaCost
  P. Domingos proposed a principled method for making an arbitrary classifier cost-sensitive by wrapping a cost-minimizing procedure around…
  ☆39Updated 6 years ago
• fbrundu / pymrmr
  Python3 binding to mRMR Feature Selection algorithm (currently not maintained)
  ☆141Updated last year
• navicto / Discretization-MDLPC
  Discretization with Fayyad and Irani's minimum description length principle criterion (MDLPC)
  ☆60Updated 7 years ago
• ncullen93 / pyBN
  Bayesian Networks in Python
  ☆149Updated 2 years ago
• lnferreira / time_series_clustering_via_community_detection
  Code used in the paper "Time Series Clustering via Community Detection in Networks"
  ☆40Updated 6 years ago
• numeristical / introspective
  Repo for the ML_Insights python package
  ☆153Updated 9 months ago
• Oracen-zz / MIDAS
  Multiple imputation utilising denoising autoencoder for approximate Bayesian inference
  ☆122Updated 5 years ago