research
∙
12/07/2021
Shrub Ensembles for Online Classification
Online learning algorithms have become a ubiquitous tool in the machine ...
share
research
∙
01/07/2020
Softmax-based Classification is k-means Clustering: Formal Proof, Consequences for Adversarial Attacks, and Improvement through Centroid Based Tailoring
We formally prove the connection between k-means clustering and the pred...
research
∙
07/04/2019
k is the Magic Number -- Inferring the Number of Clusters Through Nonparametric Concentration Inequalities
Most convex and nonconvex clustering algorithms come with one crucial pa...
research
∙
07/01/2019
The Trustworthy Pal: Controlling the False Discovery Rate in Boolean Matrix Factorization
Boolean matrix factorization (BMF) is a popular and powerful technique f...
research
∙
07/01/2019
The SpectACl of Nonconvex Clustering: A Spectral Approach to Density-Based Clustering
When it comes to clustering nonconvex shapes, two paradigms are used to ...
research
∙
06/17/2019
