45 citations · 204 across the 40 of their papers we have counts for
5 papers · 1 filter
Hierarchical Clustering for Euclidean Data
Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh +1
Recent works on Hierarchical Clustering (HC), a well-studied problem in exploratory data analysis, have focused on optimizing various objective functions for this problem under arb…
Hierarchical Clustering better than Average-Linkage
Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh
Hierarchical Clustering (HC) is a widely studied problem in exploratory data analysis, usually tackled by simple agglomerative procedures like average-linkage, single-linkage or co…
Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
Nima Anari, Rad Niazadeh, Amin Saberi +1
The Bayesian online selection problem aims to design a pricing scheme for a sequence of arriving buyers that maximizes the expected social welfare (or revenue) subject to different…
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
In this paper we study the fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. Thi…
Hierarchical Clustering with Structural Constraints
Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar
Hierarchical clustering is a popular unsupervised data analysis method. For many real-world applications, we would like to exploit prior information about the data that imposes con…