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

• 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
  ☆205Updated 5 years ago
• rk2900 / DRSA
  Deep Recurrent Survival Analysis, an auto-regressive deep model for time-to-event data analysis with censorship handling. An implementati…
  ☆144Updated 4 years ago
• danielhomola / mifs
  Parallelized Mutual Information based Feature Selection module.
  ☆285Updated 4 years ago
• hlin117 / mdlp-discretization
  An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad
  ☆104Updated 2 years ago
• SantiagoEG / FCBF_module
  Fast Correlation-Based Feature Selection
  ☆31Updated 8 years ago
• david-cortes / costsensitive
  (Python, R) Cost-sensitive multiclass classification (Weighted-All-Pairs, Filter-Tree & others)
  ☆49Updated 7 months ago
• scikit-learn-contrib / stability-selection
  scikit-learn compatible implementation of stability selection.
  ☆214Updated 2 years ago
• danilkolikov / fsfc
  Feature Selection for Clustering
  ☆96Updated 7 years ago
• yngvem / group-lasso
  Group Lasso implementation following the scikit-learn API
  ☆107Updated last year
• fbrundu / pymrmr
  Python3 binding to mRMR Feature Selection algorithm (currently not maintained)
  ☆141Updated last year
• neurodata / SPORF
  This is the implementation of Sparse Projection Oblique Randomer Forest
  ☆102Updated last year
• lnferreira / time_series_clustering_via_community_detection
  Code used in the paper "Time Series Clustering via Community Detection in Networks"
  ☆40Updated 5 years ago
• sramirez / fast-mRMR
  An improved implementation of the classical feature selection method: minimum Redundancy and Maximum Relevance (mRMR).
  ☆83Updated 3 years ago
• Oracen-zz / MIDAS
  Multiple imputation utilising denoising autoencoder for approximate Bayesian inference
  ☆122Updated 5 years ago
• shiralkarprashant / FCBF
  Houses implementation of the Fast Correlation-Based Filter (FCBF) feature selection method.
  ☆62Updated 3 years ago
• bsharchilev / influence_boosting
  Supporting code for the paper "Finding Influential Training Samples for Gradient Boosted Decision Trees"
  ☆68Updated last year
• 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
• suinleelab / treeexplainer-study
  Code and documentation for experiments in the TreeExplainer paper
  ☆189Updated 6 years ago
• NaegleLab / OpenEnsembles
  Code for ensemble clustering
  ☆102Updated 8 months ago
• padilha / biclustlib
  A Python library of biclustering algorithms, evaluation measures and datasets.
  ☆55Updated 5 years ago
• dlegor / rad
  Implementation of Robust PCA and Robust Deep Autoencoder over Time Series
  ☆14Updated 5 years ago
• saket-maheshwary / AutoLearn
  AutoLearn, a domain independent regression-based feature learning algorithm.
  ☆30Updated 6 years ago
• fpetitjean / ProximityForest
  Scalable and accurate classifier for time series
  ☆31Updated 6 years ago
• minepy / mictools
  A practical tool for Maximal Information Coefficient (MIC) analysis
  ☆138Updated last year
• chasedehan / BoostARoota
  A fast xgboost feature selection algorithm
  ☆228Updated 4 years ago
• julianspaeth / random-survival-forest
  A Random Survival Forest implementation for python inspired by Ishwaran et al. - Easily understandable, adaptable and extendable.
  ☆64Updated last year
• numeristical / introspective
  Repo for the ML_Insights python package
  ☆153Updated 8 months ago