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
• david-cortes / costsensitive
  (Python, R) Cost-sensitive multiclass classification (Weighted-All-Pairs, Filter-Tree & others)
  ☆47Updated 2 months ago
• 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
• AnchorBlues / GroupLasso
  Group Lasso package for Python.
  ☆15Updated last year
• Jianbo-Lab / CCM
  ☆74Updated 6 years ago
• sramirez / fast-mRMR
  An improved implementation of the classical feature selection method: minimum Redundancy and Maximum Relevance (mRMR).
  ☆83Updated 3 years ago
• CVxTz / DeepTabular
  ☆37Updated 4 years ago
• SantiagoEG / FCBF_module
  Fast Correlation-Based Feature Selection
  ☆31Updated 7 years ago
• paidamoyo / adversarial_time_to_event
  ICML 2018: "Adversarial Time-to-Event Modeling"
  ☆37Updated 6 years ago
• Oracen-zz / MIDAS
  Multiple imputation utilising denoising autoencoder for approximate Bayesian inference
  ☆121Updated 4 years ago
• albahnsen / CostSensitiveClassification
  CostSensitiveClassification Library in Python
  ☆207Updated 4 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…
  ☆40Updated 2 years ago
• franck-durand / tsboost
  Time Series Forecasting Framework
  ☆41Updated 2 years ago
• unnir / CancelOut
  CancelOut is a special layer for deep neural networks that can help identify a subset of relevant input features for streaming or static …
  ☆26Updated 4 years ago
• NaegleLab / OpenEnsembles
  Code for ensemble clustering
  ☆102Updated 3 years ago
• nlhepler / mrmr
  minimum Redundancy Maximum Relevance
  ☆21Updated 12 years ago
• shiralkarprashant / FCBF
  Houses implementation of the Fast Correlation-Based Filter (FCBF) feature selection method.
  ☆61Updated 3 years ago
• lnferreira / time_series_clustering_via_community_detection
  Code used in the paper "Time Series Clustering via Community Detection in Networks"
  ☆37Updated 5 years ago
• hlin117 / mdlp-discretization
  An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad
  ☆105Updated last year
• cangermueller / ppca
  Probabilistic Principal Component Analysis
  ☆61Updated 7 years ago
• arjoly / random-output-trees
  Randomized output tree for multilabel / multi-output regression tasks
  ☆23Updated 9 years ago
• neurodata / SPORF
  This is the implementation of Sparse Projection Oblique Randomer Forest
  ☆98Updated 10 months ago
• bsharchilev / influence_boosting
  Supporting code for the paper "Finding Influential Training Samples for Gradient Boosted Decision Trees"
  ☆67Updated 10 months ago
• alan-turing-institute / bocpdms
  ☆32Updated 6 years ago
• rsheth80 / pmf-automl
  Data and code related to the paper "Probabilistic matrix factorization for automated machine learning", NIPS, 2018.
  ☆39Updated 3 years ago
• ProcessMonitoringStellenboschUniversity / IFAC-VAE-Imputation
  Demonstration code for missing data imputation using Variational Autoencoders (VAE)
  ☆23Updated 6 years ago
• joshloyal / RotationForest
  Implementation of the Rotation Forest by Rodriques et al. 2006
  ☆28Updated last year
• davidhallac / NetworkLasso
  ☆22Updated 9 years ago
• slds-lmu / iml_methods_limitations
  Seminar on Limitations of Interpretable Machine Learning Methods
  ☆57Updated 4 years ago
• navicto / Discretization-MDLPC
  Discretization with Fayyad and Irani's minimum description length principle criterion (MDLPC)
  ☆60Updated 6 years ago