Search Results for author:
Found 7 papers, 0 papers with code
Shrub Ensembles for Online Classification
Among the most successful online learning methods are Decision Tree (DT) ensembles.
Softmax-based Classification is k-means Clustering: Formal Proof, Consequences for Adversarial Attacks, and Improvement through Centroid Based Tailoring
We formally prove that networks with a small Lipschitz modulus (which corresponds to a low susceptibility to adversarial attacks) map data points closer to the cluster centroids, which results in a mapping to a k-means-friendly space.
k is the Magic Number -- Inferring the Number of Clusters Through Nonparametric Concentration Inequalities
In this paper, we strive to determine the number of clusters by answering a simple question: given two clusters, is it likely that they jointly stem from a single distribution?
The Trustworthy Pal: Controlling the False Discovery Rate in Boolean Matrix Factorization
The Boolean product is a disjunction of rank-1 binary matrices, each describing a feature-relation, called pattern, for a group of samples.
The SpectACl of Nonconvex Clustering: A Spectral Approach to Density-Based Clustering
When it comes to clustering nonconvex shapes, two paradigms are used to find the most suitable clustering: minimum cut and maximum density.
The PRIMPing Routine -- Tiling through Proximal Alternating Linearized Minimization
In contrast to existing work, the new algorithm minimizes the description length of the resulting factorization.
C-SALT: Mining Class-Specific ALTerations in Boolean Matrix Factorization
Given labeled data represented by a binary matrix, we consider the task to derive a Boolean matrix factorization which identifies commonalities and specifications among the classes.
