Alternatives and similar repositories for OpenEnsembles

Users that are interested in OpenEnsembles are comparing it to the libraries listed below

• danilkolikov / fsfc
  Feature Selection for Clustering
  ☆96Updated 7 years ago
• GGiecold-zz / Cluster_Ensembles
  A package for combining multiple partitions into a consolidated clustering. The combinatorial optimization problem of obtaining such a co…
  ☆74Updated 2 years ago
• mims-harvard / scikit-fusion
  scikit-fusion: Data fusion via collective latent factor models
  ☆148Updated last year
• scikit-learn-contrib / stability-selection
  scikit-learn compatible implementation of stability selection.
  ☆213Updated 2 years ago
• albahnsen / CostSensitiveClassification
  CostSensitiveClassification Library in Python
  ☆208Updated 4 years ago
• neurodata / SPORF
  This is the implementation of Sparse Projection Oblique Randomer Forest
  ☆99Updated last year
• nnikolaou / Cost-sensitive-Boosting-Tutorial
  Tutorial on cost-sensitive boosting and calibrated AdaMEC.
  ☆26Updated 8 years ago
• EpistasisLab / scikit-mdr
  A sklearn-compatible Python implementation of Multifactor Dimensionality Reduction (MDR) for feature construction.
  ☆125Updated last month
• asdspal / dimRed
  python, scala, and pyspark code for few dimensional reduction algorithms
  ☆62Updated 7 years ago
• minepy / mictools
  A practical tool for Maximal Information Coefficient (MIC) analysis
  ☆135Updated last year
• sramirez / fast-mRMR
  An improved implementation of the classical feature selection method: minimum Redundancy and Maximum Relevance (mRMR).
  ☆83Updated 3 years ago
• padilha / biclustlib
  A Python library of biclustering algorithms, evaluation measures and datasets.
  ☆54Updated 5 years ago
• Jianbo-Lab / CCM
  ☆74Updated 6 years ago
• kingfengji / eForest
  This is the official implementation for the paper 'AutoEncoder by Forest'
  ☆75Updated 7 years ago
• hlin117 / mdlp-discretization
  An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad
  ☆105Updated 2 years ago
• riken-aip / pyHSICLasso
  Versatile Nonlinear Feature Selection Algorithm for High-dimensional Data
  ☆185Updated 3 years ago
• Yu-Group / iterative-Random-Forest
  Python implementation of iterative-random-forests
  ☆66Updated last year
• jakevdp / lpproj
  Scikit-learn compatible Locality Preserving Projections in Python
  ☆94Updated 6 years ago
• danielhomola / mifs
  Parallelized Mutual Information based Feature Selection module.
  ☆286Updated 3 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
• yhenon / pyrcc
  Python implementation of Robust Continuous Clustering
  ☆107Updated 6 years ago
• abidlabs / contrastive
  Contrastive PCA
  ☆214Updated 8 months ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆174Updated 3 years ago
• thuijskens / scikit-hyperband
  A scikit-learn compatible implementation of hyperband
  ☆76Updated 5 years ago
• irashavitt / regularization_learning_networks
  Implementation of RLNs, as described in https://arxiv.org/abs/1805.06440
  ☆35Updated 7 years ago
• GuipengLi / Dcluster
  Clustering by fast search and find of density peaks
  ☆77Updated 6 years ago
• EpistasisLab / ReBATE
  Relief Based Algorithms of ReBATE implemented in Python with Cython optimization. This repository is no longer being updated. Please see…
  ☆33Updated 7 years ago
• EpistasisLab / scikit-rebate
  A scikit-learn-compatible Python implementation of ReBATE, a suite of Relief-based feature selection algorithms for Machine Learning.
  ☆418Updated 2 years ago
• suinleelab / treeexplainer-study
  Code and documentation for experiments in the TreeExplainer paper
  ☆186Updated 5 years ago
• bbalasub1 / glmnet_python
  ☆204Updated last year