NaegleLab / OpenEnsembles

Related projects ⓘ

Alternatives and complementary repositories for OpenEnsembles

• GGiecold-zz / Cluster_Ensembles
  A package for combining multiple partitions into a consolidated clustering. The combinatorial optimization problem of obtaining such a co…
  ☆69Updated 2 years ago
• GuipengLi / Dcluster
  Clustering by fast search and find of density peaks
  ☆77Updated 6 years ago
• scikit-learn-contrib / stability-selection
  scikit-learn compatible implementation of stability selection.
  ☆210Updated last year
• neurodata / SPORF
  This is the implementation of Sparse Projection Oblique Randomer Forest
  ☆97Updated 6 months ago
• cwehmeyer / pydpc
  Clustering by fast search and find of density peaks
  ☆62Updated 4 years ago
• nnikolaou / Cost-sensitive-Boosting-Tutorial
  Tutorial on cost-sensitive boosting and calibrated AdaMEC.
  ☆26Updated 7 years ago
• Yu-Group / iterative-Random-Forest
  Python implementation of iterative-random-forests
  ☆61Updated 11 months ago
• lnferreira / time_series_clustering_via_community_detection
  Code used in the paper "Time Series Clustering via Community Detection in Networks"
  ☆37Updated 4 years ago
• danilkolikov / fsfc
  Feature Selection for Clustering
  ☆94Updated 6 years ago
• albahnsen / CostSensitiveClassification
  CostSensitiveClassification Library in Python
  ☆207Updated 4 years ago
• thuijskens / scikit-hyperband
  A scikit-learn compatible implementation of hyperband
  ☆75Updated 5 years ago
• Jianbo-Lab / CCM
  ☆74Updated 5 years ago
• riken-aip / pyHSICLasso
  Versatile Nonlinear Feature Selection Algorithm for High-dimensional Data
  ☆175Updated 2 years ago
• sramirez / fast-mRMR
  An improved implementation of the classical feature selection method: minimum Redundancy and Maximum Relevance (mRMR).
  ☆82Updated 2 years ago
• suinleelab / treeexplainer-study
  Code and documentation for experiments in the TreeExplainer paper
  ☆179Updated 5 years ago
• mims-harvard / scikit-fusion
  scikit-fusion: Data fusion via collective latent factor models
  ☆144Updated last year
• acopar / fast-nmtf
  Fast methods for non-negative matrix tri-factorization
  ☆15Updated 5 years ago
• minepy / mictools
  A practical tool for Maximal Information Coefficient (MIC) analysis
  ☆129Updated 8 months ago
• EpistasisLab / scikit-rebate
  A scikit-learn-compatible Python implementation of ReBATE, a suite of Relief-based feature selection algorithms for Machine Learning.
  ☆409Updated last year
• david-cortes / costsensitive
  (Python, R) Cost-sensitive multiclass classification (Weighted-All-Pairs, Filter-Tree & others)
  ☆47Updated 5 months ago
• mstrazar / iONMF
  Integrative orthogonal non-negative matrix factorization
  ☆32Updated 5 years ago
• hlin117 / mdlp-discretization
  An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad
  ☆103Updated last year
• EpistasisLab / scikit-mdr
  A sklearn-compatible Python implementation of Multifactor Dimensionality Reduction (MDR) for feature construction.
  ☆126Updated last year
• claesenm / resvm
  Robust Ensemble of SVMs
  ☆21Updated 10 years ago
• georgekatona / Clique
  Python implementation of the CLIQUE subspace clustering algorithm.
  ☆53Updated last year
• rsheth80 / pmf-automl
  Data and code related to the paper "Probabilistic matrix factorization for automated machine learning", NIPS, 2018.
  ☆40Updated 2 years ago
• rymc / n2d
  A deep clustering algorithm. Code to reproduce results for our paper N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of …
  ☆129Updated last year
• aldro61 / pu-learning
  Positive and unlabeled learning wrappers for scikit-learn
  ☆233Updated 6 years ago
• baccuslab / shannon
  A python package for computing the mutual information and entropy for continuous and discrete data.
  ☆32Updated 7 years ago
• shiralkarprashant / FCBF
  Houses implementation of the Fast Correlation-Based Filter (FCBF) feature selection method.
  ☆61Updated 2 years ago