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

• rk2900 / DRSA
  Deep Recurrent Survival Analysis, an auto-regressive deep model for time-to-event data analysis with censorship handling. An implementati…
  ☆142Updated 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,…
  ☆107Updated last year
• albahnsen / CostSensitiveClassification
  CostSensitiveClassification Library in Python
  ☆206Updated 5 years ago
• david-cortes / costsensitive
  (Python, R) Cost-sensitive multiclass classification (Weighted-All-Pairs, Filter-Tree & others)
  ☆48Updated 2 months ago
• neurodata / SPORF
  This is the implementation of Sparse Projection Oblique Randomer Forest
  ☆99Updated last year
• SantiagoEG / FCBF_module
  Fast Correlation-Based Feature Selection
  ☆31Updated 8 years ago
• danielhomola / mifs
  Parallelized Mutual Information based Feature Selection module.
  ☆286Updated 3 years ago
• hlin117 / mdlp-discretization
  An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad
  ☆105Updated 2 years ago
• shiralkarprashant / FCBF
  Houses implementation of the Fast Correlation-Based Filter (FCBF) feature selection method.
  ☆61Updated 3 years ago
• scikit-learn-contrib / stability-selection
  scikit-learn compatible implementation of stability selection.
  ☆213Updated 2 years ago
• riken-aip / pyHSICLasso
  Versatile Nonlinear Feature Selection Algorithm for High-dimensional Data
  ☆185Updated 3 years ago
• danilkolikov / fsfc
  Feature Selection for Clustering
  ☆96Updated 7 years ago
• fbrundu / pymrmr
  Python3 binding to mRMR Feature Selection algorithm (currently not maintained)
  ☆141Updated 7 months ago
• sramirez / fast-mRMR
  An improved implementation of the classical feature selection method: minimum Redundancy and Maximum Relevance (mRMR).
  ☆83Updated 3 years ago
• cangermueller / ppca
  Probabilistic Principal Component Analysis
  ☆63Updated 8 years ago
• Jianbo-Lab / CCM
  ☆74Updated 6 years ago
• Oracen-zz / MIDAS
  Multiple imputation utilising denoising autoencoder for approximate Bayesian inference
  ☆122Updated 5 years ago
• NaegleLab / OpenEnsembles
  Code for ensemble clustering
  ☆102Updated 3 months ago
• slds-lmu / iml_methods_limitations
  Seminar on Limitations of Interpretable Machine Learning Methods
  ☆57Updated 4 years ago
• lnferreira / time_series_clustering_via_community_detection
  Code used in the paper "Time Series Clustering via Community Detection in Networks"
  ☆39Updated 5 years ago
• joshloyal / RotationForest
  Implementation of the Rotation Forest by Rodriques et al. 2006
  ☆28Updated last year
• suinleelab / treeexplainer-study
  Code and documentation for experiments in the TreeExplainer paper
  ☆185Updated 5 years ago
• kellieotto / pscore_match
  A Python package for propensity score matching
  ☆53Updated 3 years ago
• yngvem / group-lasso
  Group Lasso implementation following the scikit-learn API
  ☆106Updated last year
• bsharchilev / influence_boosting
  Supporting code for the paper "Finding Influential Training Samples for Gradient Boosted Decision Trees"
  ☆68Updated last year
• gregtam / interpreting-decision-trees-and-random-forests
  Unwrapping decision trees and random forests to make them less of a black box
  ☆62Updated 7 years ago
• fabsig / KTBoost
  A Python package which implements several boosting algorithms with different combinations of base learners, optimization algorithms, and …
  ☆63Updated 3 years ago
• davidhallac / TVGL
  ☆55Updated 7 years ago
• minepy / mictools
  A practical tool for Maximal Information Coefficient (MIC) analysis
  ☆136Updated last year
• thuijskens / scikit-hyperband
  A scikit-learn compatible implementation of hyperband
  ☆77Updated 5 years ago