Deep Autoencoder-like NMF with Contrastive Regularization and Feature Relationships preservation
☆17Aug 15, 2022Updated 3 years ago
Alternatives and similar repositories for DANMF_CRFR
Users that are interested in DANMF_CRFR are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Elastic Adversarial Deep Nonnegative Matrix Factorization for Matrix Completion☆11Dec 3, 2022Updated 3 years ago
- Multi-label feature selection via robust flexible sparse regularization☆29Jun 24, 2025Updated 11 months ago
- Multilabel Feature Selection With Constrained Latent Structure Shared Term☆17Jun 25, 2025Updated 11 months ago
- Datasets for fairness-aware machine learning☆13Mar 4, 2025Updated last year
- [TNNLS 2022] Embedding Graph Auto-Encoder for Graph Clustering☆25Apr 6, 2022Updated 4 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- This repository hosts the code and the additional materials for the paper "ProtoMF: Prototype-based Matrix Factorization for Effective an…☆12Jan 11, 2023Updated 3 years ago
- Collection of commonly used multi-view datasets.☆108Jul 9, 2023Updated 2 years ago
- Source code for the paper "Dual Contrastive Learning Network for Graph Clustering"☆12Jan 9, 2024Updated 2 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆11Dec 24, 2021Updated 4 years ago
- [ICASSP 2024] Official implementation of our paper "Contrastive Deep Nonnegative Matrix Factorization for Community Detection"☆43May 22, 2025Updated last year
- Theano-based implementation of Deep Semi-NMF.☆121Nov 16, 2015Updated 10 years ago
- Public Network Latency Datasets gathered from two platforms: PlanetLab and Seattle☆18Jan 5, 2018Updated 8 years ago
- This repo contains some benchmarks for evaluating Multi-view Multi-class machine learning algorithms.☆17May 28, 2026Updated last week
- Deep Clustering Analysis via Dual Variational Autoencoder with Spherical Latent Embeddings powered by@torch☆12Dec 12, 2021Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Deep Autoencoder-like NMF☆23Jan 22, 2021Updated 5 years ago
- ☆15Nov 12, 2020Updated 5 years ago
- ☆13Feb 12, 2024Updated 2 years ago
- This is the repository for our paper "GAN-based Matrix Factorization for Recommender Systems" accepted at ACM/SIGAPP Symposium on Applied…☆18Aug 22, 2022Updated 3 years ago
- ☆13Apr 2, 2025Updated last year
- ☆17Mar 26, 2022Updated 4 years ago
- [TNNLS 2023] An official source code for paper "Simple Contrastive Graph Clustering".☆41Mar 2, 2025Updated last year
- [Accepted by TNNLS] Source Code for Relational Redundancy-Free Graph Clustering☆13Sep 24, 2023Updated 2 years ago
- ☆30Aug 21, 2021Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- The source code for the paper "LightFR: Lightweight Federated Recommendation with Privacy-preserving Matrix Factorization".☆19Dec 3, 2023Updated 2 years ago
- ☆11Jun 21, 2022Updated 3 years ago
- ☆11May 21, 2022Updated 4 years ago
- Finding the conditional distributions of a Gaussian Mixture Model☆13Nov 10, 2019Updated 6 years ago
- ☆18Sep 1, 2022Updated 3 years ago
- ☆11Oct 25, 2022Updated 3 years ago
- ☆14Aug 14, 2023Updated 2 years ago
- Code for our WWW'2020 paper "Efficient Neural Interaction Function Search for Collaborative Filtering"☆25Feb 16, 2020Updated 6 years ago
- ☆39Mar 29, 2021Updated 5 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Pytorch implementation of XGNN☆10Jan 20, 2021Updated 5 years ago
- ☆10Dec 17, 2023Updated 2 years ago
- ☆11May 14, 2023Updated 3 years ago
- Deep Embedding for Clustering (accuracy can reach over 87.5%)☆13Jan 14, 2023Updated 3 years ago
- Implementation of : "Greene, Derek, Donal Doyle, and Padraig Cunningham. "Tracking the evolution of communities in dynamic social network…☆12May 5, 2022Updated 4 years ago
- IJCAI 2022 Attributed Graph Clustering with Dual Redundancy Reduction☆15Oct 27, 2024Updated last year
- Local Motif Clustering on Time-Evolving Graphs, KDD 2020☆10Mar 12, 2025Updated last year