NaegleLab / OpenEnsembles
Code for ensemble clustering
☆102Updated 3 years ago
Alternatives and similar repositories for OpenEnsembles:
Users that are interested in OpenEnsembles are comparing it to the libraries listed below
- A package for combining multiple partitions into a consolidated clustering. The combinatorial optimization problem of obtaining such a co…☆70Updated 2 years ago
- scikit-fusion: Data fusion via collective latent factor models☆147Updated last year
- scikit-learn compatible implementation of stability selection.☆212Updated last year
- Feature Selection for Clustering☆96Updated 7 years ago
- Code used in the paper "Time Series Clustering via Community Detection in Networks"☆37Updated 5 years ago
- Integrative orthogonal non-negative matrix factorization☆31Updated 5 years ago
- This is the implementation of Sparse Projection Oblique Randomer Forest☆98Updated 11 months ago
- Python implementation of Robust Continuous Clustering☆105Updated 5 years ago
- Clustering by fast search and find of density peaks☆62Updated 4 years ago
- Tutorial on cost-sensitive boosting and calibrated AdaMEC.☆26Updated 7 years ago
- Clustering by fast search and find of density peaks☆77Updated 6 years ago
- Python toolbox for nonnegative matrix factorization☆114Updated 6 years ago
- ☆74Updated 6 years ago
- An extended package for clustering similarity☆64Updated 3 months ago
- Scikit-learn compatible Locality Preserving Projections in Python☆93Updated 6 years ago
- A sklearn-compatible Python implementation of Multifactor Dimensionality Reduction (MDR) for feature construction.☆125Updated last year
- A practical tool for Maximal Information Coefficient (MIC) analysis☆132Updated last year
- Code, notebooks and examples with ECG: Ensemble Clustering for Graphs☆32Updated 2 years ago
- Graph regularized nonnegative matrix factorization (GNMF) in Python☆45Updated 5 years ago
- Fast methods for non-negative matrix tri-factorization☆15Updated 5 years ago
- Parallelized Mutual Information based Feature Selection module.☆286Updated 3 years ago
- Probabilistic Principal Component Analysis☆62Updated 7 years ago
- A scikit-learn compatible implementation of hyperband☆76Updated 5 years ago
- An improved implementation of the classical feature selection method: minimum Redundancy and Maximum Relevance (mRMR).☆83Updated 3 years ago
- A deep clustering algorithm. Code to reproduce results for our paper N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of …☆131Updated last year
- Positive and unlabeled learning wrappers for scikit-learn☆232Updated 7 years ago
- An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad☆105Updated last year
- code for paper "Attributed Network Embedding via Subspace Discovery"☆21Updated 6 years ago
- A Python library of biclustering algorithms, evaluation measures and datasets.☆51Updated 5 years ago
- A scikit-learn-compatible Python implementation of ReBATE, a suite of Relief-based feature selection algorithms for Machine Learning.☆416Updated 2 years ago