Search Results for author:
Found 8 papers, 3 papers with code
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
We present parameterized approximation algorithms with approximation ratios $1+ \frac{2}{e}$, $1+\frac{8}{e}$ and $3$ for diversity-aware $k$-median, diversity-aware $k$-means and diversity-aware $k$-supplier, respectively.
Generalized Leverage Scores: Geometric Interpretation and Applications
In particular, leverage scores, which relate the columns of a matrix to the subspaces spanned by its leading singular vectors, are helpful in revealing column subsets to approximately factorize a matrix with quality guarantees.
Discovering conflicting groups in signed networks
In this paper we study the problem of detecting $k$ conflicting groups in a signed network.
Off-the-grid: Fast and Effective Hyperparameter Search for Kernel Clustering
In this paper we study the impact of kernel parameters on kernel $k$-means.
Searching for polarization in signed graphs: a local spectral approach
In this paper we formulate the problem of finding local polarized communities in signed graphs as a locally-biased eigen-problem.
Regularized Greedy Column Subset Selection
The Column Subset Selection Problem provides a natural framework for unsupervised feature selection.
Using Machine Learning to Detect Noisy Neighbors in 5G Networks
5G networks are expected to be more dynamic and chaotic in their structure than current networks.
