Search Results for author:
Found 3 papers, 0 papers with code
Towards Practical Explainability with Cluster Descriptors
The goal is to find a representative set of tags for each cluster, referred to as the cluster descriptors, with the constraint that these descriptors we find are pairwise disjoint, and the total size of all the descriptors is minimized.
Ising-Based Louvain Method: Clustering Large Graphs with Specialized Hardware
Recent advances in specialized hardware for solving optimization problems such quantum computers, quantum annealers, and CMOS annealers give rise to new ways for solving real-word complex problems.
Binary matrix factorization on special purpose hardware
In this work, we focus on the important binary matrix factorization (BMF) problem which has many applications in data mining.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
