98 citations · 365 across the 61 of their papers we have counts for
5 papers · 1 filter
epsilon-Samples of Kernels
Jeff M. Phillips
We study the worst case error of kernel density estimates via subset approximation. A kernel density estimate of a distribution is the convolution of that distribution with a fixed…
Generating a Diverse Set of High-Quality Clusterings
Jeff M. Phillips, Parasaran Raman, Suresh Venkatasubramanian
We provide a new framework for generating multiple good quality partitions (clusterings) of a single data set. Our approach decomposes this problem into two components, generating…
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
Jeff M. Phillips, Elad Verbin, Qin Zhang
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the \emph{blackboard model} (where each message is written on a blackboard for all pl…
A Gentle Introduction to the Kernel Distance
Jeff M. Phillips, Suresh Venkatasubramanian
This document reviews the definition of the kernel distance, providing a gentle introduction tailored to a reader with background in theoretical computer science, but limited expos…
Spatially-Aware Comparison and Consensus for Clusterings
Parasaran Raman, Jeff M. Phillips, Suresh Venkatasubramanian
This paper proposes a new distance metric between clusterings that incorporates information about the spatial distribution of points and clusters. Our approach builds on the idea o…