54 citations · 102 across the 4 of their papers we have counts for
6 papers
Monotonic Calibrated Interpolated Look-Up Tables
Maya Gupta, Andrew Cotter, Jan Pfeifer +5
Real-world machine learning applications may require functions that are fast-to-evaluate and interpretable. In particular, guaranteed monotonicity of the learned function can be cr…
Efficient Clustering with Limited Distance Information
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model w…
Local algorithms for interactive clustering
Pranjal Awasthi, Maria-Florina Balcan, Konstantin Voevodski
We study the design of interactive clustering algorithms for data sets satisfying natural stability assumptions. Our algorithms start with any initial clustering and only make loca…
Non-Conservative Diffusion and its Application to Social Network Analysis
Rumi Ghosh, Kristina Lerman, Tawan Surachawala +2
The random walk is fundamental to modeling dynamic processes on networks. Metrics based on the random walk have been used in many applications from image processing to Web page ran…
Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
We study the problem of efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and…
Efficient Clustering with Limited Distance Information
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model w…